Metarecursively enumerable sets and their metadegrees

Journal of Symbolic Logic 33 (3):389-411 (1968)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2270325

Other Versions

No versions found

Links

PhilArchive



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

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.
Metarecursively Enumerable Sets and Admissible Ordinals.Gerald E. Sacks & Graham C. Driscoll - 1969 - Journal of Symbolic Logic 34 (1):115-116.
$pi^1_1$ Sets, $omega$-Sets, and Metacompleteness.James C. Owings - 1969 - Journal of Symbolic Logic 34 (2):194-204.
Review: J. C. Shepherdson, Representability of Recursively Enumerable Sets in Formal Theories. [REVIEW]Robert A. DiPaola - 1969 - Journal of Symbolic Logic 34 (1):117-117.
Review: C. E. M. Yates, Recursively Enumerable Sets and Retracting Functions. [REVIEW]Hartley Rogers - 1967 - Journal of Symbolic Logic 32 (3):394-394.
Review: C. E. M. Yates, Three Theorems on the Degrees of Recursively Enumerable Sets. [REVIEW]Hartley Rogers - 1967 - Journal of Symbolic Logic 32 (3):394-395.
J. C. E. Dekker. Two notes on recursively enumerable sets. Proceedings of the American Mathematical Society, vol. 4 , pp. 495–501. [REVIEW]Martin Davis - 1955 - Journal of Symbolic Logic 20 (1):73-74.

Analytics

Added to PP
2009-01-28

Downloads
45 (#492,483)

6 months
13 (#257,195)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The α-finite injury method.G. E. Sacks & S. G. Simpson - 1972 - Annals of Mathematical Logic 4 (4):343-367.
Ordinal machines and admissible recursion theory.Peter Koepke & Benjamin Seyfferth - 2009 - Annals of Pure and Applied Logic 160 (3):310-318.
Some minimal pairs of alpha-recursively enumerable degrees.Manuel Lerman - 1972 - Annals of Mathematical Logic 4 (4):415.
The recursively enumerable alpha-degrees are dense.Richard A. Shore - 1976 - Annals of Mathematical Logic 9 (1/2):123.

View all 8 citations / Add more citations

References found in this work

No references found.

Add more references