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

Other Versions

No versions found

Links

PhilArchive

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: MIT Press.
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.
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.
Enumerability, Decidability, Computability.J. M. P. - 1966 - Review of Metaphysics 19 (3):588-588.
Rogers Hartley Jr., Recursive functions over well-ordered partial orderings. Proceedings of the American Mathematical Society, vol. 10 , pp. 847–853.J. R. Shoenfield - 1962 - Journal of Symbolic Logic 27 (1):83-84.
Hartley RogersJr., Gödel numberings of partial recursive functions. The journal of symbolic logic, vol. 23 no. 3, pp. 331–341.Hartley Rogers - 1964 - Journal of Symbolic Logic 29 (3):146.
In memoriam: Hartley Rogers, jr. 1926–2015.Anil Nerode - 2016 - Bulletin of Symbolic Logic 22 (2):294-297.
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.
Recursive Function Theory and Logic.Ann Yasuhara - 1975 - Journal of Symbolic Logic 40 (4):619-620.
Rogers Hartley Jr., Computing degrees of unsolvability. Mathematische Annalen, vol. 138 . pp. 125–140.Rogers Hartley Jr., Computing degrees of unsolvability. Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, pp. 277–283. [REVIEW]Steven Orey - 1960 - Journal of Symbolic Logic 25 (4):363-364.

Analytics

Added to PP
2017-02-21

Downloads
265 (#158,335)

6 months
29 (#325,844)

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.
A theory of formal truth arithmetically equivalent to ID.Andrea Cantini - 1990 - Journal of Symbolic Logic 55 (1):244-259.

View all 571 citations / Add more citations

References found in this work

No references found.

Add more references