Book contents
- Frontmatter
- Preface
- Opening speech of Petr Vopěnka
- Bolzano Medal awarded to Gaisi Takeuti
- Contents
- Collapsing Polynomial-Time Degrees
- Qualitative and Probabilistic Models of Full Belief
- Relative Splittings of in the-Enumeration Degrees
- A Realizability Interpretation for Classical Arithmetic
- An Axiomatization of Quantified Propositional Gödel Logic Using the Takeuti-Titani Rule
- Another Pathological Well-Ordering
- How Small Can the Set of Generics Be?
- Entailment Relations and Distributive Lattices
- The Friedberg Jump Inversion Theorem Revisited: A Study of Undefinable Cuts
- Hartley Rogers’ 1965 Agenda
- Liftings of Homomorphisms Between Quotient Structures and Ulam Stability
- Mathematical Fuzzy Logic – State of Art
- Reflections on the Last Delfino Problem
- Continuous Images of Coanalytic Sets
- Classification of Subsheaves over GL-Algebras
- On the Bit-Comprehension Rule
- Cardinal Invariants Associated with Predictors
- A Theorem on Countable Ordered Sets with an Application to Universal Graphs
- Dimension Theory and Smooth Stratification of Rigid Subanalytic Sets
- The Ramsey Structure of A-Determined Sets in a Saturated Universe
- On Definability of Admissible Sets
- Additive Theories
- Adding Multiplication to an O-minimal Expansion of the Additive Group of Real Numbers
- The Superjump in Martin-Löf Type Theory
- “Just Because”: Taking Belief Bases Seriously
- Artin Approximation via the Model Theory of Cohen-Macaulay Rings
- Ordinal Systems, Part 2: One Inaccessible
- Autonomous Fixed Point Progressions and Fixed Point Transfinite Recursion
- Finitary Reductions for Local Predicativity, I: Recursively Regular Ordinals
- The Complexity of Linear Logic with Weakening
- Some Remarks on the Maximality of Inner Models
- Author Index
- References
Ordinal Systems, Part 2: One Inaccessible
Published online by Cambridge University Press: 31 March 2017
By
Book contents
- Frontmatter
- Preface
- Opening speech of Petr Vopěnka
- Bolzano Medal awarded to Gaisi Takeuti
- Contents
- Collapsing Polynomial-Time Degrees
- Qualitative and Probabilistic Models of Full Belief
- Relative Splittings of in the-Enumeration Degrees
- A Realizability Interpretation for Classical Arithmetic
- An Axiomatization of Quantified Propositional Gödel Logic Using the Takeuti-Titani Rule
- Another Pathological Well-Ordering
- How Small Can the Set of Generics Be?
- Entailment Relations and Distributive Lattices
- The Friedberg Jump Inversion Theorem Revisited: A Study of Undefinable Cuts
- Hartley Rogers’ 1965 Agenda
- Liftings of Homomorphisms Between Quotient Structures and Ulam Stability
- Mathematical Fuzzy Logic – State of Art
- Reflections on the Last Delfino Problem
- Continuous Images of Coanalytic Sets
- Classification of Subsheaves over GL-Algebras
- On the Bit-Comprehension Rule
- Cardinal Invariants Associated with Predictors
- A Theorem on Countable Ordered Sets with an Application to Universal Graphs
- Dimension Theory and Smooth Stratification of Rigid Subanalytic Sets
- The Ramsey Structure of A-Determined Sets in a Saturated Universe
- On Definability of Admissible Sets
- Additive Theories
- Adding Multiplication to an O-minimal Expansion of the Additive Group of Real Numbers
- The Superjump in Martin-Löf Type Theory
- “Just Because”: Taking Belief Bases Seriously
- Artin Approximation via the Model Theory of Cohen-Macaulay Rings
- Ordinal Systems, Part 2: One Inaccessible
- Autonomous Fixed Point Progressions and Fixed Point Transfinite Recursion
- Finitary Reductions for Local Predicativity, I: Recursively Regular Ordinals
- The Complexity of Linear Logic with Weakening
- Some Remarks on the Maximality of Inner Models
- Author Index
- References
- Type
- Chapter
- Information
- Logic Colloquium '98 , pp. 426 - 448Publisher: Cambridge University PressPrint publication year: 2000
References
1. . Normalfunktionen und konstruktive Systeme von Ordinalzahlen. In and , editors, Proof Theory Symposion, Kiel 1974, volume 500 of Springer Lecture Notes in Mathematics, pages 4 – 25, Berlin, Heidelberg, New York, 1975. Springer.
2. . A new system of proof-theoretic ordinal functions. Ann. Pure a. Appl. Logic, 32:195–207, 1986.Google Scholar
3. . Wellordering proofs for systems of fundamental sequences. Draft, München, 1990.
4. . A simplified version of local predicativity. In , , and , editors, Proof Theory. A selection of papers from the Leeds Proof Theory Programme 1990, pages 115–147, Cambridge, 1992. Cambridge University Press.
5. and . Proof Theory of Impredicative Subsystems of Analysis. Bibliopolis, Naples, 1988.
6. . Proof theory and logical complexity. Handwritten notes, 1135 pp.
8. . A well-ordering proof for Feferman's theory T0. Arch. math. Logic, 23:65–77, 1983.Google Scholar
9. . Theories for Admissible Sets: A Unifying Approach to Proof Theory. Bibliopolis, Naples, 1986.
10. . Intuitionistic type theory. Bibliopolis, Naples, 1984.
11. . Proof Theory. An introduction, volume 1407 of Springer Lecture Notes in Mathematics. Springer, Berlin, Heidelberg, New York, 1989.
12. . How to develop proof–theoretic ordinal functions on the basis of admissible ordinals. Mathematical Logic Quarterly, 39(1):47–54, 1993.
13. and Proof–theoretic investigations on Kruskal's theorem. Annals of Pure and Applied Logic, 60:49–88, 1993.Google Scholar
14. . Kennzeichnung von Ordinalzahlen durch rekursiv definierte Funktionen. Math. Ann., 127:16–32, 1954.Google Scholar
15. . Proof theoretical strength of Martin-Löf Type Theory with W-type and one universe. PhD thesis, Universität München, 1993.
16. . An introduction to well-ordering proofs in Martin-L öf's type theory. In and , editors, Twenty-five years of constructive type theory, pages 245–263, Oxford, 1998. Clarendon Press.
17. proofs forMartin-Löf type theory. Annals of Pure andApplied Logic, 92:113–159, 1998.Google Scholar
18. . Ordinal systems. To appear in: , , editors, Sets and Proofs, Cambridge University Press, 1999.
- 3
- Cited by