Avoiding uniformity in the \(\Delta_2^0\) enumeration degrees (Q2453064): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.apal.2014.04.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2047884664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable structures and the hyperarithmetical hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2906563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properly Σ2 Enumeration Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimal pairs of enumeration degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3487329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4417312 / 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: Reducibility and Completeness for Sets of Integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limit lemmas and jump inversion in the enumeration degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Goodness in the enumeration and singleton degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semirecursive Sets and Positive Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees in Which the Recursive Sets are Uniformly Recursive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2713991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(n\)-rea enumeration degrees are dense / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical recursion theory. Vol. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4348132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The limitations of cupping in the local structure of the enumeration degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3567853 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5602103 / rank
 
Normal rank

Latest revision as of 14:50, 8 July 2024

scientific article
Language Label Description Also known as
English
Avoiding uniformity in the \(\Delta_2^0\) enumeration degrees
scientific article

    Statements

    Avoiding uniformity in the \(\Delta_2^0\) enumeration degrees (English)
    0 references
    0 references
    0 references
    6 June 2014
    0 references
    enumeration reducibility
    0 references
    degree
    0 references
    Ershov hierarchy
    0 references
    incomparable degree
    0 references
    arithmetical uniformity
    0 references
    low
    0 references
    high
    0 references
    cappable
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references