Relevant implication and the weak deduction theorem
From MaRDI portal
Relevant implicational calculus \(R_{\to}\) is the weakest system closed under modus ponens, substitution and relevant deduction: if there is a deduction of B from the set \(X\cup \{A\}\), where A is actually used, then \(A\to B\) is deducible from X. The author shows that this is no longer so, if one replaces relevant deduction with what he calls weak deduction theorem: if \(X\cup \{A\}\vdash B\) and \(X\nvdash B\), then \(X\vdash A\to B\).
Recommendations
- Relevant implication and the case for a weaker logic
- Deduction theorems for weak implicational logics
- scientific article; zbMATH DE number 1292304
- Implicational Logic, Relevance, and Refutability
- Weak Logics with Strict Implication
- scientific article; zbMATH DE number 5866432
- On a theory of weak implications
- scientific article; zbMATH DE number 3957057
- Completeness of implicational relevant logics
- On weak implication algebra
Cited in
(7)- The strong proof from hypotheses and conditionals: Some theorems of deduction for relevant systems
- Relevant implication and the case for a weaker logic
- scientific article; zbMATH DE number 5866432 (Why is no real title available?)
- On a theory of weak implications
- SUBSTITUTION IN RELEVANT LOGICS
- A dynamic characterization of the pure logic of relevant implication
- Deduction theorems for weak implicational logics
This page was built for publication: Relevant implication and the weak deduction theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1103605)