Switch to: Citations

Add references

You must login to add references.
  1. Wellfoundedness proofs by means of non-monotonic inductive definitions II: first order operators.Toshiyasu Arai - 2010 - Annals of Pure and Applied Logic 162 (2):107-143.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Ordinal diagrams for recursively Mahlo universes.Toshiyasu Arai - 2000 - Archive for Mathematical Logic 39 (5):353-391.
    In this paper we introduce a recursive notation system $O(\mu)$ of ordinals. An element of the notation system is called an ordinal diagram following G. Takeuti [25]. The system is designed for proof theoretic study of theories of recursively Mahlo universes. We show that for each $\alpha<\Omega$ in $O(\mu)$ KPM proves that the initial segment of $O(\mu)$ determined by $\alpha$ is a well ordering. Proof theoretic study for such theories will be reported in [9].
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • An ordinal analysis of stability.Michael Rathjen - 2005 - Archive for Mathematical Logic 44 (1):1-62.
    Abstract.This paper is the first in a series of three which culminates in an ordinal analysis of Π12-comprehension. On the set-theoretic side Π12-comprehension corresponds to Kripke-Platek set theory, KP, plus Σ1-separation. The strength of the latter theory is encapsulated in the fact that it proves the existence of ordinals π such that, for all β>π, π is β-stable, i.e. Lπ is a Σ1-elementary substructure of Lβ. The objective of this paper is to give an ordinal analysis of a scenario of (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Provably Recursive Functions of Reflection.Wolfram Pohlers & Jan–Carl Stegert - 2012 - In Ulrich Berger, Hannes Diener, Peter Schuster & Monika Seisenberger (eds.), Logic, Construction, Computation. De Gruyter. pp. 381-474.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Proof theory of reflection.Michael Rathjen - 1994 - Annals of Pure and Applied Logic 68 (2):181-224.
    The paper contains proof-theoretic investigation on extensions of Kripke-Platek set theory, KP, which accommodate first-order reflection. Ordinal analyses for such theories are obtained by devising cut elimination procedures for infinitary calculi of ramified set theory with Пn reflection rules. This leads to consistency proofs for the theories KP+Пn reflection using a small amount of arithmetic and the well-foundedness of a certain ordinal system with respect to primitive decending sequences. Regarding future work, we intend to avail ourselves of these new cut (...)
    Download  
     
    Export citation  
     
    Bookmark   37 citations