Theory of Recursive Functions and Effective Computability

Journal of Symbolic Logic 36 (1):141-146 (1971)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271523

Links

PhilArchive



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

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

Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge, Mass.: MIT Press.
Review: Hartley Rogers, Theory of Recursive Functions and Effective Computability. [REVIEW]C. E. M. Yates - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Review: Hartley Rogers, Theory of Recursive Functions and Effective Computability. [REVIEW]Clifford Spector - 1959 - Journal of Symbolic Logic 24 (1):70-70.
Rogers Hartley Jr., Theory of recursive functions and effective computability. Volume I. Mimeographed. Technology Store, Cambridge, Mass., 1957, pp. i–xiv, 1–15, 15a, 16–20, 20a, 21–121, 121–155. [REVIEW]Clifford Spector - 1959 - Journal of Symbolic Logic 24 (1):70-70.
Computability and recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
Reviews. Hartley Rogers Jr., Theory of recursive functions and effective computability. McGraw-Hill Book Company, New York, St. Louis, San Francisco, Toronto, London, and Sydney, 1967, xix + 482 pp. [REVIEW]C. E. M. Yates - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Computability Theory: An Introduction to Recursion Theory.Herbert B. Enderton - 2010 - Academic Press.
Effective Structures.Alexandra A. Soskova - 1997 - Mathematical Logic Quarterly 43 (2):235-250.
Computable Real‐Valued Functions on Recursive Open and Closed Subsets of Euclidean Space.Qing Zhou - 1996 - Mathematical Logic Quarterly 42 (1):379-409.
Remarks on the development of computability.Stewart Shapiro - 1983 - History and Philosophy of Logic 4 (1-2):203-220.
Computability and Logic.George Boolos, John Burgess, Richard P. & C. Jeffrey - 1980 - New York: Cambridge University Press. Edited by John P. Burgess & Richard C. Jeffrey.
Computability, an introduction to recursive function theory.Nigel Cutland - 1980 - New York: Cambridge University Press.
Uniformly reflexive structures: towards an abstract theory of computability.Eric Gerhardt Wagner - 1963 - [New York: [S.N.].
Order‐free Recursion on the Real Numbers.Vasco Brattka - 1997 - Mathematical Logic Quarterly 43 (2):216-234.
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.

Analytics

Added to PP
2017-02-21

Downloads
138 (#130,592)

6 months
44 (#88,300)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A revenge-immune solution to the semantic paradoxes.Hartry Field - 2003 - Journal of Philosophical Logic 32 (2):139-177.

View all 576 citations / Add more citations

References found in this work

No references found.

Add more references