ENGLISH

Computable structures and the hyperarithmetical hierarchy

By C.J. Ash , J. Knight

Book information

Publisher
Elsevier
Year
2000
ISBN
0444500723, 9780444500724, 9780080529523
Language
english
Format
DJVU
Filesize
2 MB (2155247 bytes)
Series
Studies in Logic and the Foundations of Mathematics 144
Edition
1
Pages
363\363
Topic
Mathematics Logic
Library
Kolxo3
DPI
300
Time added
2009-07-20 03:45:11

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

Similar books