Embedding finite lattices into the ideals of computably enumerable turing degrees (Q4328834): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Not every finite lattice is embeddable in the recursively enumerable degrees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Lattice nonembeddings and initial segments of the recursively enumerable degrees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees / rank | |||
Normal rank | |||
Latest revision as of 23:19, 3 June 2024
scientific article; zbMATH DE number 1735294
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Embedding finite lattices into the ideals of computably enumerable turing degrees |
scientific article; zbMATH DE number 1735294 |
Statements
Embedding finite lattices into the ideals of computably enumerable turing degrees (English)
0 references
23 July 2002
0 references
embedding
0 references
lattice of ideals
0 references
computably enumerable Turing degrees
0 references
