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
Finitary Reductions for Local Predicativity, I: Recursively Regular Ordinals
Published online by Cambridge University Press: 31 March 2017
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. 465 - 499Publisher: Cambridge University PressPrint publication year: 2000
References
1. . Proof theory for theories of ordinals, I–III. Preprints, 1996–97
2. . Proof theory for theories of ordinals I: recursively Mahlo ordinals. Submitted, 1998
3. . Admissible sets and structures. Springer, 1975
5. . A new version of local predicativity. In: , , , eds., Proof Theory. Cambridge University Press, 1992
6. . Explaining the Gentzen-Takeuti reduction steps. Preprint, 1997
7. . Explaining Gentzen's consistency proof within infinitary proof theory. In: LNCS 1289:4–17, Springer, 1997
8. , , , . Iterated Inductive Definitions and Subsystems of Analysis. LNM 897, Springer, 1981
9. , . Proof Theory of Impredicative Subsystems of Analysis. Bibliopolis, 1988
10. . Neue Fassung desWiderspruchsfreiheitsbeweises für die reine Zahlentheorie. Forschungen zur Logik und zur Grunglegung der exacten Wissenschaften. Neue Folge 4: 19–44, 1938Google Scholar
11. . The consistency of the axiom of choice and the generalized continuumhypothesis with the axioms of set theory. Princenton, 1951
12. . Zur Beweistheorie der Kripke-Platek-Mengenlehre über den nat ürlichen Zahlen. Arch. math. Logik und Grundl., 22:121–139, 1982Google Scholar
13. . Pohlers. Eine beweistheoretische Untersuchung von Δ1/2 − CA + BI und verwandter Systeme. Sitz. Beyer. Akad. der Wissen., Math.-Natur.Klasse: 1–28, 1982Google Scholar
14. . Finite investigations of transfinite derivations. In: , Selected Papers in Proof Theory. Bibliopolis, 1992: 17–71. Russian original: 1975
15. . Normalization of finite terms and derivations via infinite ones. In: , Selected Papers in Proof Theory. Bibliopolis, 1992: 73–76. Original: abstract of the Congress on Logic, Methodology and Philosophy of Science, Bukarest 1975
16. . A new reduction sequence for arithmetic. In: , Selected Papers in Proof Theory. Bibliopolis, 1992: 77–96. Russian original: 1979
17. . Proof Theory. LNM 1407, Springer, 1989
19. . Proof theory of reflection. APAL, 68:181–224, 1994
20. , . Proof theoretic investigations on Kruskal's theorem. APAL, 60:49–88, 1993
21. . A formalization of the theory of ordinal numbers. JSL, 30:295–317, 1965
22. . Proof Theory, 2nd edition. North-Holland, 1987
23. . Finitary reductions for local predicativity. Ph.D. dissertation, Stanford University, 1998
24. . Finitary reductions for local predicativity, II: recursively Mahlo ordinals. In preparation.
25. . How is it that infinitary methods can be applied to finitary mathematics? Gödel's T: a case study. JSL, to appear