Cutting plane and Frege proofs

DOI10.1006/inco.1995.1126zbMath0835.03024OpenAlexW2026203667MaRDI QIDQ1898117

Peter Clote

Publication date: 16 April 1996

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/f451adef143c379ff641af7d10964060b11bb238

zbMATH Keywords

cut-eliminationclassical propositional calculusParis-Harrington theoremFrege proof systemscombinatorial tautologiescutting plane refutation systemKanamori- McAloon theorem

Mathematics Subject Classification ID

Classical propositional logic (03B05) Complexity of proofs (03F20)

Related Items (2)

On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies ⋮ Cutting planes, connectivity, and threshold logic

This page was built for publication: Cutting plane and Frege proofs