Switch to: Citations

Add references

You must login to add references.
  1. The fine structure of the constructible hierarchy.R. Björn Jensen - 1972 - Annals of Mathematical Logic 4 (3):229.
    Download  
     
    Export citation  
     
    Bookmark   270 citations  
  • Quick cut-elimination for strictly positive cuts.Toshiyasu Arai - 2011 - Annals of Pure and Applied Logic 162 (10):807-815.
    In this paper we show that the intuitionistic theory for finitely many iterations of strictly positive operators is a conservative extension of Heyting arithmetic. The proof is inspired by the quick cut-elimination due to G. Mints. This technique is also applied to fragments of Heyting arithmetic.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • 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  
  • On splitting stationary subsets of large cardinals.James E. Baumgartner, Alan D. Taylor & Stanley Wagon - 1977 - Journal of Symbolic Logic 42 (2):203-214.
    Let κ denote a regular uncountable cardinal and NS the normal ideal of nonstationary subsets of κ. Our results concern the well-known open question whether NS fails to be κ + -saturated, i.e., are there κ + stationary subsets of κ with pairwise intersections nonstationary? Our first observation is: Theorem. NS is κ + -saturated iff for every normal ideal J on κ there is a stationary set $A \subseteq \kappa$ such that $J = NS \mid A = \{X \subseteq (...)
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • (4 other versions)Epsilon Substitution Method for [image] -FIX.Toshiyasu Arai - 2006 - Journal of Symbolic Logic 71 (4):1155 - 1188.
    In this paper we formulate epsilon substitution method for a theory $\Pi _{2}^{0}$-FIX for non-monotonic $\Pi _{2}^{0}$ inductive definitions. Then we give a termination proof of the H-processes based on Ackermann [1].
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Wellfoundedness proofs by means of non-monotonic inductive definitions I: Π₂⁰-operators.Toshiyasu Arai - 2004 - Journal of Symbolic Logic 69 (3):830-850.
    In this paper, we prove the wellfoundedness of recursive notation systems for reflecting ordinals up to Π₃-reflection by relevant inductive definitions.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • (1 other version)Proof theory for theories of ordinals II: Π3-reflection.Toshiyasu Arai - 2004 - Annals of Pure and Applied Logic 129 (1-3):39-92.
    This paper deals with a proof theory for a theory T3 of Π3-reflecting ordinals using the system O of ordinal diagrams in Arai 1375). This is a sequel to the previous one 1) in which a theory for recursively Mahlo ordinals is analyzed proof-theoretically.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Ordinal diagrams for Π3-reflection.Toshiyasu Arai - 2000 - Journal of Symbolic Logic 65 (3):1375 - 1394.
    In this paper we introduce a recursive notation system O(Π 3 ) of ordinals. An element of the notation system is called an ordinal diagram. The system is designed for proof theoretic study of theories of Π 3 -reflection. We show that for each $\alpha in O(Π 3 ) a set theory KP Π 3 for Π 3 -reflection proves that the initial segment of O(Π 3 ) determined by α is a well ordering. Proof theoretic study for such theories (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations