Comparison of linear reducibility with other reducibilities of tabular type (Q1062049): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3884099 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypersimple sets with retraceable complements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4170708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Properties of Recursively Inseparable Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of Recursively Enumerable Sets and Degrees of Unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3968919 / rank
 
Normal rank

Revision as of 17:33, 14 June 2024

scientific article
Language Label Description Also known as
English
Comparison of linear reducibility with other reducibilities of tabular type
scientific article

    Statements

    Comparison of linear reducibility with other reducibilities of tabular type (English)
    0 references
    1983
    0 references
    It is proved that \(Th(L_{\ell})\neq Th(L_ r)\), where \(r\in \{tt,p,d\}\) and \(L_{\ell}\) \((L_ r)\) is the semilattice of r.e. \(\ell\)-degrees (r- degrees). Some facts about connections between c-, bd-, \(\ell\)-, d- completeness are given.
    0 references
    semilattice
    0 references
    degrees
    0 references
    0 references

    Identifiers