Computable Structures and the Hyperarithmetical Hierarchy

C. J. Ash

ISBN 10: 0444500723 / ISBN 13: 9780444500724

Published by Elsevier BV Jun 2000, 2000

About this Item

Neuware - 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 # 9780444500724

Bibliographic Details

• Title: Computable Structures and the Hyperarithmetical Hierarchy
• Publisher: Elsevier BV Jun 2000
• Publication Date: 2000
• Language: English
• ISBN 10: 0444500723
• ISBN 13: 9780444500724
• Binding: Buch
• Condition: Neu
• Dimensions: 234W x 156H x 21D millimeters 234 millimeters width by 156 millimeters height by 21 millimeters depth
• Weight: 686 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).