Shortest single axioms for the equivalential calculus with CD and RCD

DOI10.1023/A:1005731217123MaRDI QIDQ1383993zbMATH OpenOpenAlexFDO

Authors Kahlil Hodgson

Publication date 13 April 1998

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

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

zbMATH Keywords

automated reasoningMACEOTTER

Mathematics Subject Classification ID

Recommendations

• A new use of an automated reasoning assistant: Open questions in equivalential calculus an the study of infinite domains
• Vanquishing the XCB question: The methodological discovery of the last shortest single axiom for the equivalential calculus
• Searching for circles of pure proofs

Cited in

(10)

• Shortest axiomatizations of implicational S4 and S5
• Vanquishing the XCB question: The methodological discovery of the last shortest single axiom for the equivalential calculus
• Searching for circles of pure proofs
• Automated discovery of single axioms for ortholattices
• scientific article; zbMATH DE number 5147179 (Why is no real title available?)
• \textbf{D}-complete axioms for the classical equivalential calculus
• scientific article; zbMATH DE number 650883 (Why is no real title available?)
• D-complete single axioms for the equivalential calculus with the rules d and r
• A new use of an automated reasoning assistant: Open questions in equivalential calculus an the study of infinite domains
• The two-property and condensed detachment

Describes a project that uses

Uses Software

• OTTER
• Mace4

This page was built for publication: Shortest single axioms for the equivalential calculus with CD and RCD

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