Complementing below recursively enumerable degrees

&
Annals of Pure and Applied Logic 34 (1):15-32 (1987)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(87)90039-x

Links

PhilArchive



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

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

The discontinuity of splitting in the recursively enumerable degrees.S. Barry Cooper & Xiaoding Yi - 1995 - Archive for Mathematical Logic 34 (4):247-256.
Complementation in the Turing degrees.Theodore A. Slaman & John R. Steel - 1989 - Journal of Symbolic Logic 54 (1):160-176.
The Isolated D. R. E. Degrees are Dense in the R. E. Degrees.Geoffrey Laforte - 1996 - Mathematical Logic Quarterly 42 (1):83-103.
ASH, CJ, Categoricity in hyperarithmetical degrees (1) BALDWIN, JT and HARRINGTON, L., Trivial pursuit: Re-marks on the main gap (3) COOPER, SB and EPSTEIN, RL, Complementing below re-cursively enumerable degrees (1). [REVIEW]Rl Epstein - 1987 - Annals of Pure and Applied Logic 34 (1):311.
ASH, CJ, Categoricity in hyperarithmetical degrees BALDWIN, JT and HARRINGTON, L., Trivial pursuit: Re-marks on the main gap COOPER, SB and EPSTEIN, RL, Complementing below re-cursively enumerable degrees.J. Steprans & S. Shelah - 1987 - Annals of Pure and Applied Logic 34:311.
The role of true finiteness in the admissible recursively enumerable degrees.Noam Greenberg - 2005 - Bulletin of Symbolic Logic 11 (3):398-410.
On recursive enumerability with finite repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.
Splittings of 0' into the Recursively Enumerable Degrees.Xiaoding Yi - 1996 - Mathematical Logic Quarterly 42 (1):249-269.
Strong Minimal Covers for Recursively Enumerable Degrees.S. Barry Cooper - 1996 - Mathematical Logic Quarterly 42 (1):191-196.
Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices.Klaus Ambos-Spies, Peter A. Fejer, Steffen Lempp & Manuel Lerman - 1996 - Journal of Symbolic Logic 61 (3):880-905.
Discontinuity of Cappings in the Recursively Enumerable Degrees and Strongly Nonbranching Degrees.Klaus Ambos-Spies & Ding Decheng - 1994 - Mathematical Logic Quarterly 40 (3):287-317.
Minimal Degrees and Recursively Inseparable Pairs of Recursively Enumerable Sets.Manuel Lerman - 1991 - Mathematical Logic Quarterly 37 (19‐22):331-342.

Analytics

Added to PP
2014-01-16

Downloads
9 (#1,214,023)

6 months
2 (#1,244,653)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Bounding minimal degrees by computably enumerable degrees.Angsheng Li & Dongping Yang - 1998 - Journal of Symbolic Logic 63 (4):1319-1347.
On a problem of Cooper and Epstein.Shamil Ishmukhametov - 2003 - Journal of Symbolic Logic 68 (1):52-64.

Add more citations

References found in this work

A theorem on minimal degrees.J. R. Shoenfield - 1966 - Journal of Symbolic Logic 31 (4):539-544.
The upper semilattice of degrees ≤ 0' is complemented.David B. Posner - 1981 - Journal of Symbolic Logic 46 (4):705 - 713.

View all 9 references / Add more references