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

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,888

External links

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

Through your library

Analytics

Added to PP
2013-11-23

Downloads
57 (#376,360)

6 months
6 (#856,140)

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