Computable structures and the hyperarithmetical hierarchy
Editorial ELSEVIER SCIENCE PUBLISHERS
Envío gratis
España peninsular
España peninsular
- Editorial ELSEVIER SCIENCE PUBLISHERS
- ISBN13 9780444500724
- ISBN10 0444500723
- Tipo LIBRO
- Año de Edición 2000
- Idioma Inglés
- Encuadernación Cartone
Computable structures and the hyperarithmetical hierarchy
Editorial ELSEVIER SCIENCE PUBLISHERS
-5% dto. 140,00€
133,00€
Ahorra 7,00€
No disponible, consulte disponibilidad
Envío gratis
España peninsular
España peninsular
Detalles del libro
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).