The nonlow computably enumerable degrees are not invariant in $\mathcal {E}$ (Q4913812): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automorphisms of the lattice of recursively enumerable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Δ₃⁰-automorphism method and noninvariant classes of degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definable properties of the computably enumerable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of recursively enumerable sets which have no maximal supersets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some games which are relevant to the theory of recursively enumerable sets / 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: Definability in the Recursively Enumerable Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively enumerable sets of positive integers and their decision problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of classes of RE sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Enumerability and the Jump Operator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3819052 / rank
 
Normal rank

Latest revision as of 08:32, 6 July 2024

scientific article; zbMATH DE number 6154670
Language Label Description Also known as
English
The nonlow computably enumerable degrees are not invariant in $\mathcal {E}$
scientific article; zbMATH DE number 6154670

    Statements

    The nonlow computably enumerable degrees are not invariant in $\mathcal {E}$ (English)
    0 references
    0 references
    16 April 2013
    0 references
    computably enumerable degree
    0 references
    recursively enumerable degree
    0 references
    definability
    0 references
    automorphism
    0 references
    invariance
    0 references

    Identifiers