Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New.
Condition: New.
Condition: New. In.
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New.
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition.
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: As New. Unread book in perfect condition.
Published by Elsevier Science and Technology, GB, 2000
ISBN 10: 0444500723 ISBN 13: 9780444500724
Language: English
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Hardback. Condition: New. This book describes a program of research in computable structure theory. The goal is to find definability conditions corresponding to bounds on complexity which persist under isomorphism. The results apply to familiar kinds of structures (groups, fields, vector spaces, linear orderings Boolean algebras, Abelian p-groups, models of arithmetic). There are many interesting results already, but there are also many natural questions still to be answered. The book is self-contained in that it includes necessary background material from recursion theory (ordinal notations, the hyperarithmetical hierarchy) and model theory (infinitary formulas, consistency properties).
Published by Elsevier Science and Technology, GB, 2000
ISBN 10: 0444500723 ISBN 13: 9780444500724
Language: English
Seller: Rarewaves.com UK, London, United Kingdom
Hardback. Condition: New. This book describes a program of research in computable structure theory. The goal is to find definability conditions corresponding to bounds on complexity which persist under isomorphism. The results apply to familiar kinds of structures (groups, fields, vector spaces, linear orderings Boolean algebras, Abelian p-groups, models of arithmetic). There are many interesting results already, but there are also many natural questions still to be answered. The book is self-contained in that it includes necessary background material from recursion theory (ordinal notations, the hyperarithmetical hierarchy) and model theory (infinitary formulas, consistency properties).
Published by Elsevier Science & Technology Jun 2000, 2000
ISBN 10: 0444500723 ISBN 13: 9780444500724
Language: English
Seller: AHA-BUCH GmbH, Einbeck, Germany
Buch. Condition: Neu. Neuware - This book describes a program of research in computable structure theory. The goal is to find definability conditions corresponding to bounds on complexity which persist under isomorphism. The results apply to familiar kinds of structures (groups, fields, vector spaces, linear orderings Boolean algebras, Abelian p-groups, models of arithmetic). There are many interesting results already, but there are also many natural questions still to be answered. The book is self-contained in that it includes necessary background material from recursion theory (ordinal notations, the hyperarithmetical hierarchy) and model theory (infinitary formulas, consistency properties).
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
HRD. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
HRD. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Published by Elsevier Science & Technology, 2000
ISBN 10: 0444500723 ISBN 13: 9780444500724
Language: English
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Hardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 717.