On notions of computability-theoretic reduction between Π21 principles (Q3186057): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the uniform computational content of computability theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5711879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrigendum to: “On the strength of Ramsey's Theorem for pairs” / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniform relationships between combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Randomness and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notions of robust information coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey’s theorem for singletons and strong computable reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slicing the Truth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Strength of Some Combinatorial Principles Related to Ramsey's Theorem for Pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5831322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partition Theorems and Computability Theory / 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: The weakness of being cohesive, thin or free in reverse mathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5596777 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4220572 / rank
 
Normal rank

Latest revision as of 08:56, 12 July 2024

scientific article
Language Label Description Also known as
English
On notions of computability-theoretic reduction between Π21 principles
scientific article

    Statements

    On notions of computability-theoretic reduction between Π21 principles (English)
    0 references
    8 August 2016
    0 references
    computable reducibility
    0 references
    uniform reducibility
    0 references
    Weihrauch reducibility
    0 references
    Ramsey's theorem
    0 references
    König's lemma
    0 references
    strong reducibility
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references