Computable Structures and the Hyperarithmetical Hierarchy - Studies in Logic and the Foundations of Mathematics v. 144 (Hardback)
  • Computable Structures and the Hyperarithmetical Hierarchy - Studies in Logic and the Foundations of Mathematics v. 144 (Hardback)

Computable Structures and the Hyperarithmetical Hierarchy - Studies in Logic and the Foundations of Mathematics v. 144 (Hardback)

,
£89.00
Hardback Published: 01/05/2000
  • We can order this

Usually despatched within 3 weeks

  • This item has been added to your basket

Check Marketplace availability

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

Publisher: Elsevier Science & Technology
ISBN: 9780444500724

You may also be interested in...

Your review has been submitted successfully.

We would love to hear what you think of Waterstones. Why not review Waterstones on Trustpilot?


Review us on Trustpilot