Journal of Symbolic Logic 56 (2):715-730 (1991)
|Abstract||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|
|Keywords||No keywords specified (fix it)|
|Through your library||Configure|
Similar books and articles
Jeffry L. Hirst (1999). Ordinal Inequalities, Transfinite Induction, and Reverse Mathematics. Journal of Symbolic Logic 64 (2):769-774.
Klaus Mainzer (1977). Is the Intuitionistic Bar-Induction a Constructive Principle? Notre Dame Journal of Formal Logic 18 (4):583-588.
Osamu Takaki (1997). Strong Normalization Theorem for a Constructive Arithmetic with Definition by Transfinite Recursion and Bar Induction. Notre Dame Journal of Formal Logic 38 (3):350-373.
Harvey Friedman (1969). Bar Induction and Π11-CA. Journal of Symbolic Logic 34 (3):353 - 362.
Dorit Bar-On (2010). Précis of Dorit Bar-On's Speaking My Mind: Expression and Self-Knowledge. Acta Analytica 25 (1):1-7.
William T. Gallagher, Ideologies of Professionalism and the Politics of Self-Regulation in the California State Bar.
Matthew Boyle (2010). Bar-on on Self-Knowledge and Expression. Acta Analytica 25 (1):9-20.
Richard Kaye (1991). Model-Theoretic Properties Characterizing Peano Arithmetic. Journal of Symbolic Logic 56 (3):949-963.
W. A. Howard & G. Kreisel (1966). Transfinite Induction and Bar Induction of Types Zero and One, and the Role of Continuity in Intuitionistic Analysis. Journal of Symbolic Logic 31 (3):325-358.
Jerome Malitz (1983). Downward Transfer of Satisfiability for Sentences of L1,. Journal of Symbolic Logic 48 (4):1146 - 1150.
Added to index2009-01-28
Total downloads5 ( #160,283 of 549,068 )
Recent downloads (6 months)0
How can I increase my downloads?