On the intuitionistic strength of monotone inductive definitions

Journal of Symbolic Logic 69 (3):790-798 (2004)
  Copy   BIBTEX

Abstract

We prove here that the intuitionistic theory $T_{0}\upharpoonright + UMID_{N}$ , or even $EEJ\upharpoonright + UMID_{N}$ , of Explicit Mathematics has the strength of $\prod_{2}^{1} - CA_{0}$ . In Section I we give a double-negation translation for the classical second-order $\mu-calculus$ , which was shown in [ $M\ddot{o}02$ ] to have the strength of $\prod_{2}^{1}-CA_{0}$ . In Section 2 we interpret the intuitionistic $\mu-calculus$ in the theory $EETJ\upharpoonright + UMID_{N}$ . The question about the strength of monotone inductive definitions in $T_{0}$ was asked by S. Feferman in 1982, and - assuming classical logic - was addressed by M. Rathjen

Other Versions

No versions found

Links

PhilArchive



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

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

Monotone inductive definitions in explicit mathematics.Michael Rathjen - 1996 - Journal of Symbolic Logic 61 (1):125-146.
Monotone reducibility and the family of infinite sets.Douglas Cenzer - 1984 - Journal of Symbolic Logic 49 (3):774-782.
Every 2-random real is Kolmogorov random.Joseph S. Miller - 2004 - Journal of Symbolic Logic 69 (3):907-913.
Elementary embedding between countable Boolean algebras.Robert Bonnet & Matatyahu Rubin - 1991 - Journal of Symbolic Logic 56 (4):1212-1229.
Realization of analysis into explicit mathematics.Sergei Tupailo - 2001 - Journal of Symbolic Logic 66 (4):1848-1864.
Weak axioms of determinacy and subsystems of analysis II.Kazuyuki Tanaka - 1991 - Annals of Pure and Applied Logic 52 (1-2):181-193.

Analytics

Added to PP
2009-02-05

Downloads
49 (#443,886)

6 months
15 (#198,278)

Historical graph of downloads
How can I increase my downloads?