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
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
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
Mechanization of proofs and logical operations (03B35) Software, source code, etc. for problems pertaining to mathematical logic and foundations (03-04)
Related Items (6)
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