A shortest single axiom for the classical equivalential calculus

DOI10.1305/NDJFL/1093888216zbMATH Open0368.02009OpenAlexW2084463114WikidataQ114598254 ScholiaQ114598254MaRDI QIDQ1242883FDOQ1242883

Authors: John A. Kalman 

Publication date: 1978

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

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

Mathematics Subject Classification ID

Classical propositional logic (03B05) Software, source code, etc. for problems pertaining to mathematical logic and foundations (03-04)

Cited In (8)

• Towards finding longer proofs
• A method for finding new sets of axioms for classes of semigroups.
• A new use of an automated reasoning assistant: Open questions in equivalential calculus an the study of infinite domains
• Meeting the challenge of fifty years of logic
• The application of automated reasoning to questions in mathematics and logic
• Condensed detachment as a rule of inference
• Searching for circles of pure proofs
• The two-property and condensed detachment

This page was built for publication: A shortest single axiom for the classical equivalential calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1242883)