Cargando…
Elementary induction on abstract structures /
Provability, Computability and Reflection.
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Amsterdam : New York :
North-Holland Pub. Co. ; American Elsevier Pub. Co.,
1974.
|
| Colección: | Studies in logic and the foundations of mathematics ;
v. 77. |
| Temas: | |
| Acceso en línea: | Texto completo Texto completo Texto completo |
Tabla de Contenidos:
- Front Cover; Elementary Induction on Abstract Structures; Copyright Page; Preface; CONTENTS; Introduction; Chapter 1. Positive elementary inductive deflnitions; 1A. Monotone operators; 1B. Relative positive inductive definability; 1C. Combining inductions; 1D. Inductive definability on a structure; Exercises; Chapter 2. The stages of an inductive definition; 2A. The Stage Comparison Theorem; 2B. Closure ordinals and the Closure Theorem; Exercises; Chapter 3. Structure theory for inductive relations; 3A. Inductive norms and the Prewellordering Theorem; 3B. Making hyperelementary selections
- 3C. The Boundedness and Covering Theorems. 3D. Expanding a structure by an inductive relation; 3E. Generalization of the theory to richer languages; Exercises; Chapter 4. Games and game quantifiers; 4A. Interpreting quantifier strings via games; 4B. A canonical form for positive formulas; 4C. Explicit formulas for inductive relations; Exercises; Chapter 5. Acceptable structures; 5A. Coding schemes; 5B. Satisfaction is hyperelementary; 5C. The quantifier G; 5D. Parametrizations and universal sets; Exercises; Chapter 6. Inductive second order relations
- 6A. Relativization of inductive definitions examples; 6B. Transitivity, Substitutivity and Positive Induction Completeness; 6C. Extension of the theory to second order relations; 6D. The class of hyperelementary relations; Exercises; Chapter 7. Second order characterizations; 7A. Inductive and S1 1 relations; 7B. Quasistrategies; 7C. The Second Stage Comparison Theorem; 7D. The Abstract Spector-Gandy Theorem; 7E. The hierarchy of hyperelementary sets; 7F. Model theoretic characterizations; Exercises; Chapter 8. Countable acceptable structures; 8A. The Abstract Kleene Theorem
- 8B. The Perfect Set Theorem8C. The intersection of U-models of second order comprehension; 8D. Counterexamples to special properties of arithmetic; the language L?1,G; 8E. The Suslin-Kleene Theorem; Exercises; Chapter 9. The next admissible set; 9A. Spector classes of relations; 9B. Examples of Spector classes; 9C. Structure theory for Spector classes; 9D. Admissible sets; 9E. The companion of a Spector class; 9F. The next admissible set; Exercises; References; Index; Index of symbols