Gödel Numberings of Partial Recursive Functions

Journal of Symbolic Logic 29 (3):146-146 (1964)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271638

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,127

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

Gödel numberings of partial recursive functions.Hartley Rogers - 1958 - Journal of Symbolic Logic 23 (3):331-341.
Review: Hartley Rogers, Godel Numberings of Partial Recursive Functions. [REVIEW]Martin Davis - 1964 - Journal of Symbolic Logic 29 (3):146-146.
Hartley RogersJr., Gödel numberings of partial recursive functions. The journal of symbolic logic, vol. 23 no. 3 , pp. 331–341.Martin Davis - 1964 - Journal of Symbolic Logic 29 (3):146.
Review: Hartley Rogers, Recursive Functions over Well-Ordered Partial Orderings. [REVIEW]J. R. Shoenfield - 1962 - Journal of Symbolic Logic 27 (1):83-84.
Rogers Hartley Jr., Recursive functions over well-ordered partial orderings. Proceedings of the American Mathematical Society, vol. 10 , pp. 847–853. [REVIEW]J. R. Shoenfield - 1962 - Journal of Symbolic Logic 27 (1):83-84.
Review: Hartley Rogers, Theory of Recursive Functions and Effective Computability. [REVIEW]Clifford Spector - 1959 - Journal of Symbolic Logic 24 (1):70-70.
Review: Hartley Rogers, Theory of Recursive Functions and Effective Computability. [REVIEW]C. E. M. Yates - 1971 - Journal of Symbolic Logic 36 (1):141-146.
The Independence of Control Structures in Programmable Numberings of the Partial Recursive Functions.Gregory A. Riccardi - 1982 - Mathematical Logic Quarterly 28 (20-21):285-296.
The Independence of Control Structures in Programmable Numberings of the Partial Recursive Functions.Gregory A. Riccardi - 1982 - Mathematical Logic Quarterly 28 (20‐21):285-296.
Review: Hartley Rogers, On Universal Functions. [REVIEW]C. E. M. Yates - 1966 - Journal of Symbolic Logic 31 (3):513-513.

Analytics

Added to PP
2017-02-21

Downloads
3 (#1,729,579)

6 months
3 (#1,046,015)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Universal Prediction: A Philosophical Investigation.Tom F. Sterkenburg - 2018 - Dissertation, University of Groningen
On interpreting Chaitin's incompleteness theorem.Panu Raatikainen - 1998 - Journal of Philosophical Logic 27 (6):569-586.

Add more citations

References found in this work

No references found.

Add more references