Low sets without subsets of higher many-one degree (Q3096087): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Bi-immune sets for complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sets without subsets of higher many-one degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time introreducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Retraceable Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upward closure and cohesive degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cohesive set which is not high / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively enumerable many-one degrees / 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: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sets which do not have subsets of every higher degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sets with no subset of higher degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on degrees of subsets<sup>1</sup> / rank
 
Normal rank

Latest revision as of 15:37, 4 July 2024

scientific article
Language Label Description Also known as
English
Low sets without subsets of higher many-one degree
scientific article

    Statements

    Low sets without subsets of higher many-one degree (English)
    0 references
    0 references
    7 November 2011
    0 references
    m-degree
    0 references
    recursively enumerable sets
    0 references
    low sets
    0 references
    many-one degrees
    0 references
    finite-injury method
    0 references

    Identifiers