A Free-variable Theory Of Primitive Recursive Arithmetic

Mathematical Logic Quarterly 33 (2):14-157 (1987)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,322

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

A Free‐Variable Theory of Primitive Recursive Arithmetic.Daniel G. Schwartz - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (2):147-157.
On a Theory for AC0 and the Strength of the Induction Scheme.Satoru Kuroda - 1998 - Mathematical Logic Quarterly 44 (3):417-426.
Provably total functions of Basic Arithemtic.Saeed Salehi - 2003 - Mathematical Logic Quarterly 49 (3):316.
On the Equivalence Between Logic-Free and Logic-Bearing Systems of Primitive Recursive Arithmetic.Daniel G. Schwartz - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (3):245-253.
Polynomially Bounded Recursive Realizability.Saeed Salehi - 2005 - Notre Dame Journal of Formal Logic 46 (4):407-417.
Predicative functionals and an interpretation of ⌢ID.Jeremy Avigad - 1998 - Annals of Pure and Applied Logic 92 (1):1-34.
Unary primitive recursive functions.Daniel E. Severin - 2008 - Journal of Symbolic Logic 73 (4):1122-1138.
Ramsey's Theorem for Pairs and Provably Recursive Functions.Alexander Kreuzer & Ulrich Kohlenbach - 2009 - Notre Dame Journal of Formal Logic 50 (4):427-444.
Wittgenstein and finitism.Mathieu Marion - 1995 - Synthese 105 (2):141 - 176.

Analytics

Added to PP
2017-02-21

Downloads
12 (#1,054,764)

6 months
8 (#352,434)

Historical graph of downloads
How can I increase my downloads?

References found in this work

No references found.

Add more references