The upper semilattice of degrees ≤ 0' is complemented

Journal of Symbolic Logic 46 (4):705 - 713 (1981)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2273220

Other Versions

No versions found

Links

PhilArchive



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

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

Non‐Complementedness and Non‐Distributivity of Kleene Degrees.Hisato Muraki - 1997 - Mathematical Logic Quarterly 43 (3):378-388.
Carl G. JockuschJr., and David B. Posner. Double jumps of minimal degrees. The journal of symbolic logic, vol. 43 no. 4 , pp. 715–724. - Carl G. JockuschJr., and David B. Posner. Automorphism bases for degrees of unsotvability. Israel journal of mathematics, vol. 40 , pp. 150–164. - Richard L. Epstein. Initial segments of degrees below 0′. Memoirs of the American Mathematical Society, no. 241. American Mathematical Society, Providence1981, vi + 102 pp. - Richard A. Shore. The theory of the degrees below 0′. The journal of the London Mathematical Society, ser. 2 vol. 24 , pp. 1–14.M. Lerman - 1985 - Journal of Symbolic Logic 50 (2):550-552.
On the $\Sigma_2$-Theory of the Upper Semilattice of Turing Degrees.Carl G. Jockusch & Theodore A. Slaman - 1993 - Journal of Symbolic Logic 58 (1):193-204.
Embedding jump upper semilattices into the Turing degrees.Antonio Montalbán - 2003 - Journal of Symbolic Logic 68 (3):989-1014.
Definability of the jump operator in the enumeration degrees.I. Sh Kalimullin - 2003 - Journal of Mathematical Logic 3 (02):257-267.
Non-Distributive Upper Semilattice of Kleene Degrees.Hisato Muraki - 1999 - Journal of Symbolic Logic 64 (1):147-158.
Complementation in the Turing degrees.Theodore A. Slaman & John R. Steel - 1989 - Journal of Symbolic Logic 54 (1):160-176.
Degrees joining to 0'. [REVIEW]David B. Posner & Robert W. Robinson - 1981 - Journal of Symbolic Logic 46 (4):714 - 722.
C-Quasi-Minimal enumeration degrees below c'.Boris Solon - 2006 - Archive for Mathematical Logic 45 (4):505-517.
The theory of the recursively enumerable weak truth-table degrees is undecidable.Klaus Ambos-Spies, André Nies & Richard A. Shore - 1992 - Journal of Symbolic Logic 57 (3):864-874.

Analytics

Added to PP
2009-01-28

Downloads
60 (#357,289)

6 months
8 (#597,840)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Generic degrees are complemented.Masahiro Kumabe - 1993 - Annals of Pure and Applied Logic 59 (3):257-272.
Complementing below recursively enumerable degrees.S. Barry Cooper & Richard L. Epstein - 1987 - Annals of Pure and Applied Logic 34 (1):15-32.
Quasi-complements of the cappable degrees.Guohua Wu - 2004 - Mathematical Logic Quarterly 50 (2):189.
The minimal complementation property above 0′.Andrew E. M. Lewis - 2005 - Mathematical Logic Quarterly 51 (5):470-492.

View all 7 citations / Add more citations

References found in this work

The Degrees of Hyperimmune Sets.Webb Miller & D. A. Martin - 1968 - Mathematical Logic Quarterly 14 (7-12):159-166.

Add more references