Hartley RogersJr., Gödel numberings of partial recursive functions. The journal of symbolic logic, vol. 23 no. 3 , pp. 331–341

Journal of Symbolic Logic 29 (3):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: 92,907

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: Hartley Rogers, Godel Numberings of Partial Recursive Functions. [REVIEW]Martin Davis - 1964 - Journal of Symbolic Logic 29 (3):146-146.
Gödel numberings of partial recursive functions.Hartley Rogers - 1958 - Journal of Symbolic Logic 23 (3):331-341.
Gödel Numberings of Partial Recursive Functions.Hartley Rogers - 1964 - Journal of Symbolic Logic 29 (3):146-146.
An invariance notion in recursion theory.Robert E. Byerly - 1982 - Journal of Symbolic Logic 47 (1):48-66.
Hartley RogersJr., On universal functions. Proceedings of the American Mathematical Society, vol. 16 , pp. 39–44.C. E. M. Yates - 1966 - Journal of Symbolic Logic 31 (3):513-513.
Review: Hartley Rogers, Recursive Functions over Well-Ordered Partial Orderings. [REVIEW]J. R. Shoenfield - 1962 - Journal of Symbolic Logic 27 (1):83-84.
A note on partial numberings.Serikzhan Badaev & Dieter Spreen - 2005 - Mathematical Logic Quarterly 51 (2):129-136.
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.
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 hereditary partial effective functionals and recursion theory in higher types.G. Longo & E. Moggi - 1984 - Journal of Symbolic Logic 49 (4):1319-1332.
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Strong reducibility of partial numberings.Dieter Spreen - 2005 - Archive for Mathematical Logic 44 (2):209-217.
Review: Hartley Rogers, Theory of Recursive Functions and Effective Computability. [REVIEW]C. E. M. Yates - 1971 - Journal of Symbolic Logic 36 (1):141-146.
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.
Louise Hay. On creative sets and indices of partial recursive functions. Transactions of the American Mathematical Society, vol. 120 no. 2 , pp. 359–367. - Louise Hay. Isomorphism types of index sets of partial recursive functions. Proceedings of the American Mathematical Society, vol. 17 , pp. 106–110. - Louise Hay. Index sets of finite classes of recursively enumerable sets. The journal of symbolic logic, vol. 34 , pp. 39–44. [REVIEW]Forbes D. Lewis - 1974 - Journal of Symbolic Logic 39 (1):186-187.

Analytics

Added to PP
2016-06-30

Downloads
9 (#1,276,707)

6 months
3 (#1,037,581)

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