Lattice nonembeddings and intervals of the recursively enumerable degrees

&
Annals of Pure and Applied Logic 61 (3):195-221 (1993)
  Copy   BIBTEX

Abstract

Let b and c be r.e. Turing degrees such that b>c. We show that there is an r.e. degree a such that b>a>c and all lattices containing a critical triple, including the lattice M5, cannot be embedded into the interval [c, a]

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(93)90220-8

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

Lattice nonembeddings and initial segments of the recursively enumerable degrees.Rod Downey - 1990 - Annals of Pure and Applied Logic 49 (2):97-119.
Automorphisms of the lattice of recursively enumerable sets.Peter Cholak - 1995 - Providence, RI: American Mathematical Society.
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.
The Isolated D. R. E. Degrees are Dense in the R. E. Degrees.Geoffrey Laforte - 1996 - Mathematical Logic Quarterly 42 (1):83-103.
Definable structures in the lattice of recursively enumerable sets.E. Herrmann - 1984 - Journal of Symbolic Logic 49 (4):1190-1197.
Complementation in the Turing degrees.Theodore A. Slaman & John R. Steel - 1989 - Journal of Symbolic Logic 54 (1):160-176.
The discontinuity of splitting in the recursively enumerable degrees.S. Barry Cooper & Xiaoding Yi - 1995 - Archive for Mathematical Logic 34 (4):247-256.
On the orbits of hyperhypersimple sets.Wolfgang Maass - 1984 - Journal of Symbolic Logic 49 (1):51-62.
Lattice embeddings into the recursively enumerable degrees.K. Ambos-Spies & M. Lerman - 1986 - Journal of Symbolic Logic 51 (2):257-272.
Lattice embeddings into the recursively enumerable degrees. II.K. Ambos-Spies & M. Lerman - 1989 - Journal of Symbolic Logic 54 (3):735-760.
The intervals of the lattice of recursively enumerable sets determined by major subsets.Wolfgang Maass & Michael Stob - 1983 - Annals of Pure and Applied Logic 24 (2):189-212.
Generalized nonsplitting in the recursively enumerable degrees.Steven D. Leonhardi - 1997 - Journal of Symbolic Logic 62 (2):397-437.
Recursively enumerable generic sets.Wolfgang Maass - 1982 - Journal of Symbolic Logic 47 (4):809-823.
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.

Analytics

Added to PP
2014-01-16

Downloads
18 (#814,090)

6 months
4 (#800,606)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Lattice embeddings and array noncomputable degrees.Stephen M. Walk - 2004 - Mathematical Logic Quarterly 50 (3):219.

Add more citations

References found in this work

A minimal pair of recursively enumerable degrees.C. E. M. Yates - 1966 - Journal of Symbolic Logic 31 (2):159-168.
The density of infima in the recursively enumerable degrees.Theodore A. Slaman - 1991 - Annals of Pure and Applied Logic 52 (1-2):155-179.
The density of the nonbranching degrees.Peter A. Fejer - 1983 - Annals of Pure and Applied Logic 24 (2):113-130.
Sublattices of the Recursively Enumerable Degrees.S. K. Thomason - 1971 - Mathematical Logic Quarterly 17 (1):273-280.

View all 13 references / Add more references