A note on the theory of positive induction, $${{\rm ID}^*_1}$$

Archive for Mathematical Logic 49 (2):275-281 (2010)
  Copy   BIBTEX

Abstract

The article shows a simple way of calibrating the strength of the theory of positive induction, ${{\rm ID}^{*}_{1}}$ . Crucially the proof exploits the equivalence of ${\Sigma^{1}_{1}}$ dependent choice and ω-model reflection for ${\Pi^{1}_{2}}$ formulae over ACA 0. Unbeknown to the authors, D. Probst had already determined the proof-theoretic strength of ${{\rm ID}^{*}_{1}}$ in Probst, J Symb Log, 71, 721–746, 2006

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,438

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

A note on Bar Induction in Constructive Set Theory.Michael Rathjen - 2006 - Mathematical Logic Quarterly 52 (3):253-258.
Variation on a theme of Schutte.D. Probst & G. Jager - 2004 - Mathematical Logic Quarterly 50 (3):258.
The role of parameters in bar rule and bar induction.Michael Rathjen - 1991 - Journal of Symbolic Logic 56 (2):715-730.
Enumerative Induction and Lawlikeness.Wolfgang Spohn - 2005 - Philosophy of Science 72 (1):164-187.
Necessary use of [image] induction in a reversal.Itay Neeman - 2011 - Journal of Symbolic Logic 76 (2):561 - 574.
The strength of some Martin-Löf type theories.Edward Griffor & Michael Rathjen - 1994 - Archive for Mathematical Logic 33 (5):347-385.
Hume's Positive Argument on Induction.Hsueh Qu - 2013 - Noûs 48 (4):595-625.

Analytics

Added to PP
2013-11-23

Downloads
36 (#435,476)

6 months
11 (#226,317)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Michael Rathjen
University of Leeds

Citations of this work

Open questions in reverse mathematics.Antonio Montalbán - 2011 - Bulletin of Symbolic Logic 17 (3):431-454.
A proof-theoretic account of classical principles of truth.Graham E. Leigh - 2013 - Annals of Pure and Applied Logic 164 (10):1009-1024.
A flexible type system for the small Veblen ordinal.Florian Ranzi & Thomas Strahm - 2019 - Archive for Mathematical Logic 58 (5-6):711-751.

View all 6 citations / Add more citations