Computable Structures and the Hyperarithmetical Hierarchy

C.J. Ash, J. Knight

ISBN 10: 0444500723 / ISBN 13: 9780444500724

Published by Elsevier Science and Technology, GB, 2000

About this Item

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

Seller Inventory # LU-9780444500724

Bibliographic Details

• Title: Computable Structures and the Hyperarithmetical Hierarchy
• Publisher: Elsevier Science and Technology, GB
• Publication Date: 2000
• Language: English
• ISBN 10: 0444500723
• ISBN 13: 9780444500724
• Binding: Hardback
• Condition: New
• Weight: 680 grams

About this title

Synopsis

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