Theory of Formal Systems. (AM-47), Volume 47 (Annals of Mathematics Studies (47)) 069108047X, 9780691080475

This book serves both as a completely self-contained introduction and as an exposition of new results in the field of re

523 44 2MB

English Pages 156 [157] Year 1961

Report DMCA / Copyright

DOWNLOAD FILE

Theory of Formal Systems. (AM-47), Volume 47 (Annals of Mathematics Studies (47))
 069108047X, 9780691080475

Table of contents :
Title
Copyright
Dedication
Preface
Table of Contents
I – Formal Mathematical Systems
#A. Elementary Formal Systems
§0. Motivation
§1. Definition of an Elementary Formal System
§2. Alternative Formulation of Elementary Formal Systems
§3. Representability
§4. Mathematical Systems
#B. Recursive Enumerability
§5. Recursively Enumerable Attributes of Positive Integers
§6. Godel Numbering
§7. The Universal System U
§8. The Recursive Unsolvability of U
Appendix – Formal Representability of T and To
II – Formal Representability and Recursive Enumerability
§0. Some Preliminary Principles
#A. Closure Properties
§1. Closure under Existential Definability
§2. Solvability over K
#B. Recursive Enumerability
§3. Recursive Enumerability of Some Basic Arithmetical Attributes
§4. Recursive and Partial Recursive Functions
§5. Finite Quantification; Constructive Definability
#C. Transformations on Alphabets; Godel Numbering
§6. Extension of Alphabets
§7. Dyadic Godel Numbering
§8. Solvability
§9. Lexicographical Ordering; n-Adic Representation of Numbers
§10. Admissible Godel Correspondences
§11. Further Facts about Admissibility (optional)
#D. A Brief Summary
III – Incompleteness and Undecidability
#A. Incompleteness
§1. Representation Systems
§2. First Diagonalization Lemma; Tarski's Theorem
§3. Consistency and Completeness; Godel's Theorem
§4. Complete Representability and Definability in Z
§5. Separability within Z; Rosser's Theorems
§6. Symmetric Systems
§7. Extensions
#B. Undecidability
§8. Systems with an "Effective" Representation Function
§9. Undecidability
§10. Normality
§11. Additional Theorems
§12. Universal Systems
§13. Undecidability and Incompleteness
#C. Undecidability and Recursive Inseparability
§14. Definability in Formal Systems
§15. Extensions
§16. Recursive Inseparability
§17. Separation of R.I. Sets within Systems
§18. Rosser Systems
§19. Recursive Inseparability of the Diagonal Sets T*, R*
IV – Recursive Function Theory
#A. Effective Operations and Fixed Point Theorems
§1. Enumeration Theorem
§2. Indexing
§3. Iteration Theorems for r.e. Relations
§4. Effective Operations
§5. Fixed Point Theorems
§6. Double Recursion Theorems
#B. Construcive Arithmetic and Rudimentary Attributes
§7. Some Preliminaries
§8. Dyadic Concatenation
§9. Rudimentary Attributes
§10. Pure Elementary Formal Systems
§11. Arithmetization of Elementary Dyadic Arithmetics
#C. Enumeration and Normal Form Theorems
§12. Kleene Enumeration Theorem
§13. Separation of Differences of r.e. Sets
§14. Partial Recursive Functions
§15. Functional Indexing
V – Creativity and Effective Inseparability
#A. Creativity and Effective Inseparability
§1. Productive and Creative Sets; Recursive and Effective Inseparability
§2. Many-One and One-One Reducibility
§3. Creative Systems
§4. Effective Inseparability
§5. Effective Rosser Systems
#B. Further Theory of Productive Sets
§6. Weakly Productive Functions
§7. Uniform Reducibility
§8. Universal Sets
§9. On Uniform Reducibility
§10. Uniform Representability
§11. Bi-Uniformity
#C. Effective Inseparability and Double Productivity
§12. Doubly Productive Pairs
§13. Reducibility of Pairs to Pairs
#D. Double Universality
§14. Double Universal and Totally Doubly Universal Pairs
§15. Uniform Reducibility
§16. Weakly Doubly Productive Pairs
§17. On Doubly Productive Pairs
§18. Application to Rosser Systems
§19. Uniform Reducibility
§20. A Generalization of Effective Inseparability
§21. Total Double Universality
#E. Double Isomorphism
§22. Double Isomorphism
§23. 1-1 Equivalence and Double Isomorphism
§24. Double Isomorphism of Rosser Systems
Supplement – Applications to Mathematical Logic
§1. Theories
§2. Calculability of Functions; Normality
§3. omega-Consistency; Enumerability within (T); Godel's Theorem
§4. Rosser's Construction
§5. Godel Theories and Rosser Theories
§6. Theories in which Plus and Times are Definable
§7. Some Special Theories
§8. Essential Undecidability
§9. Essential Creativity
§10. Exact Rosser Theories
Reference and Brief Bibliography

Polecaj historie