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: 91,202

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

Analytics

Added to PP
2014-03-24

Downloads
6 (#1,383,956)

6 months
1 (#1,444,594)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Citations of this work

Ordinal diagrams for Π3-reflection.Toshiyasu Arai - 2000 - Journal of Symbolic Logic 65 (3):1375 - 1394.
Polynomial time operations in explicit mathematics.Thomas Strahm - 1997 - Journal of Symbolic Logic 62 (2):575-594.
Intuitionistic fixed point logic.Ulrich Berger & Hideki Tsuiki - 2021 - Annals of Pure and Applied Logic 172 (3):102903.

Add more citations

References found in this work

Subsystems of Second Order Arithmetic.Stephen G. Simpson - 1999 - Studia Logica 77 (1):129-129.
The strength of some Martin-Löf type theories.Edward Griffor & Michael Rathjen - 1994 - Archive for Mathematical Logic 33 (5):347-385.
A well-ordering proof for Feferman's theoryT 0.Gerhard Jäger - 1983 - Archive for Mathematical Logic 23 (1):65-77.
Understanding uniformity in Feferman's explicit mathematics.Thomas Glaß - 1995 - Annals of Pure and Applied Logic 75 (1-2):89-106.

View all 6 references / Add more references