Questions concerning possible shortest single axioms for the equivalential calculus: An application of automated theorem proving to infinite domains

DOI10.1305/ndjfl/1093870311zbMath0488.03008OpenAlexW2009579853WikidataQ114254310 ScholiaQ114254310MaRDI QIDQ1165832

S. Singh

Publication date: 1983

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1093870311

zbMATH Keywords

complete characterization of the set of theorems deducible from each of the formulas proved too weakpossible existence of additional shortest single axioms for the equivalential calculus

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Software, source code, etc. for problems pertaining to mathematical logic and foundations (03-04)

Related Items (6)

Using the prover ANDP to simplify orthogonality. ⋮ Simplifying von Plato's axiomatization of constructive apartness geometry ⋮ A new use of an automated reasoning assistant: Open questions in equivalential calculus an the study of infinite domains ⋮ Condensed detachment as a rule of inference ⋮ The two-property and condensed detachment ⋮ Larry Wos: visions of automated reasoning

This page was built for publication: Questions concerning possible shortest single axioms for the equivalential calculus: An application of automated theorem proving to infinite domains