Ordinal machines and admissible recursion theory (Q1032634): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4934284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3329455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metarecursively enumerable sets and their metadegrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fine structure of the constructible hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing Computations On Ordinals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metarecursive sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of transfinite recursion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The α-finite injury method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some More Minimal Pairs of α‐Recursively Enumerable Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the recursive functions of ordinal numbers / rank
 
Normal rank

Latest revision as of 02:55, 2 July 2024

scientific article
Language Label Description Also known as
English
Ordinal machines and admissible recursion theory
scientific article

    Statements

    Ordinal machines and admissible recursion theory (English)
    0 references
    0 references
    0 references
    26 October 2009
    0 references
    ordinal machines
    0 references
    computability theory
    0 references
    admissible recursion theory
    0 references
    \(\alpha \)-recursion theory
    0 references
    Sacks-Simpson theorem
    0 references

    Identifiers