The Completeness of Propositional Resolution: A Simple and Constructive Proof

DOI10.2168/LMCS-2(5:3)2006zbMath1127.03008OpenAlexW3103956213MaRDI QIDQ5310674

Jean H. Gallier

Publication date: 11 October 2007

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2168/lmcs-2(5:3)2006

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35)

Related Items (1)

Extracting the resolution algorithm from a completeness proof for the propositional calculus

This page was built for publication: The Completeness of Propositional Resolution: A Simple and Constructive Proof