ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS (Q4799379): 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: Coding in the partial order of 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: Degrees of recursively enumerable sets which have no maximal supersets / rank
 
Normal rank
Property / cites work
 
Property / cites work: d-simple sets, small sets, and degree classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting properties and jump classes / 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: Recursion, metarecursion, and inclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of classes of RE sets / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0219061302000151 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2018594881 / rank
 
Normal rank

Latest revision as of 11:10, 30 July 2024

scientific article; zbMATH DE number 1886337
Language Label Description Also known as
English
ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS
scientific article; zbMATH DE number 1886337

    Statements

    ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS (English)
    0 references
    0 references
    0 references
    2002
    0 references
    definability
    0 references
    computably enumerable sets
    0 references
    Turing reducibility
    0 references
    computably enumerable degrees
    0 references
    jump classes
    0 references

    Identifiers