Shortest single axioms for the equivalential calculus with CD and RCD

DOI10.1023/A:1005731217123zbMATH Open0893.68137OpenAlexW1594239767MaRDI QIDQ1383993FDOQ1383993

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

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

zbMATH Keywords

automated reasoningOTTERMACE

Mathematics Subject Classification ID

Cited In (9)

• Shortest axiomatizations of implicational S4 and S5
• A new use of an automated reasoning assistant: Open questions in equivalential calculus an the study of infinite domains
• Title not available (Why is that?)
• 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
• The two-property and condensed detachment
• Title not available (Why is that?)
• \textbf{D}-complete axioms for the classical equivalential calculus

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)