Cargando…
Computable structures and the hyperarithmetical hierarchy /
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 alge...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Otros Autores: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Amsterdam ; New York :
Elsevier,
2000.
|
| Edición: | 1st ed. |
| Colección: | Studies in logic and the foundations of mathematics ;
v. 144. |
| Temas: | |
| Acceso en línea: | Texto completo Texto completo Texto completo |
| Sumario: | 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). |
|---|---|
| Descripción Física: | 1 online resource (xv, 346 pages) |
| Bibliografía: | Includes bibliographical references (pages 323-333) and index. |
| ISBN: | 9780444500724 0444500723 9780080529523 0080529526 |