Defining totality in the enumeration degrees (Q5741445): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4449350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Array nonrecursiveness and relative recursive enumerability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination, forcing, array nonrecursiveness and relative recursive enumerability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low Level Nondelegability Results: Domination and Recursive Enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every Set has a Least Jump Enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial degrees and the density problem. Part 2: The enumeration degrees of the <i>Σ</i><sub>2</sub> sets are dense / rank
 
Normal rank
Property / cites work
 
Property / cites work: A criterion for completeness of degrees of unsolvability / 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: Cupping and definability in the local structure of the enumeration degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability via Kalimullin pairs in the structure of the enumeration degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semirecursive Sets and Positive Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: DEFINABILITY OF THE JUMP OPERATOR IN THE ENUMERATION DEGREES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jumps of quasi-minimal enumeration degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of unsolvability of continuous functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5551452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetical Reducibilities I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability in the Turing degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A jump inversion theorem for the enumeration jump / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5711186 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on ω-Jump Inversion of Degree Spectra of Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The jump operator on the \(\omega \)-enumeration degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The automorphism group of the enumeration degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3897194 / rank
 
Normal rank

Latest revision as of 07:44, 12 July 2024

scientific article; zbMATH DE number 6605725
Language Label Description Also known as
English
Defining totality in the enumeration degrees
scientific article; zbMATH DE number 6605725

    Statements

    Defining totality in the enumeration degrees (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 July 2016
    0 references
    enumeration degrees
    0 references
    total enumeration degrees
    0 references
    automorphisms of degree structures
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers