You might also like

More about Computable Structures and the Hyperarithmetical Hierarchy

• Book details
• Synopsis
• Trending among others

You get 356 loyalty points

Book synopsis

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).

Book details

Book category Knihy po anglicky Mathematics & science Science: general issues Maths for scientists

• Full title: Computable Structures and the Hyperarithmetical Hierarchy
• Author: C.J. Ash, J. Knight
• Language: English
• Binding: Hardback
• Number of pages: 366
• EAN: 9780444500724
• ISBN: 0444500723
• ID: 04610691
• Publisher: Elsevier Science
• Weight: 680 g
• Dimensions: 233 × 163 × 20 mm
• Date of publishing: 16. June 2000

Trending among others

---

---

---