Skip to main content

Save up to 30% on Elsevier print and eBooks with free shipping. No promo code needed.

Save up to 30% on print and eBooks.

Computable Structures and the Hyperarithmetical Hierarchy

1st Edition, Volume 144 - May 1, 2000

Authors: C.J. Ash, J. Knight

Language: English
Hardback ISBN:
9 7 8 - 0 - 4 4 4 - 5 0 0 7 2 - 4
eBook ISBN:
9 7 8 - 0 - 0 8 - 0 5 2 9 5 2 - 3

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… Read more

Computable Structures and the Hyperarithmetical Hierarchy

Purchase options

LIMITED OFFER

Save 50% on book bundles

Immediately download your ebook while waiting for your print delivery. No promo code is needed.

Institutional subscription on ScienceDirect

Request a sales quote
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).