Hyperhypersimple supersets in admissible recursion theory

Journal of Symbolic Logic 48 (1):185-192 (1983)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2273333

Links

PhilArchive



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

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: C. T. Chong, Techniques of Admissible Recursion Theory. [REVIEW]Anne Leggett - 1987 - Journal of Symbolic Logic 52 (1):285-287.
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.
Techniques of Admissible Recursion Theory.Anne Leggett - 1987 - Journal of Symbolic Logic 52 (1):285-287.
On the orbits of hyperhypersimple sets.Wolfgang Maass - 1984 - Journal of Symbolic Logic 49 (1):51-62.
The role of true finiteness in the admissible recursively enumerable degrees.Noam Greenberg - 2005 - Bulletin of Symbolic Logic 11 (3):398-410.
Techniques of admissible recursion theory.C.-T. Chong - 1984 - New York: Springer Verlag.
On generalized computational complexity.Barry E. Jacobs - 1977 - Journal of Symbolic Logic 42 (1):47-58.
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.
Review: S. B. Cooper, T. A. Slaman, S. S. Wainer, Computability, Enumerability, Unsolvability, Directions in Recursion Theory. [REVIEW]C. T. Chong - 1999 - Journal of Symbolic Logic 64 (3):1362-1365.
Ordinal machines and admissible recursion theory.Peter Koepke & Benjamin Seyfferth - 2009 - Annals of Pure and Applied Logic 160 (3):310-318.

Analytics

Added to PP
2009-01-28

Downloads
1 (#1,913,683)

6 months
23 (#125,194)

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

Hyperhypersimple α-r.e. sets.C. T. Chong & M. Lerman - 1976 - Annals of Mathematical Logic 9 (1-2):1-48.
Some minimal pairs of alpha-recursively enumerable degrees.Manuel Lerman - 1972 - Annals of Mathematical Logic 4 (4):415.
Hyperhypersimple alpha-r.e. sets.C. T. Chong - 1976 - Annals of Mathematical Logic 9 (1/2):1.

Add more references