Review: R. L. Goodstein, Logic-free Formalisations of Recursive Arithmetic [Book Review]

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

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

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 Decidable Fragment of Recursive Arithmetic.R. L. Goodstein - 1963 - Mathematical Logic Quarterly 9 (12‐15):199-201.
A Decidable Class of Equations in Recursive Arithmetic.R. L. Goodstein & R. D. Lee - 1966 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 12 (1):235-239.
Polynomially Bounded Recursive Realizability.Saeed Salehi - 2005 - Notre Dame Journal of Formal Logic 46 (4):407-417.
Review: R. L. Goodstein, Recursive Analysis. [REVIEW]James R. Guard - 1962 - Journal of Symbolic Logic 27 (2):244-245.

Analytics

Added to PP
2013-11-22

Downloads
1 (#1,898,028)

6 months
1 (#1,470,413)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references