There is no plus-capping degree (Q1325049): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Minimal pairs in initial segments of the recursively enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetization of metamathematics in a general setting / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain lattices of degrees of interpretability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-bounding constructions / rank
 
Normal rank

Revision as of 16:19, 22 May 2024

scientific article
Language Label Description Also known as
English
There is no plus-capping degree
scientific article

    Statements

    There is no plus-capping degree (English)
    0 references
    0 references
    0 references
    0 references
    7 July 1994
    0 references
    The authors answer a question of Per Lindström. It is proved that there is no ``plus-capping'' degree, i.e. that for any incomplete r.e. degree \({\mathbf w}\), there is an incomplete r.e. degree \({\mathbf a}> {\mathbf w}\) such that there is no r.e. degree \({\mathbf v}> {\mathbf w}\) with \({\mathbf a}\cap {\mathbf v}= {\mathbf w}\).
    0 references
    0 references
    plus-capping degrees
    0 references
    recursively enumerable degree
    0 references
    0 references