Maximality and collapse in the hierarchy of α-c.a. degrees (Q5859843): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Maximal contiguous degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES / rank
 
Normal rank
Property / cites work
 
Property / cites work: TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hierarchy of Turing Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3197814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3919704 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5619076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5619077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4946099 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic notions of genericity and array noncomputability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4712236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On degrees of unsolvability / rank
 
Normal rank

Revision as of 05:20, 27 July 2024

scientific article; zbMATH DE number 7429023
Language Label Description Also known as
English
Maximality and collapse in the hierarchy of α-c.a. degrees
scientific article; zbMATH DE number 7429023

    Statements

    Maximality and collapse in the hierarchy of α-c.a. degrees (English)
    0 references
    0 references
    0 references
    0 references
    18 November 2021
    0 references
    totally \(\alpha\)-c.a. degrees
    0 references
    maximal degrees
    0 references
    upper cones
    0 references
    computability
    0 references
    Turing degrees
    0 references
    approximation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references