A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees

&
Annals of Pure and Applied Logic 87 (2):167-185 (1997)
  Copy   BIBTEX

Abstract

We exhibit a finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees. Our method promises to lead to a full characterization of the finite lattices embeddable into the enumerable Turing degrees

Categories

Keywords

Reprint years

DOI

10.1016/s0168-0072(96)00031-0

Links

PhilArchive



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

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

Embedding finite lattices into the ideals of computably enumerable Turing degrees.William C. Calhoun & Manuel Lerman - 2001 - Journal of Symbolic Logic 66 (4):1791-1802.
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 existential theory of the poset of R.e. Degrees with a predicate for single jump reducibility.Steffen Lempp & Manuel Lerman - 1992 - Journal of Symbolic Logic 57 (3):1120-1130.
The undecidability of the II4 theory for the R. E. wtt and Turing degrees.Steffen Lempp & André Nies - 1995 - Journal of Symbolic Logic 60 (4):1118 - 1136.
The Undecidability of the II$^_4$ Theory for the R. E. Wtt and Turing Degrees.Steffen Lempp & André Nies - 1995 - Journal of Symbolic Logic 60 (4):1118-1136.
A superhigh diamond in the c.e. tt-degrees.Douglas Cenzer, Johanna Ny Franklin, Jiang Liu & Guohua Wu - 2011 - Archive for Mathematical Logic 50 (1-2):33-44.
The degrees of conditional problems.Su Gao - 1994 - Journal of Symbolic Logic 59 (1):166-181.
Infima in the Recursively Enumerable Weak Truth Table Degrees.Rich Blaylock, Rod Downey & Steffen Lempp - 1997 - Notre Dame Journal of Formal Logic 38 (3):406-418.
On the Structure of the Medvedev Lattice.Sebastiaan A. Terwijn - 2008 - Journal of Symbolic Logic 73 (2):543 - 558.
Generalized nonsplitting in the recursively enumerable degrees.Steven D. Leonhardi - 1997 - Journal of Symbolic Logic 62 (2):397-437.
On relative enumerability of Turing degrees.Shamil Ishmukhametov - 2000 - Archive for Mathematical Logic 39 (3):145-154.
Complementation in the Turing degrees.Theodore A. Slaman & John R. Steel - 1989 - Journal of Symbolic Logic 54 (1):160-176.

Analytics

Added to PP
2014-01-16

Downloads
24 (#644,297)

6 months
7 (#416,569)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A Hierarchy of Computably Enumerable Degrees.Rod Downey & Noam Greenberg - 2018 - Bulletin of Symbolic Logic 24 (1):53-89.
Degree structures: Local and global investigations.Richard A. Shore - 2006 - Bulletin of Symbolic Logic 12 (3):369-389.

View all 12 citations / 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.
Sublattices of the Recursively Enumerable Degrees.S. K. Thomason - 1971 - Mathematical Logic Quarterly 17 (1):273-280.
Sublattices of the Recursively Enumerable Degrees.S. K. Thomason - 1971 - Mathematical Logic Quarterly 17 (1):273-280.

View all 8 references / Add more references