A new model construction by making a detour via intuitionistic theories II: Interpretability lower bound of Feferman's explicit mathematics T 0

Annals of Pure and Applied Logic 166 (7-8):800-835 (2015)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2015.04.002

Links

PhilArchive



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

External links

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

Through your library

My notes

Similar books and articles

A new model construction by making a detour via intuitionistic theories I: Operational set theory without choice is Π 1 -equivalent to KP.Kentaro Sato & Rico Zumbrunnen - 2015 - Annals of Pure and Applied Logic 166 (2):121-186.
Realisability in weak systems of explicit mathematics.Daria Spescha & Thomas Strahm - 2011 - Mathematical Logic Quarterly 57 (6):551-565.
Realization of constructive set theory into explicit mathematics: a lower bound for impredicative Mahlo universe.Sergei Tupailo - 2003 - Annals of Pure and Applied Logic 120 (1-3):165-196.
Universes in explicit mathematics.Gerhard Jäger, Reinhard Kahle & Thomas Studer - 2001 - Annals of Pure and Applied Logic 109 (3):141-162.
Explicit mathematics with the monotone fixed point principle. II: Models.Michael Rathjen - 1999 - Journal of Symbolic Logic 64 (2):517-550.
Preservativity logic: An analogue of interpretability logic for constructive theories.Rosalie Iemhoff - 2003 - Mathematical Logic Quarterly 49 (3):230-249.
The complexity of the disjunction and existential properties in intuitionistic logic.Sam Buss & Grigori Mints - 1999 - Annals of Pure and Applied Logic 99 (1-3):93-104.
Review: Solomon Feferman, J. N. Crossley, A Language and Axioms for Explicit Mathematics; Solomon Feferman, Maurice Boffa, Dirk van Dalen, Kenneth McAloon, Constructive Theories of Functions and Classes. [REVIEW]G. R. Renardel de Lavalette & A. S. Troelstra - 1984 - Journal of Symbolic Logic 49 (1):308-311.
A lower bound for intuitionistic logic.Pavel Hrubeš - 2007 - Annals of Pure and Applied Logic 146 (1):72-90.
Understanding uniformity in Feferman's explicit mathematics.Thomas Glaß - 1995 - Annals of Pure and Applied Logic 75 (1-2):89-106.
The provably terminating operations of the subsystem of explicit mathematics.Dieter Probst - 2011 - Annals of Pure and Applied Logic 162 (11):934-947.
Extending the system T0 of explicit mathematics: the limit and Mahlo axioms.Gerhard Jäger & Thomas Studer - 2002 - Annals of Pure and Applied Logic 114 (1-3):79-101.
Realization of analysis into explicit mathematics.Sergei Tupailo - 2001 - Journal of Symbolic Logic 66 (4):1848-1864.
Transfer principles in nonstandard intuitionistic arithmetic.Jeremy Avigad & Jeffrey Helzner - 2002 - Archive for Mathematical Logic 41 (6):581-602.
Explicit mathematics with the monotone fixed point principle.Michael Rathjen - 1998 - Journal of Symbolic Logic 63 (2):509-542.

Analytics

Added to PP
2015-08-28

Downloads
30 (#534,634)

6 months
9 (#312,765)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Characterizations of ordinal analysis.James Walsh - 2023 - Annals of Pure and Applied Logic 174 (4):103230.

Add more citations

References found in this work

Subsystems of Second Order Arithmetic.Stephen G. Simpson - 1999 - Studia Logica 77 (1):129-129.

View all 37 references / Add more references