Mathematically strong subsystems of analysis with low rate of growth of provably recursive functionals

Archive for Mathematical Logic 36 (1):31-71 (1996)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1007/s001530050055

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,990

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

Mathematically Strong Subsystems of Analysis with Low Rate of Growth of Provably Recursive Functionals.Ulrich Kohlenbach - 2001 - Bulletin of Symbolic Logic 7 (2):280-281.
Review: Ulrich Kohlenbach, Mathematically Strong Subsystems of Analysis with Low Rate of Growth of Provably Recursive Functionals. [REVIEW]Ulrich Berger - 2001 - Bulletin of Symbolic Logic 7 (2):280-281.
Spector Clifford. Provably recursive functionals of analysis: A consistency proof of analysis by an extension of principles formulated in current intuitionistic mathematics. Recursive function theory, Proceedings of symposia in pure mathematics, vol. 5, American Mathematical Society, Providence 1962, pp. 1–27. [REVIEW]R. E. Vesley - 1967 - Journal of Symbolic Logic 32 (1):128-128.
Review: Clifford Spector, Provably Recursive Functionals of Analysis: A Consistency Proof of Analysis by an Extension of Principles Formulated in Current Intuitionistic Mathematics. [REVIEW]R. E. Vesley - 1967 - Journal of Symbolic Logic 32 (1):128-128.
Non recursive functionals.Richard Bird - 1975 - Mathematical Logic Quarterly 21 (1):41-46.
On the proof theory of type two functionals based on primitive recursive operations.David Steiner & Thomas Strahm - 2006 - Mathematical Logic Quarterly 52 (3):237-252.
A uniform approach for characterizing the provably total number-theoretic functions of KPM and its subsystems.Benjamin Blankertz & Andreas Weiermann - 1999 - Studia Logica 62 (3):399-427.
Provably total functions of Basic Arithemtic.Saeed Salehi - 2003 - Mathematical Logic Quarterly 49 (3):316.
Finitary Treatment of Operator Controlled Derivations.Wilfried Buchholz - 2001 - Mathematical Logic Quarterly 47 (3):363-396.
R.E. degrees of continuous functionals.Dag Normann - 1983 - Archive for Mathematical Logic 23 (1):79-98.

Analytics

Added to PP
2013-11-23

Downloads
52 (#298,807)

6 months
9 (#436,631)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Bounded functional interpretation.Fernando Ferreira & Paulo Oliva - 2005 - Annals of Pure and Applied Logic 135 (1):73-112.
Saturated models of universal theories.Jeremy Avigad - 2002 - Annals of Pure and Applied Logic 118 (3):219-234.
Number theory and elementary arithmetic.Jeremy Avigad - 2003 - Philosophia Mathematica 11 (3):257-284.
Fragments of Heyting arithmetic.Wolfgang Burr - 2000 - Journal of Symbolic Logic 65 (3):1223-1240.
Nonstandardness and the bounded functional interpretation.Fernando Ferreira & Jaime Gaspar - 2015 - Annals of Pure and Applied Logic 166 (6):701-712.

View all 27 citations / Add more citations

References found in this work

Existence and feasibility in arithmetic.Rohit Parikh - 1971 - Journal of Symbolic Logic 36 (3):494-508.
Fragments of arithmetic.Wilfried Sieg - 1985 - Annals of Pure and Applied Logic 28 (1):33-71.

View all 15 references / Add more references