- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Gödel numberings of partial recursive functions
Journal of Symbolic Logic 23 (3):331-341 (1958)
Abstract
This article has no associated abstract. (fix it)Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Gödel Numberings of Partial Recursive Functions.Hartley Rogers - 1964 - Journal of Symbolic Logic 29 (3):146-146.
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]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.
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
2009-01-28
Downloads
67 (#236,879)
6 months
24 (#148,306)
2009-01-28
Downloads
67 (#236,879)
6 months
24 (#148,306)
Historical graph of 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.
On the Necessity of U-Shaped Learning.Lorenzo Carlucci & John Case - 2013 - Topics in Cognitive Science 5 (1):56-88.
On computable numberings of families of Turing degrees.Marat Faizrahmanov - 2024 - Archive for Mathematical Logic 63 (5):609-622.
References found in this work
Creative sets.John Myhill - 1955 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 1 (2):97-108.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-6686886f5-kkm7k uwo