Contributions to Mathematical Logic

Name: Contributions to Mathematical Logic | Proceedings of the Logic Colloquium, Hannover 1966
Brand: Elsevier
Price: 215.0 EUR
Availability: OnlineOnly

Proceedings of the Logic Colloquium, Hannover 1966

Lev D. Beklemishev(Autor*in)

Elsevier (Verlag)

Erschienen am 14. Mai 2014

311 Seiten

E-Book

PDF mit Wasserzeichen-DRM

Systemvoraussetzungen

978-0-08-095769-2 (ISBN)

215,00 €inkl. 7% MwSt.

Systemvoraussetzungen

für PDF mit Wasserzeichen-DRM

E-Book Einzellizenz

Als Download verfügbar

Beschreibung

Weitere Details

Weitere Ausgaben

Inhalt

Front Cover
Contributions to Mathematical Logic
Copyright Page
Contents
CHAPTER 1. SATURATED INTUITIONISTIC THEORIES
Introduction
1. Preliminaries
2. Completeness Proof
3. Kripke Structures
4. Two Examples of Saturated Theories
5. Final Remarks
References
CHAPTER 2. DECISION PROBLEMS ABOUT ALGEBRAIC AND LOGICAL SYSTEMS AS A WHOLE AND RECURSIVELY ENUMERABLE DEGREES OF UNSOLVABILITY
1. Introduction
2. Statement of Results
3. Proofs of results
Supplement to Boone's "Algebraic Systems
CHAPTER 3. ON RECURSIVELY UNSOLVABLE PROBLEMS IN TOPOLOGY AND THEIR CLASSIFICATION
0. Introduction
Statement of Results
1. Logic
2. Algebra
3. Topology
References
CHAPTER 4. CONSTRUCTIVE THERMODYNAMICS
1.
2.
3.
4.
5.
6.
7.
Acknowledgements
References
CHAPTER 5. A DEDUCTION THEOREM FOR INFERENTIAL PREDICATE CALCULUS
1. Introduction
2. The Deduction Theorem
3. Extension to Modal Systems
4. Representation of the Outer System in the Inner
5. Theorems of Glivenko Type
References
CHAPTER 6. ZUR BERECHENBARKEIT PRIMITIV-REKURSIVER FUNKTIONALE ENDLICHER TYPEN
1. Ein Formales System S Von Termen Endlicher Typen
2. Regulare Terme
3. Eine Hierarchie Arithmetischer Operationen
4. Ersetzung Der Bar-Induktion Durch Transfinite Induktion
Literatur
CHAPTER 7. EQUATIONAL MAPS
1. A Review of Free Algebras
2. Algebraic Operations
3. Reducts
4. Equational and Functorial Maps
5. Construction of Equational Maps
6. Definable Maps and Syntactical Equivalences
Appendix
References
CHAPTER 9. SOME FORMS OF MODELS OF PROPORTIONAL CALCULI
1. Introduction
2. Models of Propositional Calculi
3. Modified S-Model
4. ms-Models and the Finite Model Property
References
CHAPTER 10. LENGTHS OF FORMULAS AND ELIMINATION OF QUANTIFIERS I
Introduction
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
References
CHAPTER 11. A DECISION PROCEDURE FOR THE WEAK SECOND ORDER THEORY OF LINEAR ORDER
1. A Decidability Criterion
2. The Ws Theory of Linear Order
3. Proof of Theorem 1
4. Proof of Theorem 2
References
CHAPTER 12. STRUKTURZAHLEN IN ENDLICHEN RELATIONSSYSTEMEN
1. Ejnleitung
2. Anwendung Des Polyaschen Satzes Auf Das Anzahlproblem
3. Auswertung Der Polya-Formel Fur Reine Relationssysteme Mit U&s 1
4. Auswertung Der Polya-Formel Fur Reine Relationssysteme Mit U=s 1
Literatur
CHAPTER 13. A SURVEY OF SOME CONNECTIONS BETWEEN CLASSICAL INTUITIONISTIC AND MINIMAL LOGIC
1. Preliminaries
2. Interpretability
3. Theorems
4. Discussion
5. Proofs
References
CHAPTER 14. ZUR SEMANTIK DER INTUITIONISTISCHEN AUSSAGENLOGIK
CHAPTER 15. RECURSION THEORY AND THE THEOREM OF RAMSEY IN ONE-PLACE SECOND ORDER SUCCESSOR ARITHMETIC.
1. The System SC
2. Recursion Theory
3. The Theorem of Ramsey
References
CHAPTER 16. REFLECTION PRINCIPLES OF SUBSYSTEMS OF ANALYSIS
Chapter I
Chapter II
References
CHAPTER 17. EQUATIONAL LOGIC AND EQUATIONAL THEORIES OF
1. Algebras and Their Equational Theories
2. Finitely Based Theories
3. One-Based Theories
4. Independent Bases
5. Consistent and Complete Theories
the Lattice of Equational Theories
6. Decision Problems
References
CHAPTER 18. THE USE OF "BROUWER'S PRINCIPLE" IN INTUITIONISTIC TOPOLOGY
1. Notations and Conventions
2. A Few Technicalities
3. Applications
References

Systemvoraussetzungen

Als PDF speichern Als Link merken