Extending properly n - REA sets1 (Q5061390): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Peter M. Gerdes / rank
Normal rank
 
Property / author
 
Property / author: Peter M. Gerdes / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Iterated relative recursive enumerability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical recursion theory. The theory of functions and sets of natural numbers. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3657980 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:49, 31 July 2024

scientific article; zbMATH DE number 7641233
Language Label Description Also known as
English
Extending properly n - REA sets1
scientific article; zbMATH DE number 7641233

    Statements

    Extending properly n - REA sets1 (English)
    0 references
    0 references
    0 references
    12 January 2023
    0 references
    REA sets
    0 references
    recursively enumerable and above
    0 references
    Turing degree
    0 references
    recursively enumerable
    0 references
    computability theory
    0 references
    recursion theory
    0 references

    Identifiers