Mathematically Strong Subsystems of Analysis with Low Rate of Growth of Provably Recursive Functionals

Bulletin of Symbolic Logic 7 (2):280-281 (2001)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2687782

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

My notes

Similar books and articles

Mathematically strong subsystems of analysis with low rate of growth of provably recursive functionals.Ulrich Kohlenbach - 1996 - Archive for Mathematical Logic 36 (1):31-71.
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.
Discontinuities of provably correct operators on the provably recursive real numbers.William J. Collins & Paul Young - 1983 - Journal of Symbolic Logic 48 (4):913-920.
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.
Recursive functionals.Luis E. Sanchis - 1992 - New York: North-Holland.
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.
Finitary Treatment of Operator Controlled Derivations.Wilfried Buchholz - 2001 - Mathematical Logic Quarterly 47 (3):363-396.
Ramsey's Theorem for Pairs and Provably Recursive Functions.Alexander Kreuzer & Ulrich Kohlenbach - 2009 - Notre Dame Journal of Formal Logic 50 (4):427-444.
Minimal realizability of intuitionistic arithmetic and elementary analysis.Zlatan Damnjanovic - 1995 - Journal of Symbolic Logic 60 (4):1208-1241.
A lift of a theorem of Friedberg: A Banach-Mazur functional that coincides with no α-recursive functional on the class of α-recursive functions.Robert A. di Paola - 1981 - Journal of Symbolic Logic 46 (2):216-232.
Decidable Formulas Of Intuitionistic Primitive Recursive Arithmetic.Saeed Salehi - 2002 - Reports on Mathematical Logic 36 (1):55-61.
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.
On the arithmetical content of restricted forms of comprehension, choice and general uniform boundedness.Ulrich Kohlenbach - 1998 - Annals of Pure and Applied Logic 95 (1-3):257-285.
Provably total functions of Basic Arithemtic.Saeed Salehi - 2003 - Mathematical Logic Quarterly 49 (3):316.

Analytics

Added to PP
2017-02-22

Downloads
8 (#1,249,165)

6 months
3 (#902,269)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Number theory and elementary arithmetic.Jeremy Avigad - 2003 - Philosophia Mathematica 11 (3):257-284.

Add more citations

References found in this work

No references found.

Add more references