The Leading eBooks Store Online

for Kindle Fire, Apple, Android, Nook, Kobo, PC, Mac, BlackBerry ...

New to eBooks.com?

Learn more

Computable Structures and the Hyperarithmetical Hierarchy

Computable Structures and the Hyperarithmetical Hierarchy
Add to cart
US$ 170.00
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).
Elsevier Science; June 2000
366 pages; ISBN 9780080529523
Read online, or download in EPUB or secure PDF format