A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees

Annals of Pure and Applied Logic 101 (2-3):275-297 (2000)
  Copy   BIBTEX

Abstract

We present a necessary and sufficient condition for the embeddability of a principally decomposable finite lattice into the computably enumerable degrees. This improves a previous result which required that, in addition, the lattice be ranked. The same condition is also necessary and sufficient for a finite lattice to be embeddable below every non-zero computably enumerable degree

Categories

Keywords

Reprint years

DOI

10.1016/s0168-0072(99)00021-4

Links

PhilArchive



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

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

A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees preserving greatest element.Burkhard Englert - 2001 - Annals of Pure and Applied Logic 112 (1):1-26.
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.
A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees.M. Lerman - 1998 - Annals of Pure and Applied Logic 94 (1-3):143-180.
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.
An Interval of Computably Enumerable Isolating Degrees.Matthew C. Salts - 1999 - Mathematical Logic Quarterly 45 (1):59-72.
Bounding cappable degrees.Angsheng Li - 2000 - Archive for Mathematical Logic 39 (5):311-352.
The computably enumerable degrees are locally non-cappable.Matthew B. Giorgi - 2004 - Archive for Mathematical Logic 43 (1):121-139.
On the filter of computably enumerable supersets of an r-maximal set.Steffen Lempp, André Nies & D. Reed Solomon - 2001 - Archive for Mathematical Logic 40 (6):415-423.
Differences of Computably Enumerable Sets.A. Nies & S. Lempp - 2000 - Mathematical Logic Quarterly 46 (4):555-562.
Bounding minimal degrees by computably enumerable degrees.Angsheng Li & Dongping Yang - 1998 - Journal of Symbolic Logic 63 (4):1319-1347.
Traces, traceability, and lattices of traces under the set theoretic inclusion.Gunther Mainhardt - 2013 - Archive for Mathematical Logic 52 (7-8):847-869.
On a problem of Cooper and Epstein.Shamil Ishmukhametov - 2003 - Journal of Symbolic Logic 68 (1):52-64.
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.

Analytics

Added to PP
2014-01-16

Downloads
16 (#855,572)

6 months
6 (#431,022)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Degree structures: Local and global investigations.Richard A. Shore - 2006 - Bulletin of Symbolic Logic 12 (3):369-389.

Add more citations

References found in this work

Add more references