Effectivity and reducibility with ordinal Turing machines (Q5037207): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3222180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weihrauch Complexity in Computable Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Effective Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordinal computability. An introduction to infinitary machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizable sets and Woodin cardinals: computation beyond the constructible universe / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fine structure and class forcing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards computable analysis on the generalised real line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3261422 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective Mathematics of the Uncountable / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Effectivity of Some Field Constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The axiom of choice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5625138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing Computations On Ordinals / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON WEIHRAUCH REDUCIBILITY AND INTUITIONISTIC REVERSE MATHEMATICS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provident sets and rudimentary set forcing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree Representations via Ordinal Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3037419 / rank
 
Normal rank

Revision as of 04:17, 28 July 2024

scientific article; zbMATH DE number 7481735
Language Label Description Also known as
English
Effectivity and reducibility with ordinal Turing machines
scientific article; zbMATH DE number 7481735

    Statements

    Effectivity and reducibility with ordinal Turing machines (English)
    0 references
    0 references
    0 references
    28 February 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    effective reducibility
    0 references
    ordinal computability
    0 references
    0 references