Computable structures and the hyperarithmetical hierarchy:
Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Ash, C. J. (VerfasserIn)
Format: Elektronisch E-Book
Sprache:English
Veröffentlicht: Amsterdam Elsevier 2000
Ausgabe:1st ed
Schriftenreihe:Studies in logic and the foundations of mathematics v. 144
Schlagworte:
Online-Zugang:Volltext
Beschreibung: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)
Includes bibliographical references (p. 323-333) and index
Beschreibung:1 Online-Ressource (xv, 346 p.)
ISBN:9780444500724
0444500723
9780080529523
0080529526

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand! Volltext öffnen