Martin R. M.. A note on nominalism and recursive functions

Journal of Symbolic Logic 15 (2):153-153 (1950)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2267014

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,150

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. M. Martin, A Note on Nominalism and Recursive Functions. [REVIEW]John Myhill - 1950 - Journal of Symbolic Logic 15 (2):153-153.
A note on nominalism and recursive functions.R. M. Martin - 1949 - Journal of Symbolic Logic 14 (1):27-31.
On Evolving of Recursive Functions using λ-abstraction and Higher-order Functions.Martin Dostál - 2005 - Logic Journal of the IGPL 13 (5):515-524.
Acceptable Numerations of Morphisms and Myhill‐Shepherdson Property.Akira Kanda - 1995 - Mathematical Logic Quarterly 41 (1):39-48.
Accessible recursive functions.Stanley S. Wainer - 1999 - Bulletin of Symbolic Logic 5 (3):367-388.
Computability of Real Numbers by Using a Given Class of Functions in the Set of the Natural Numbers.Dimiter Skordev - 2002 - Mathematical Logic Quarterly 48 (S1):91-106.
Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge: MIT Press.
Formal systems and recursive functions.John N. Crossley & Michael Dummett (eds.) - 1965 - Amsterdam,: North-Holland Pub. Co..
Minimal realizability of intuitionistic arithmetic and elementary analysis.Zlatan Damnjanovic - 1995 - Journal of Symbolic Logic 60 (4):1208-1241.
On a Theory for AC0 and the Strength of the Induction Scheme.Satoru Kuroda - 1998 - Mathematical Logic Quarterly 44 (3):417-426.
Some restrictions on simple fixed points of the integers.G. L. McColm - 1989 - Journal of Symbolic Logic 54 (4):1324-1345.
Unary primitive recursive functions.Daniel E. Severin - 2008 - Journal of Symbolic Logic 73 (4):1122-1138.
Comparing Computational Power.Udi Boker & Nachum Dershowitz - 2006 - Logic Journal of the IGPL 14 (5):633-647.
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.
Elementary descent recursion and proof theory.Harvey Friedman & Michael Sheard - 1995 - Annals of Pure and Applied Logic 71 (1):1-45.

Analytics

Added to PP
2016-06-30

Downloads
11 (#1,140,433)

6 months
1 (#1,475,085)

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