Switch to: References

Add citations

You must login to add citations.
  1. Wellordering proofs for metapredicative Mahlo.Thomas Strahm - 2002 - Journal of Symbolic Logic 67 (1):260-278.
    In this article we provide wellordering proofs for metapredicative systems of explicit mathematics and admissible set theory featuring suitable axioms about the Mahloness of the underlying universe of discourse. In particular, it is shown that in the corresponding theories EMA of explicit mathematics and KPm 0 of admissible set theory, transfinite induction along initial segments of the ordinal φω00, for φ being a ternary Veblen function, is derivable. This reveals that the upper bounds given for these two systems in the (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Transfinite dependent choice and $ømega$-model reflection.Christian Rüede - 2002 - Journal of Symbolic Logic 67 (3):1153-1168.
    In this paper we present some metapredicative subsystems of analysis. We deal with reflection principles, $\omega-model$ existence axioms (limit axioms) and axioms asserting the existence of hierarchies. We show several equivalences among the introduced subsystems. In particular we prove the equivalence of $\sum_1^1$ transfinite dependent choice and $\prod_2^1$ reflection on $\omega-models$ of $\sum_1^1-DC$.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • (1 other version)The proof-theoretic analysis of Σ11 transfinite dependent choice.Christian Rüede - 2003 - Annals of Pure and Applied Logic 122 (1-3):195-234.
    This article provides an ordinal analysis of Σ11 transfinite dependent choice.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Upper Bounds for metapredicative mahlo in explicit mathematics and admissible set theory.Gerhard Jager & Thomas Strahm - 2001 - Journal of Symbolic Logic 66 (2):935-958.
    In this article we introduce systems for metapredicative Mahlo in explicit mathematics and admissible set theory. The exact upper proof-theoretic bounds of these systems are established.
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • (1 other version)The proof-theoretic analysis of Σ< sub> 1< sup> 1 transfinite dependent choice.Christian Rüede - 2003 - Annals of Pure and Applied Logic 122 (1):195-234.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Intuitionistic Fixed Point Theories for Strictly Positive Operators.Christian Rüede & Thomas Strahm - 2002 - Mathematical Logic Quarterly 48 (2):195-202.
    In this paper it is shown that the intuitionistic .xed point theory equation image for α times iterated fixed points of strictly positive operator forms is conservative for negative arithmetic and equation image sentences over the theory equation image for α times iterated arithmetic comprehension without set parameters.This generalizes results previously due to Buchholz [5] and Arai [2].
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Full and hat inductive definitions are equivalent in NBG.Kentaro Sato - 2015 - Archive for Mathematical Logic 54 (1-2):75-112.
    A new research project has, quite recently, been launched to clarify how different, from systems in second order number theory extending ACA0, those in second order set theory extending NBG are. In this article, we establish the equivalence between Δ01-LFP\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Delta^1_0\mbox{\bf-LFP}}$$\end{document} and Δ01-FP\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Delta^1_0\mbox{\bf-FP}}$$\end{document}, which assert the existence of a least and of a fixed point, respectively, for positive elementary operators. Our proof also shows (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Forcing for hat inductive definitions in arithmetic.Kentaro Sato - 2014 - Mathematical Logic Quarterly 60 (4-5):314-318.
    By forcing, we give a direct interpretation of into Avigad's. To the best of the author's knowledge, this is one of the simplest applications of forcing to “real problems”.
    Download  
     
    Export citation  
     
    Bookmark   2 citations