A note on monothetic BCI

DOI10.1305/NDJFL/1168352666MaRDI QIDQ2372686zbMATH OpenOpenAlexFDO

Authors Tomasz Kowalski, Sam Butchart

Publication date 1 August 2007

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

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

zbMATH Keywords

BCI logicmonothetic BCI logicsubstructural logics

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)

Review text

The authors prove a conjecture from [\textit{L. Humberstone}, Notre Dame J. Formal Logic 47, No. 1, 101--131 (2006; Zbl 1107.03018)] that the extension of the logic BCI by the axiom \((A \rightarrow A) \rightarrow (B \rightarrow B)\) is monothetic BCI, i.e., the smallest extension of BCI in which all theorems are provably equivalent. The proof is obtained with the help of the automated theorem prover OTTER.

Recommendations

• Self-implications in BCI
• scientific article; zbMATH DE number 1222495
• On an axiomatic system for the logic of linearly ordered BCI-matrices
• BCI-Algebras and Related Logics
• The finite model property for BCI and related systems

Cited in

(4)

• On the algebraizability of the implicational fragment of abelian logic
• On an axiomatic system for the logic of linearly ordered BCI-matrices
• Integrally closed residuated lattices
• Self-implications in BCI

Describes a project that uses

Uses Software

• OTTER

This page was built for publication: A note on monothetic BCI

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