A splitting theorem for $n-REA$ degrees (Q2750871): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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 / cites work
 
Property / cites work: The jump is definable in the structure of the degrees of unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Conjecture of Kleene and Post / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementing below recursively enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of unsolvability: structure and theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of computability theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recursively enumerable degree which will not split over all lesser ones / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the degrees less than 0' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defining the Turing jump / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systems of Logic Based on Ordinals<sup>†</sup> / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:03, 3 June 2024

scientific article
Language Label Description Also known as
English
A splitting theorem for $n-REA$ degrees
scientific article

    Statements

    A splitting theorem for $n-REA$ degrees (English)
    0 references
    0 references
    0 references
    21 October 2001
    0 references
    Turing degree
    0 references
    degrees of unsolvability
    0 references
    definability of the jump operator
    0 references
    \(n\)-REA degrees
    0 references
    recursively enumerable set
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references