Loading…
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...
| Call Number: | Libro Electrónico |
|---|---|
| Main Author: | |
| Other Authors: | |
| Format: | Electronic eBook |
| Language: | Inglés |
| Published: |
Amsterdam ; New York :
Elsevier,
2000.
|
| Edition: | 1st ed. |
| Series: | Studies in logic and the foundations of mathematics ;
v. 144. |
| Subjects: | |
| Online Access: | Texto completo Texto completo Texto completo |
Table of Contents:
- Preface. Computability. The arithmetical hierarchy. Languages and structures. Ordinals. The hyperarithmetical hierarchy. Infinitary formulas. Computable infinitary formulas. The Barwise-Kreisel Compactness Theorem. Existence of computable structures. Completeness and forcing. The Ash-Nerode Theorem. Computable categoricity and stability. <IT>n</IT>-systems. A-systems. Back-and forth relations. Theorems of Barker and Davey. Pairs of computable structures. Models of arithmetic. Special classes of structures.