Conquering the Meredith single axiom

DOI10.1023/A:1010691726881zbMath1006.03011OpenAlexW1931447968MaRDI QIDQ5951529

Larry Wos

Publication date: 7 January 2002

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

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

zbMATH Keywords

automated reasoningautomated theorem provingdouble negationMeredith single axiomOTTERpropositional calculustwo-valued sentential calculus

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Classical propositional logic (03B05)

Related Items (2)

Larry Wos: visions of automated reasoning ⋮ Double-negation elimination in some propositional logics

Uses Software

• OTTER
• TPTP

This page was built for publication: Conquering the Meredith single axiom