Lattice nonembeddings and initial segments of the recursively enumerable degrees (Q757358): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q127957228, #quickstatements; #temporary_batch_1723538522512
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q5187269 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice embeddings into the recursively enumerable degrees. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intervals and sublattices of the r.e. weak truth table degrees. I: Density / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3197813 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3197814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The density of the nonbranching degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The undecidability of the recursively enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5670617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding minimal pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Refinement of Lown and Highn for the R.E. Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691658 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040892 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127957228 / rank
 
Normal rank

Latest revision as of 10:44, 13 August 2024

scientific article
Language Label Description Also known as
English
Lattice nonembeddings and initial segments of the recursively enumerable degrees
scientific article

    Statements

    Lattice nonembeddings and initial segments of the recursively enumerable degrees (English)
    0 references
    1990
    0 references
    The structure of an arbitrary initial segment of the upper semilattice of r.e. degrees is investigated. Main result: There exists a nonzero r.e. degree that bounds no critical triple. Conjecture: Every lattice that contains no critical triple is embeddable below every nonzero r.e. degree.
    0 references
    0 references
    embedding
    0 references
    initial segment of the upper semilattice of r.e. degrees
    0 references
    critical triple
    0 references
    0 references
    0 references
    0 references