Computable Structures and the Hyperarithmetical Hierarchy: Volume 144

by J.F. Knight, C.J. Ash, J. Knight

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

• Format: Hardcover
• Language: English
• ISBN: 0444500723
• ISBN13: 9780444500724
• Release Date: June 2000
• Publisher: Elsevier Science
• Length: 366 Pages
• Weight: 1.52 lbs.
• Dimensions: 0.8" x 6.4" x 9.2"