Gerald E. Sacks. A minimal degree less than O'. Bulletin of the American Mathematical Society, vol. 67 (1961), pp. 416–419 [Book Review]

Journal of Symbolic Logic 34 (2):295-295 (1969)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271111

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

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.
Arithmetical Sacks Forcing.Rod Downey & Liang Yu - 2006 - Archive for Mathematical Logic 45 (6):715-720.
Review: Gerald E. Sacks, A Minimal Degree less than O'. [REVIEW]Robert W. Robinson - 1969 - Journal of Symbolic Logic 34 (2):295-295.
Gerald E. Sacks. A minimal degree less than O'. Bulletin of the American Mathematical Society, vol. 67 (1961), pp. 416–419. [REVIEW]Gerald E. Sacks - 1969 - Journal of Symbolic Logic 34 (2):295-295.
The minimal complementation property above 0′.Andrew E. M. Lewis - 2005 - Mathematical Logic Quarterly 51 (5):470-492.
Sacks Gerald E.. Forcing with perfect closed sets. Axiomatic set theory, Proceedings of symposia in pure mathematics, vol. 13 part 1, American Mathematical Society, Providence, Rhode Island, 1971, pp. 331–355. [REVIEW]J. R. Shoenfield - 1974 - Journal of Symbolic Logic 39 (2):330-330.
A Hyperimmune Minimal Degree and an ANR 2-Minimal Degree.Mingzhong Cai - 2010 - Notre Dame Journal of Formal Logic 51 (4):443-455.
Shoenfield J. R.. On degrees of unsolvability. Annals of mathematics, second series, vol. 69 , pp. 644–653.Shoenfield J. R.. An uncountable set of incomparable degrees. Proceedings of the American Mathematical Society, vol. 11 , pp. 61–62. [REVIEW]Gerald E. Sacks - 1964 - Journal of Symbolic Logic 29 (4):203-204.
A minimal pair joining to a plus cupping Turing degree.Dengfeng Li & Angsheng Li - 2003 - Mathematical Logic Quarterly 49 (6):553-566.
Preface.Gerald E. Sacks - 1972 - Annals of Mathematical Logic 4 (4):341.
Oglesby Francis C.. An examination of a decision procedure. Memoirs of the American Mathematical Society, no. 44. American Mathematical Society, Providence 1962, 148 pp.Oglesby F. C.. Report: An examination of a decision procedure. Bulletin of the American Mathematical Society, vol. 67 , pp. 300–304. [REVIEW]Abraham Robinson - 1963 - Journal of Symbolic Logic 28 (2):165-166.
Properly Σ2 minimal degrees and 0″ complementation.S. Barry Cooper, Andrew E. M. Lewis & Yue Yang - 2005 - Mathematical Logic Quarterly 51 (3):274-276.
Properly Σ2 minimal degrees and 0″ complementation.S. Cooper, Andrew Lewis & Yue Yang - 2005 - Mathematical Logic Quarterly 51 (3):274-276.
Strong Minimal Covers for Recursively Enumerable Degrees.S. Barry Cooper - 1996 - Mathematical Logic Quarterly 42 (1):191-196.
On Suborderings of Degrees of Recursive Unsolvability.Gerald E. Sacks - 1961 - Mathematical Logic Quarterly 7 (1-5):46-56.

Analytics

Added to PP
2016-06-30

Downloads
12 (#1,058,801)

6 months
1 (#1,510,037)

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