| Computable Structures and the Hyperarithmetical Hierarchy: Volume 144 Contributor(s): Ash, C. J. (Author), Knight, J. (Author) |
|
 |
ISBN: 0444500723 ISBN-13: 9780444500724 Publisher: Elsevier Science OUR PRICE: $131.67 Product Type: Hardcover - Other Formats Published: June 2000 Annotation: 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). |
| Additional Information |
| BISAC Categories: - Mathematics | Logic - Mathematics | Discrete Mathematics - Mathematics | Applied |
| Dewey: 511.3 |
| LCCN: 00034103 |
| Series: Studies in Logic and the Foundations of Mathematics |
| Physical Information: 0.77" H x 6.42" W x 9.16" (1.52 lbs) 366 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: 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). |