Recursion, metarecursion, and inclusion

Journal of Symbolic Logic 32 (2):173-179 (1967)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271654

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,225

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

Gerald E. Sacks. Metarecursively enumerable sets and admissible ordinals. Bulletin of the American Mathematical Society, vol. 72 , pp. 59–64. - Gerald E. Sacks. Post's problem, admissible ordinals, and regularity. Transactions of the American Mathematical Society, vol. 124 , pp. 1–23. - Gerald E. Sacks. Metarecursion theory. Sets, models and recursion theory, Proceedings of the Summer School in Mathematical Logic and Tenth Logic Colloquium, Leicester, August-September 1965, edited by John N. Crossley, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam, and Humanities Press, New York, 1967, pp. 243–263. - Graham C. DriscollJr., Metarecursively enumerable sets and their metadegrees. The Journal of symbolic logic, vol. 33 , pp. 389–11. [REVIEW]Richard A. Platek - 1969 - Journal of Symbolic Logic 34 (1):115-116.
On generalized computational complexity.Barry E. Jacobs - 1977 - Journal of Symbolic Logic 42 (1):47-58.
Recursion and Double Recursion.Raphael M. Robinson - 1949 - Journal of Symbolic Logic 14 (3):191-192.
First-Order Dynamic Logic.David Harel - 1982 - Journal of Symbolic Logic 47 (2):453-454.
C. T. Chong. Techniques of admissible recursion theory. Lecture notes in mathematics, vol. 1106. Springer-Verlag, Berlin, Heidelberg, New York, and Tokyo, 1984, ix + 214 pp. [REVIEW]Anne Leggett - 1987 - Journal of Symbolic Logic 52 (1):285-287.
Nested Recursion.W. W. Tait - 1963 - Journal of Symbolic Logic 28 (1):103-104.
Models for recursion theory.Johan Moldestad & Dag Normann - 1976 - Journal of Symbolic Logic 41 (4):719-729.
The formal language of recursion.Yiannis N. Moschovakis - 1989 - Journal of Symbolic Logic 54 (4):1216-1252.

Analytics

Added to PP
2009-01-28

Downloads
31 (#726,424)

6 months
15 (#204,260)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Splitting theorems in recursion theory.Rod Downey & Michael Stob - 1993 - Annals of Pure and Applied Logic 65 (1):1-106.
A Dichotomy of the Recursively Enumerable Sets.Robert W. Robinson - 1968 - Mathematical Logic Quarterly 14 (21-24):339-356.
Hyperhypersimple α-r.e. sets.C. T. Chong & M. Lerman - 1976 - Annals of Mathematical Logic 9 (1-2):1-48.
Some orbits for E.Peter Cholak, Rod Downey & Eberhard Herrmann - 2001 - Annals of Pure and Applied Logic 107 (1-3):193-226.

View all 7 citations / Add more citations

References found in this work

No references found.

Add more references