Short proofs of the pigeonhole formulas based on the connection method

DOI10.1007/BF00244489MaRDI QIDQ915494zbMATH OpenFDO

Authors Wolfgang Bibel

Publication date 1990

Published in Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF00244489

zbMATH Keywords

automated theorem provingconnection methodproof complexityresolution

Mathematics Subject Classification ID

Recommendations

• Some properties of pigeon-hole formulas
• A new proof of the weak pigeonhole principle
• A new proof of the weak pigeonhole principle
• A Pigeonhole Proof of Kaplansky's Theorem
• Resolution proofs of generalized pigeonhole principles
• scientific article; zbMATH DE number 619542
• Quasipolynomial size proofs of the propositional pigeonhole principle
• scientific article; zbMATH DE number 2087215
• Exponential lower bounds for the pigeonhole principle
• On the weak pigeonhole principle

Cited in

(4)

• Simplification in a satisfiability checker for VLSI applications
• Tractability through symmetries in propositional calculus
• Clause trees: A tool for understanding and implementing resolution in automated reasoning
• Some properties of pigeon-hole formulas

This page was built for publication: Short proofs of the pigeonhole formulas based on the connection method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q915494)