Logic-free Formalisations of Recursive Arithmetic

Journal of Symbolic Logic 24 (3):245-246 (1959)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2963833

Links

PhilArchive



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

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

Review: R. L. Goodstein, Logic-free Formalisations of Recursive Arithmetic. [REVIEW]Rózsa Péter - 1959 - Journal of Symbolic Logic 24 (3):245-246.
Recursive Number Theory. A Development of Recursive Arithmetic in a Logic-Free Equation Calculus.R. L. Goodstein - 1958 - Journal of Symbolic Logic 23 (2):227-228.
Review: R. L. Goodstein, Recursive Number Theory. A Development of Recursive Arithmetic in a Logic-Free Equation Calculus. [REVIEW]Th Skolem - 1958 - Journal of Symbolic Logic 23 (2):227-228.
Minimal realizability of intuitionistic arithmetic and elementary analysis.Zlatan Damnjanovic - 1995 - Journal of Symbolic Logic 60 (4):1208-1241.
On the Equivalence Between Logic‐Free and Logic‐Bearing Systems of Primitive Recursive Arithmetic.Daniel G. Schwartz - 1987 - Mathematical Logic Quarterly 33 (3):245-253.
Polynomially Bounded Recursive Realizability.Saeed Salehi - 2005 - Notre Dame Journal of Formal Logic 46 (4):407-417.
Recursive Models and the Divisibility Poset.James H. Schmerl - 1998 - Notre Dame Journal of Formal Logic 39 (1):140-148.
Predicative functionals and an interpretation of ⌢ID.Jeremy Avigad - 1998 - Annals of Pure and Applied Logic 92 (1):1-34.
Order‐free Recursion on the Real Numbers.Vasco Brattka - 1997 - Mathematical Logic Quarterly 43 (2):216-234.
On the Difficulty of Writing Out formal Proofs in Arithmetic.Ryo Kashima & Takeshi Yamaguchi - 1997 - Mathematical Logic Quarterly 43 (3):328-332.
On the limit existence principles in elementary arithmetic and Σ n 0 -consequences of theories.Lev D. Beklemishev & Albert Visser - 2005 - Annals of Pure and Applied Logic 136 (1-2):56-74.
A Decidable Fragment of Recursive Arithmetic.R. L. Goodstein - 1963 - Mathematical Logic Quarterly 9 (12‐15):199-201.
Weak theories of nonstandard arithmetic and analysis.Jeremy Avigad - manuscript
Review: H. A. Pogorzelski, Recursive Arithmetic of Skolem. [REVIEW]R. L. Goodstein - 1964 - Journal of Symbolic Logic 29 (2):101-102.
Models of Propositional Calculi in Recursive Arithmetic.R. L. Goodstein - 1963 - Journal of Symbolic Logic 28 (4):291-291.

Analytics

Added to PP
2015-02-05

Downloads
15 (#893,994)

6 months
2 (#1,157,335)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A note on omitting the replacement schema.A. Bundy - 1973 - Notre Dame Journal of Formal Logic 14 (1):118-120.

Add more citations

References found in this work

No references found.

Add more references