A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees (Q1295397)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees |
scientific article; zbMATH DE number 1308080
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees |
scientific article; zbMATH DE number 1308080 |
Statements
A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees (English)
0 references
8 November 1999
0 references
The problem of characterizing partial finite lattices embeddable into the computably enumerable degrees is studied. The author introduces a notion of ranked partial lattice and decribes a necessary and sufficient condition for embeddings of such lattices. This gives a hope to obtain a complete decision of the problem.
0 references
computably enumerable set
0 references
degrees
0 references
embeddings
0 references
partial lattice
0 references
0 references
