S. C. Kleene. General recursive functions of natural numbers. Mathematische Annalen, Bd. 112 (1935–1936), S. 727–742

Journal of Symbolic Logic 2 (1):38-38 (1937)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2268801

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

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.
Review: S. C. Kleene, General Recursive Functions of Natural Numbers. [REVIEW]Rózsa Péter - 1937 - Journal of Symbolic Logic 2 (1):38-38.
Order‐free Recursion on the Real Numbers.Vasco Brattka - 1997 - Mathematical Logic Quarterly 43 (2):216-234.
Comparing Computational Power.Udi Boker & Nachum Dershowitz - 2006 - Logic Journal of the IGPL 14 (5):633-647.
Monoidal categories with natural numbers object.Robert Paré & Leopoldo Román - 1989 - Studia Logica 48 (3):361 - 376.
Sequential real number computation and recursive relations.J. Raymundo Marcial-Romero & M. Andrew Moshier - 2008 - Mathematical Logic Quarterly 54 (5):492-507.
Term rewriting theory for the primitive recursive functions.E. A. Cichon & Andreas Weiermann - 1997 - Annals of Pure and Applied Logic 83 (3):199-223.
Real numbers and functions in the Kleene hierarchy and limits of recursive, rational functions.N. Z. Shapiro - 1969 - Journal of Symbolic Logic 34 (2):207-214.
An invariance notion in recursion theory.Robert E. Byerly - 1982 - Journal of Symbolic Logic 47 (1):48-66.
Accessible recursive functions.Stanley S. Wainer - 1999 - Bulletin of Symbolic Logic 5 (3):367-388.
Finitism = PRA? On a Thesis of W.W. Tait.Matthias Schirn & Karl-Georg Niebergall - 2005 - Reports on Mathematical Logic:3-24.
A foundation for real recursive function theory.José Félix Costa, Bruno Loff & Jerzy Mycka - 2009 - Annals of Pure and Applied Logic 160 (3):255-288.
Elementary descent recursion and proof theory.Harvey Friedman & Michael Sheard - 1995 - Annals of Pure and Applied Logic 71 (1):1-45.
Realizing Brouwer's sequences.Richard E. Vesley - 1996 - Annals of Pure and Applied Logic 81 (1-3):25-74.
A non-splitting theorem for d.r.e. sets.Xiaoding Yi - 1996 - Annals of Pure and Applied Logic 82 (1):17-96.

Analytics

Added to PP
2015-02-05

Downloads
122 (#142,922)

6 months
20 (#119,793)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Computing machinery and intelligence.Alan M. Turing - 1950 - Mind 59 (October):433-60.
Alan Turing and the mathematical objection.Gualtiero Piccinini - 2003 - Minds and Machines 13 (1):23-48.
Two dogmas of computationalism.Oron Shagrir - 1997 - Minds and Machines 7 (3):321-44.
Effective Computation by Humans and Machines.Shagrir Oron - 2002 - Minds and Machines 12 (2):221-240.

View all 31 citations / Add more citations

References found in this work

No references found.

Add more references