Erratum: A counterexample to W. Bibel's and E. Eder's strong completeness result for connection graph resolution
Categories and Subject Descriptors: F.1.3 [Computation by Abstract Devices]: Complexity Classes-machine independent complexity: F.2.2 [Analysis of Algorithms and Problem Complexity): Nonnumerical Algorithms and Problems-complexity of proof procedures; F.4.1 [Mathematical Logic and Formal Languages]: Mathematical Logic-mechanical theorem proving, proof theory, I.2.3 [Artificial Intelligence]: Deduction and Theorem Proving-deduction, resolution.
mathematical logic computational logic mechanical theorem proving