Definability via Kalimullin pairs in the structure of the enumeration degrees (Q5247021): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q4449350 / 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: Q3487329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimal pairs of enumeration degrees / 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: The high/low hierarchy in the local structure of the \(\omega\)-enumeration degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpreting true arithmetic in the local structure of the enumeration degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properly enumeration degrees and the high/low hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakly semirecursive sets / 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: The \(n\)-rea enumeration degrees are dense / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jumps of quasi-minimal enumeration degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpretability and Definability in the Recursively Enumerable Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biinterpretability up to double jump in the degrees below $\mathbf {0}^{\prime }$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree Structures: Local and Global Investigations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defining the Turing jump / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3597424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4348132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A jump inversion theorem for the enumeration jump / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1090/s0002-9947-2014-06157-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2013208488 / rank
 
Normal rank

Latest revision as of 10:17, 30 July 2024

scientific article; zbMATH DE number 6429148
Language Label Description Also known as
English
Definability via Kalimullin pairs in the structure of the enumeration degrees
scientific article; zbMATH DE number 6429148

    Statements

    Definability via Kalimullin pairs in the structure of the enumeration degrees (English)
    0 references
    0 references
    0 references
    22 April 2015
    0 references
    enumeration reducibility
    0 references
    first order definability
    0 references
    enumeration jump
    0 references
    total enumeration degrees
    0 references
    low enumeration degrees
    0 references

    Identifiers