A note on propositional proof complexity of some Ramsey-type statements, Archive for Mathematical Logic

Abstrakt

A Ramsey type statement can be encoded into a propositional tautology. We consider several such tautologies and prove various lenthgs-of-proofs lower bounds on them.

Klíčová slova

• note
• propositional
• proof
• complexity
• some
• Ramsey-type
• statements
• Archive
• for
• Mathematical
• Logic