On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies (Q5278196): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A note on Ramsey numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separation results for the size of constant-depth propositional proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Small-Depth Frege Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting plane and Frege proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentration of Measure for the Analysis of Randomized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Theory and Probability. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some bounds for the Ramsey-Paris-Harrington numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some graph theoretic results associated with Ramsey's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rapidly growing Ramsey functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ramsey number <i>R</i>(3, <i>t</i>) has order of magnitude <i>t</i><sup>2</sup>/log <i>t</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds to the size of constant-depth propositional proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the weak pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on propositional proof complexity of some Ramsey-type statements / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of the weak pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey-Paris-Harrington numbers for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provability of the pigeonhole principle and the existence of infinitely many primes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Switching Lemma for Small Restrictions and Lower Bounds for <i>k</i>-DNF Resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic lower bounds for Ramsey functions / rank
 
Normal rank

Latest revision as of 03:32, 14 July 2024

scientific article; zbMATH DE number 6744580
Language Label Description Also known as
English
On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies
scientific article; zbMATH DE number 6744580

    Statements

    On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 July 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    Paris-Harrington's principle
    0 references
    proof complexity
    0 references
    Ramsey's theorem
    0 references
    resolution
    0 references
    0 references
    0 references