Computable Structures and the Hyperarithmetical Hierarchy (Volume 144) (Studies in Logic and the Foundations of Mathematics, Volume 144)
ANT
• Instant access to your digital edition.
• Read anytime, anywhere, on your favorite device.
• No shipping — your book is delivered digitally.
• Simple, secure access after purchase.
Instant digital delivery after purchase.
Discover another great read to add to your digital library.
Description
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).
Specifications
Frequently asked
Do I need an account to download?
No. After purchase, you can access your ebook directly from the order confirmation or download page.
What if a copy arrives damaged?
Contact us and we’ll help you access the file or provide a replacement download if needed.