Vanquishing the XCB question: The methodological discovery of the last shortest single axiom for the equivalential calculus

DOI10.1023/A:1021693818601zbMath1020.03006OpenAlexW1620994827MaRDI QIDQ1869616

Branden Fitelson, Dolph Ulrich, Larry Wos

Publication date: 28 April 2003

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

Full work available at URL: https://doi.org/10.1023/a:1021693818601

zbMATH Keywords

equivalenceautomated reasoningcondensed detachmentdetachmentOTTERsingle axiomsequivalential calculusXCBshortest single axioms

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (3)

A method for finding new sets of axioms for classes of semigroups. ⋮ Computer theorem proving in mathematics ⋮ Larry Wos: visions of automated reasoning

Uses Software

• OTTER

This page was built for publication: Vanquishing the XCB question: The methodological discovery of the last shortest single axiom for the equivalential calculus