Computable structures and the hyperarithmetical hierarchy

140,00

Sin impuestos: 134,62

Autor/es
Ash, Christopher J.
Knight, Julia F.
ISBN13
9780444500724
ISBN10
0444500723
Tipo
LIBRO
Año de Edición
2000
Idioma
inglés
Encuadernación
Cartone
Editorial:
ELSEVIER SCIENCE PUBLISHERS
Disponibilidad:
Consulte disponibilidad

No puntuado
Opinar
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).
-            +

Nota: No se traduce HTML


Continuar

Información

Horario:
De Lunes a Sabados: 10:00-20:30h

C/Balmes 26
08007 / Barcelona /España
[Ver mapa]

Contacto

+34 93 317 05 78
+34 93 412 27 02
alibri@alibri.cat
alibri@alibri.es