Computable structures and the hyperarithmetical hierarchy:
Saved in:
Bibliographic Details
Main Author: Ash, C. J. (Author)
Format: Electronic eBook
Language:English
Published: Amsterdam Elsevier 2000
Edition:1st ed
Series:Studies in logic and the foundations of mathematics v. 144
Subjects:
Online Access:Volltext
Item 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)
Includes bibliographical references (p. 323-333) and index
Physical Description:1 Online-Ressource (xv, 346 p.)
ISBN:9780444500724
0444500723
9780080529523
0080529526

There is no print copy available.

Interlibrary loan Place Request Caution: Not in THWS collection! Get full text