On the proof-theoretic strength of monotone induction in explicit mathematics

Annals of Pure and Applied Logic 85 (1):1-46 (1997)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,674

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

Explicit mathematics with the monotone fixed point principle.Michael Rathjen - 1998 - Journal of Symbolic Logic 63 (2):509-542.
On power set in explicit mathematics.Thomas Glass - 1996 - Journal of Symbolic Logic 61 (2):468-489.
The strength of some Martin-Löf type theories.Edward Griffor & Michael Rathjen - 1994 - Archive for Mathematical Logic 33 (5):347-385.
The role of parameters in bar rule and bar induction.Michael Rathjen - 1991 - Journal of Symbolic Logic 56 (2):715-730.
A note on Bar Induction in Constructive Set Theory.Michael Rathjen - 2006 - Mathematical Logic Quarterly 52 (3):253-258.
Monotone inductive definitions in explicit mathematics.Michael Rathjen - 1996 - Journal of Symbolic Logic 61 (1):125-146.
On the strength of Ramsey's theorem without Σ1 -induction.Keita Yokoyama - 2013 - Mathematical Logic Quarterly 59 (1-2):108-111.
Variation on a theme of Schutte.D. Probst & G. Jager - 2004 - Mathematical Logic Quarterly 50 (3):258.

Analytics

Added to PP
2014-03-24

Downloads
6 (#1,476,755)

6 months
1 (#1,501,709)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Explicit mathematics: power types and overloading.Thomas Studer - 2005 - Annals of Pure and Applied Logic 134 (2-3):284-302.

Add more citations

References found in this work

No references found.

Add more references