Switch to: Citations

Add references

You must login to add references.
  1. Systems of explicit mathematics with non-constructive μ-operator. Part II.Solomon Feferman & Gerhard Jäger - 1996 - Annals of Pure and Applied Logic 79 (1):37-52.
    This paper is mainly concerned with proof-theoretic analysis of some second-order systems of explicit mathematics with a non-constructive minimum operator. By introducing axioms for variable types we extend our first-order theory BON to the elementary explicit type theory EET and add several forms of induction as well as axioms for μ. The principal results then state: EET plus set induction is proof-theoretically equivalent to Peano arithmetic PA <0).
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • Fixed points in Peano arithmetic with ordinals.Gerhard Jäger - 1993 - Annals of Pure and Applied Logic 60 (2):119-132.
    Jäger, G., Fixed points in Peano arithmetic with ordinals, Annals of Pure and Applied Logic 60 119-132. This paper deals with some proof-theoretic aspects of fixed point theories over Peano arithmetic with ordinals. It studies three such theories which differ in the principles which are available for induction on the natural numbers and ordinals. The main result states that there is a natural theory in this framework which is a conservative extension of Peano arithmeti.
    Download  
     
    Export citation  
     
    Bookmark   21 citations  
  • Proof theory.K. Schütte - 1977 - New York: Springer Verlag.
    Download  
     
    Export citation  
     
    Bookmark   70 citations  
  • The role of parameters in bar rule and bar induction.Michael Rathjen - 1991 - Journal of Symbolic Logic 56 (2):715-730.
    For several subsystems of second order arithmetic T we show that the proof-theoretic strength of T + (bar rule) can be characterized in terms of T + (bar induction) □ , where the latter scheme arises from the scheme of bar induction by restricting it to well-orderings with no parameters. In addition, we demonstrate that ACA + 0 , ACA 0 + (bar rule) and ACA 0 + (bar induction) □ prove the same Π 1 1 -sentences.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Zur Beweistheorie Der Kripke-Platek-Mengenlehre Über Den Natürlichen Zahlen.Gerhard Jäger - 1980 - Archive for Mathematical Logic 22 (3-4):121-139.
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  • (1 other version)Beweistheorie vonKPN.Gerhard Jäger - 1980 - Archive for Mathematical Logic 20 (1-2):53-63.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • About the proof-theoretic ordinals of weak fixed point theories.Gerhard Jäger & Barbara Primo - 1992 - Journal of Symbolic Logic 57 (3):1108-1119.
    This paper presents several proof-theoretic results concerning weak fixed point theories over second order number theory with arithmetic comprehension and full or restricted induction on the natural numbers. It is also shown that there are natural second order theories which are proof-theoretically equivalent but have different proof-theoretic ordinals.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • (1 other version)Levels of implication and type free theories of classifications with approximation operator.Andrea Cantini - 1992 - Mathematical Logic Quarterly 38 (1):107-141.
    We investigate a theory of Frege structures extended by the Myhill-Flagg hierarchy of implications. We study its relation to a property theory with an approximation operator and we give a proof theoretical analysis of the basic system involved. MSC: 03F35, 03D60.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • (1 other version)Levels of implication and type free theories of classifications with approximation operator.Andrea Cantini - 1992 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 38 (1):107-141.
    Download  
     
    Export citation  
     
    Bookmark   4 citations