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

Other Versions

No versions found

Links

PhilArchive



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

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.
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.
Embedding finite lattices into the ideals of computably enumerable Turing degrees.William Calhoun & Manuel Lerman - 2001 - Journal of Symbolic Logic 66 (4):1791-1802.
A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees.Steffen Lempp & Manuel Lerman - 1997 - Annals of Pure and Applied Logic 87 (2):167-185.
Embeddings of N5 and the contiguous degrees.Klaus Ambos-Spies & Peter A. Fejer - 2001 - Annals of Pure and Applied Logic 112 (2-3):151-188.
Lattice embeddings and array noncomputable degrees.Stephen M. Walk - 2004 - Mathematical Logic Quarterly 50 (3):219.
On definable filters in computably enumerable degrees.Wei Wang & Decheng Ding - 2007 - Annals of Pure and Applied Logic 147 (1):71-83.
Complementing cappable degrees in the difference hierarchy.Rod Downey, Angsheng Li & Guohua Wu - 2004 - Annals of Pure and Applied Logic 125 (1-3):101-118.
Friedberg splittings in Σ3 0 quotient lattices of.Todd Hammond - 1999 - Journal of Symbolic Logic 64 (4):1403-1406.

Analytics

Added to PP
2014-01-16

Downloads
26 (#852,250)

6 months
5 (#1,039,842)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

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