Some Reflections on the Foundations of Ordinary Recursion Theory and a New Proposal

Mathematical Logic Quarterly 32 (31-34):503-515 (1986)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19860323103

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,440

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

Minimal weak truth table degrees and computably enumerable Turing degrees.R. G. Downey - 2020 - Providence, RI: American Mathematical Society. Edited by Keng Meng Ng & Reed Solomon.
Some remarks on a theorem of Iraj Kalantari concerning convexity and recursion theory.R. Downey - 1984 - Mathematical Logic Quarterly 30 (19‐24):295-302.
Some Remarks on a Theorem of Iraj Kalantari Concerning Convexity and Recursion Theory.R. Downey - 1984 - Mathematical Logic Quarterly 30 (19-24):295-302.
Transfinite Recursion in a Theory of Properties.Stephen Pollard - 1986 - Mathematical Logic Quarterly 32 (19‐24):307-314.
A Limit for Higher Recursion Theory.H. Luckhardt - 1979 - Mathematical Logic Quarterly 25 (30):475-479.
Some consequences of ad for Kleene recursion in 3e.Edward R. Griffor - 1983 - Mathematical Logic Quarterly 29 (10):485-492.
Minimal Degrees in Generalized Recursion Theory.Michael Machtey - 1974 - Mathematical Logic Quarterly 20 (8-12):133-148.
A beginner's further guide to mathematical logic.Raymond M. Smullyan - 2017 - New Jersey: World Scientific.
Some remarks about the connections between Combinatory Logic and axiomatic recursion theory.Roger Hindley & Gerd Mitschke - 1977 - Archive for Mathematical Logic 18 (1):99-103.

Analytics

Added to PP
2014-01-16

Downloads
30 (#743,273)

6 months
2 (#1,685,623)

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

Computability & unsolvability.Martin Davis - 1958 - New York: Dover Publications.
Recursion-theoretic hierarchies.Peter G. Hinman - 1978 - New York: Springer Verlag.
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.

View all 7 references / Add more references