Metarecursively Enumerable Sets and Admissible Ordinals

&
Journal of Symbolic Logic 34 (1):115-116 (1969)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2270995

Other Versions

No versions found

Links

PhilArchive



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

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 their metadegrees.Graham C. Driscoll - 1968 - Journal of Symbolic Logic 33 (3):389-411.
$pi^1_1$ Sets, $omega$-Sets, and Metacompleteness.James C. Owings - 1969 - Journal of Symbolic Logic 34 (2):194-204.
Gerald E. Sacks. The recursively enumerable degrees are dense. Annals of mathematics, ser. 2 vol. 80 (1964), pp. 300–312. [REVIEW]Gerald E. Sacks - 1969 - Journal of Symbolic Logic 34 (2):294-295.
Gerald E. Sacks. The recursively enumerable degrees are dense. Annals of mathematics, ser. 2 vol. 80 (1964), pp. 300–312. [REVIEW]Robert W. Robinson - 1969 - Journal of Symbolic Logic 34 (2):294-295.
G. Kreisel and Gerald E. Sacks. Metarecursive sets. The journal of symbolic logic, vol. 30 , pp. 318–338.Richard A. Platek - 1968 - Journal of Symbolic Logic 33 (4):622-623.
The theory of the metarecursively enumerable degrees.Noam Greenberg, Richard A. Shore & Theodore A. Slaman - 2006 - Journal of Mathematical Logic 6 (1):49-68.
In memoriam: Gerald E. Sacks, 1933–2019.Manuel Lerman & Theodore A. Slaman - 2022 - Bulletin of Symbolic Logic 28 (1):150-155.
Review: Gerald E. Sacks, On the Degrees Less than 0'. [REVIEW]Marian Boykan Pour-El - 1964 - Journal of Symbolic Logic 29 (1):60-60.
Review: Gerald E. Sacks, A Maximal Set which is not Complete. [REVIEW]K. Appel - 1967 - Journal of Symbolic Logic 32 (4):528-528.

Analytics

Added to PP
2015-02-05

Downloads
8 (#1,589,825)

6 months
2 (#1,696,787)

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

No references found.

Add more references