Journal of Symbolic Logic 56 (2):715-730 (1991)

Authors
Michael Rathjen
University of Leeds
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)
Categories (categorize this paper)
DOI 10.2307/2274713
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 50,556
Through your library

References found in this work BETA

Proof Theory.Gaisi Takeuti - 1990 - Studia Logica 49 (1):160-161.
Proof Theory and Logical Complexity.Helmut Pfeifer & Jean-Yves Girard - 1989 - Journal of Symbolic Logic 54 (4):1493.
Countable Algebra and Set Existence Axioms.Harvey M. Friedman - 1983 - Annals of Pure and Applied Logic 25 (2):141.

Add more references

Citations of this work BETA

Relative Truth Definability of Axiomatic Truth Theories.Kentaro Fujimoto - 2010 - Bulletin of Symbolic Logic 16 (3):305-344.
The Unfolding of Non-Finitist Arithmetic.Solomon Feferman & Thomas Strahm - 2000 - Annals of Pure and Applied Logic 104 (1-3):75-96.

View all 6 citations / Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total views
27 ( #359,863 of 2,326,771 )

Recent downloads (6 months)
1 ( #638,349 of 2,326,771 )

How can I increase my downloads?

Downloads

My notes