Computable Structures and the Hyperarithmetical Hierarchy: Volume 144 (Hardcover) (ISBN-13: 9780444500724)

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

Author: C. J. Ash, J. Knight
ISBN-10: 0444500723
ISBN-13: 9780444500724
Publisher: Elsevier Science
Language: English
Published: 06/16/2000
Pages: 366
Format: Hardcover
Weight: 1.52lbs
Size: 9.16h x 6.42w x 0.77d