Mathematical Logic Quarterly 57 (6):551-565 (2011)

Abstract
This paper is a direct successor to 12. Its aim is to introduce a new realisability interpretation for weak systems of explicit mathematics and use it in order to analyze extensions of the theory PET in 12 by the so-called join axiom of explicit mathematics
Keywords applicative theories  MSC (2010) 03F03  types and names  03D15  realisability  Feferman's explicit mathematics  feasible operations  03F50  Proof theory
Categories (categorize this paper)
DOI 10.1002/malq.201020064
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 50,391
Through your library

References found in this work BETA

The Provably Terminating Operations of the Subsystem of Explicit Mathematics.Dieter Probst - 2011 - Annals of Pure and Applied Logic 162 (11):934-947.
Elementary Explicit Types and Polynomial Time Operations.Daria Spescha & Thomas Strahm - 2009 - Mathematical Logic Quarterly 55 (3):245-258.
Polytime, Combinatory Logic and Positive Safe Induction.Cantini Andrea - 2002 - Archive for Mathematical Logic 41 (2):169-189.

Add more references

Citations of this work BETA

Admissible Closures of Polynomial Time Computable Arithmetic.Dieter Probst & Thomas Strahm - 2011 - Archive for Mathematical Logic 50 (5-6):643-660.
A Feasible Theory of Truth Over Combinatory Algebra.Sebastian Eberhard - 2014 - Annals of Pure and Applied Logic 165 (5):1009-1033.

Add more citations

Similar books and articles

A Theory of Rules for Enumerated Classes of Functions.Andreas Schlüter - 1995 - Archive for Mathematical Logic 34 (1):47-63.
Polynomial Time Operations in Explicit Mathematics.Thomas Strahm - 1997 - Journal of Symbolic Logic 62 (2):575-594.
On Power Set in Explicit Mathematics.Thomas Glass - 1996 - Journal of Symbolic Logic 61 (2):468-489.
Uniform Inseparability in Explicit Mathematics.Andrea Cantini & Pierluigi Minari - 1999 - Journal of Symbolic Logic 64 (1):313-326.
Explicit Mathematics with the Monotone Fixed Point Principle.Michael Rathjen - 1998 - Journal of Symbolic Logic 63 (2):509-542.
Power Types in Explicit Mathematics?Gerhard Jäger - 1997 - Journal of Symbolic Logic 62 (4):1142-1146.
Relating Quine's NF to Feferman's EM.Andrea Cantini - 1999 - Studia Logica 62 (2):141-162.
Monotone Inductive Definitions in Explicit Mathematics.Michael Rathjen - 1996 - Journal of Symbolic Logic 61 (1):125-146.

Analytics

Added to PP index
2013-12-01

Total views
14 ( #644,056 of 2,326,144 )

Recent downloads (6 months)
2 ( #435,731 of 2,326,144 )

How can I increase my downloads?

Downloads

My notes