Relevance logic

Relevance logic, also called relevant logic, is a kind of non-classical logic requiring the antecedent and consequent of implications to be relevantly related. They may be viewed as a family of substructural or modal logics. It is generally, but not universally, called relevant logic by British and, especially, Australian logicians, and relevance logic by American logicians.

Relevance logic aims to capture aspects of implication that are ignored by the "material implication" operator in classical truth-functional logic, namely the notion of relevance between antecedent and conditional of a true implication. This idea is not new: C. I. Lewis was led to invent modal logic, and specifically strict implication, on the grounds that classical logic grants paradoxes of material implication such as the principle that a falsehood implies any proposition.[1][2] Hence "if I'm a donkey, then two and two is four" is true when translated as a material implication, yet it seems intuitively false since a true implication must tie the antecedent and consequent together by some notion of relevance. And whether or not the speaker is a donkey seems in no way relevant to whether two and two is four.

In terms of a syntactical constraint for a propositional calculus, it is necessary, but not sufficient, that premises and conclusion share atomic formulae (formulae that do not contain any logical connectives). In a predicate calculus, relevance requires sharing of variables and constants between premises and conclusion. This can be ensured (along with stronger conditions) by, e.g., placing certain restrictions on the rules of a natural deduction system. In particular, a Fitch-style natural deduction can be adapted to accommodate relevance by introducing tags at the end of each line of an application of an inference indicating the premises relevant to the conclusion of the inference. Gentzen-style sequent calculi can be modified by removing the weakening rules that allow for the introduction of arbitrary formulae on the right or left side of the sequents.

A notable feature of relevance logics is that they are paraconsistent logics: the existence of a contradiction will not necessarily cause an "explosion." This follows from the fact that a conditional with a contradictory antecedent that does not share any propositional or predicate letters with the consequent cannot be true (or derivable).

## History

[edit]

Relevance logic was proposed in 1928 by Soviet philosopher Ivan E. Orlov (1886 – circa 1936) in his strictly mathematical paper "The Logic of Compatibility of Propositions" published in Matematicheskii Sbornik. The basic idea of relevant implication appears in medieval logic, and some pioneering work was done by Ackermann,[3] Moh,[4] and Church[5] in the 1950s. Drawing on them, Nuel Belnap and Alan Ross Anderson (with others) wrote the magnum opus of the subject, Entailment: The Logic of Relevance and Necessity in the 1970s (the second volume being published in the nineties). They focused on both systems of entailment and systems of relevance, where implications of the former kinds are supposed to be both relevant and necessary.

## Axioms

[edit]

The early developments in relevance logic focused on the stronger systems. The development of the Routley–Meyer semantics brought out a range of weaker logics. The weakest of these logics is the relevance logic B. It is axiomatized with the following axioms and rules.

1. A -> A {\displaystyle A\to A}
2. A ∧ B -> A {\displaystyle A\land B\to A}
3. A ∧ B -> B {\displaystyle A\land B\to B}
4. ( A -> B ) ∧ ( A -> C ) -> ( A -> B ∧ C ) {\displaystyle (A\to B)\land (A\to C)\to (A\to B\land C)}
5. A -> A ∨ B {\displaystyle A\to A\lor B}
6. B -> A ∨ B {\displaystyle B\to A\lor B}
7. ( A -> C ) ∧ ( B -> C ) -> ( A ∨ B -> C ) {\displaystyle (A\to C)\land (B\to C)\to (A\lor B\to C)}
8. A ∧ ( B ∨ C ) -> ( A ∧ B ) ∨ ( A ∧ C ) {\displaystyle A\land (B\lor C)\to (A\land B)\lor (A\land C)}
9. ¬ ¬ A -> A {\displaystyle \lnot \lnot A\to A}

The rules are the following.

1. A , A -> B ⊢ B {\displaystyle A,A\to B\vdash B}
2. A , B ⊢ A ∧ B {\displaystyle A,B\vdash A\land B}
3. A -> B ⊢ ( C -> A ) -> ( C -> B ) {\displaystyle A\to B\vdash (C\to A)\to (C\to B)}
4. A -> B ⊢ ( B -> C ) -> ( A -> C ) {\displaystyle A\to B\vdash (B\to C)\to (A\to C)}
5. A -> ¬ B ⊢ B -> ¬ A {\displaystyle A\to \lnot B\vdash B\to \lnot A}

Stronger logics can be obtained by adding any of the following axioms.

1. ( A -> B ) -> ( ¬ B -> ¬ A ) {\displaystyle (A\to B)\to (\lnot B\to \lnot A)}
2. ( A -> B ) ∧ ( B -> C ) -> ( A -> C ) {\displaystyle (A\to B)\land (B\to C)\to (A\to C)}
3. ( A -> B ) -> ( ( B -> C ) -> ( A -> C ) ) {\displaystyle (A\to B)\to ((B\to C)\to (A\to C))}
4. ( A -> B ) -> ( ( C -> A ) -> ( C -> B ) ) {\displaystyle (A\to B)\to ((C\to A)\to (C\to B))}
5. ( A -> ( A -> B ) ) -> ( A -> B ) {\displaystyle (A\to (A\to B))\to (A\to B)}
6. ( A ∧ ( A -> B ) ) -> B {\displaystyle (A\land (A\to B))\to B}
7. ( A -> ¬ A ) -> ¬ A {\displaystyle (A\to \lnot A)\to \lnot A}
8. ( A -> ( B -> C ) ) -> ( B -> ( A -> C ) ) {\displaystyle (A\to (B\to C))\to (B\to (A\to C))}
9. A -> ( ( A -> B ) -> B ) {\displaystyle A\to ((A\to B)\to B)}
10. ( ( A -> A ) -> B ) -> B {\displaystyle ((A\to A)\to B)\to B}
11. A ∨ ¬ A {\displaystyle A\lor \lnot A}
12. A -> ( A -> A ) {\displaystyle A\to (A\to A)}

There are some notable logics stronger than B that can be obtained by adding axioms to B as follows.

* For DW, add axiom 1.
* For DJ, add axioms 1, 2.
* For TW, add axioms 1, 2, 3, 4.
* For RW, add axioms 1, 2, 3, 4, 8, 9.
* For T, add axioms 1, 2, 3, 4, 5, 6, 7, 11.
* For R, add axioms 1-11.
* For E, add axioms 1-7, 10, 11,  ( ( A -> A ) ∧ ( B -> B ) -> C ) -> C {\displaystyle ((A\to A)\land (B\to B)\to C)\to C} , and  ◻ A ∧ ◻ B -> ◻ ( A ∧ B ) {\displaystyle \Box A\land \Box B\to \Box (A\land B)} , where  ◻ A {\displaystyle \Box A} is defined as  ( A -> A ) -> A {\displaystyle (A\to A)\to A} .
* For RM, add all the additional axioms.

## Models

[edit]

### Routley–Meyer models

[edit]

The standard model theory for relevance logics is the Routley-Meyer ternary-relational semantics developed by Richard Routley and Robert Meyer. A Routley–Meyer frame F for a propositional language is a quadruple (W,R,*,0), where W is a non-empty set, R is a ternary relation on W, and * is a function from W to W, and  0 ∈ W {\displaystyle 0\in W} . A Routley-Meyer model M is a Routley-Meyer frame F together with a valuation,  ⊩ {\displaystyle \Vdash } , that assigns a truth value to each atomic proposition relative to each point  a ∈ W {\displaystyle a\in W} . There are some conditions placed on Routley-Meyer frames. Define  a ≤ b {\displaystyle a\leq b} as  R 0 a b {\displaystyle R0ab} .

* a ≤ a {\displaystyle a\leq a} .
* If  a ≤ b {\displaystyle a\leq b} and  b ≤ c {\displaystyle b\leq c} , then  a ≤ c {\displaystyle a\leq c} .
* If  d ≤ a {\displaystyle d\leq a} and  R a b c {\displaystyle Rabc} , then  R d b c {\displaystyle Rdbc} .
* a ∗ ∗ = a {\displaystyle a^{**}=a} .
* If  a ≤ b {\displaystyle a\leq b} , then  b ∗ ≤ a ∗ {\displaystyle b^{*}\leq a^{*}} .

Write  M , a ⊩ A {\displaystyle M,a\Vdash A} and  M , a ⊮ A {\displaystyle M,a\nVdash A} to indicate that the formula  A {\displaystyle A} is true, or not true, respectively, at point  a {\displaystyle a} in  M {\displaystyle M} . One final condition on Routley-Meyer models is the hereditariness condition.

* If  M , a ⊩ p {\displaystyle M,a\Vdash p} and  a ≤ b {\displaystyle a\leq b} , then  M , b ⊩ p {\displaystyle M,b\Vdash p} , for all atomic propositions  p {\displaystyle p} .

By an inductive argument, hereditariness can be shown to extend to complex formulas, using the truth conditions below.

* If  M , a ⊩ A {\displaystyle M,a\Vdash A} and  a ≤ b {\displaystyle a\leq b} , then  M , b ⊩ A {\displaystyle M,b\Vdash A} , for all formulas  A {\displaystyle A} .

The truth conditions for complex formulas are as follows.

* M , a ⊩ A ∧ B ⟺ M , a ⊩ A {\displaystyle M,a\Vdash A\land B\iff M,a\Vdash A} and  M , a ⊩ B {\displaystyle M,a\Vdash B}
* M , a ⊩ A ∨ B ⟺ M , a ⊩ A {\displaystyle M,a\Vdash A\lor B\iff M,a\Vdash A} or  M , a ⊩ B {\displaystyle M,a\Vdash B}
* M , a ⊩ A -> B ⟺ ∀ b , c ( ( R a b c ∧ M , b ⊩ A ) ⇒ M , c ⊩ B ) {\displaystyle M,a\Vdash A\to B\iff \forall b,c((Rabc\land M,b\Vdash A)\Rightarrow M,c\Vdash B)}
* M , a ⊩ ¬ A ⟺ M , a ∗ ⊮ A {\displaystyle M,a\Vdash \lnot A\iff M,a^{*}\nVdash A}

A formula  A {\displaystyle A} holds in a model  M {\displaystyle M} just in case  M , 0 ⊩ A {\displaystyle M,0\Vdash A} . A formula  A {\displaystyle A} holds on a frame  F {\displaystyle F} iff A holds in every model  ( F , ⊩ ) {\displaystyle (F,\Vdash )} . A formula  A {\displaystyle A} is valid in a class of frames iff A holds on every frame in that class. The class of all Routley–Meyer frames satisfying the above conditions validates that relevance logic B. One can obtain Routley-Meyer frames for other relevance logics by placing appropriate restrictions on R and on *. These conditions are easier to state using some standard definitions. Let  R a b c d {\displaystyle Rabcd} be defined as  ∃ x ( R a b x ∧ R x c d ) {\displaystyle \exists x(Rabx\land Rxcd)} , and let  R a ( b c ) d {\displaystyle Ra(bc)d} be defined as  ∃ x ( R b c x ∧ R a x d ) {\displaystyle \exists x(Rbcx\land Raxd)} . Some of the frame conditions and the axioms they validate are the following.

Name  | Frame condition  | Axiom

|
|

Pseudo-modus ponens  |  R a a a {\displaystyle Raaa} |  ( A ∧ ( A -> B ) ) -> B {\displaystyle (A\land (A\to B))\to B}
Prefixing  |  R a b c d ⇒ R a ( b c ) d {\displaystyle Rabcd\Rightarrow Ra(bc)d} |  ( A -> B ) -> ( ( C -> A ) -> ( C -> B ) ) {\displaystyle (A\to B)\to ((C\to A)\to (C\to B))}
Suffixing  |  R a b c d ⇒ R b ( a c ) d {\displaystyle Rabcd\Rightarrow Rb(ac)d} |  ( A -> B ) -> ( ( B -> C ) -> ( A -> C ) ) {\displaystyle (A\to B)\to ((B\to C)\to (A\to C))}
Contraction  |  R a b c ⇒ R a b b c {\displaystyle Rabc\Rightarrow Rabbc} |  ( A -> ( A -> B ) ) -> ( A -> B ) {\displaystyle (A\to (A\to B))\to (A\to B)}
Hypothetical syllogism  |  R a b c ⇒ R a ( a b ) c {\displaystyle Rabc\Rightarrow Ra(ab)c} |  ( A -> B ) ∧ ( B -> C ) -> ( A -> C ) {\displaystyle (A\to B)\land (B\to C)\to (A\to C)}
Assertion  |  R a b c ⇒ R b a c {\displaystyle Rabc\Rightarrow Rbac} |  A -> ( ( A -> B ) -> B ) {\displaystyle A\to ((A\to B)\to B)}
E axiom  |  R a 0 a {\displaystyle Ra0a} |  ( ( A -> A ) -> B ) -> B {\displaystyle ((A\to A)\to B)\to B}
Mingle axiom  |  R a b c ⇒ a ≤ c {\displaystyle Rabc\Rightarrow a\leq c} or  b ≤ c {\displaystyle b\leq c} |  A -> ( A -> A ) {\displaystyle A\to (A\to A)}
Reductio  |  R a a ∗ a {\displaystyle Raa^{*}a} |  ( A -> ¬ A ) -> ¬ A {\displaystyle (A\to \lnot A)\to \lnot A}
Contraposition  |  R a b c ⇒ R a c ∗ b ∗ {\displaystyle Rabc\Rightarrow Rac^{*}b^{*}} |  ( A -> B ) -> ( ¬ B -> ¬ A ) {\displaystyle (A\to B)\to (\lnot B\to \lnot A)}
Excluded middle  |  0 ∗ ≤ 0 {\displaystyle 0^{*}\leq 0} |  A ∨ ¬ A {\displaystyle A\lor \lnot A}
Strict implication weakening  |  0 ≤ a {\displaystyle 0\leq a} |  A -> ( B -> B ) {\displaystyle A\to (B\to B)}
Weakening  |  R a b c ⇒ b ≤ c {\displaystyle Rabc\Rightarrow b\leq c} |  A -> ( B -> A ) {\displaystyle A\to (B\to A)}

The last two conditions validate forms of weakening that relevance logics were originally developed to avoid. They are included to show the flexibility of the Routley–Meyer models.

### Operational models

[edit]

#### Urquhart models

[edit]

Operational models for negation-free fragments of relevance logics were developed by Alasdair Urquhart in his PhD thesis and in subsequent work. The intuitive idea behind the operational models is that points in a model are pieces of information, and combining information supporting a conditional with the information supporting its antecedent yields some information that supports the consequent. Since the operational models do not generally interpret negation, this section will consider only languages with a conditional, conjunction, and disjunction.

An operational frame  F {\displaystyle F} is a triple  ( K , ⋅ , 0 ) {\displaystyle (K,\cdot ,0)} , where  K {\displaystyle K} is a non-empty set,  0 ∈ K {\displaystyle 0\in K} , and  ⋅ {\displaystyle \cdot } is a binary operation on  K {\displaystyle K} . Frames have conditions, some of which may be dropped to model different logics. The conditions Urquhart proposed to model the conditional of the relevance logic R are the following.

* x ⋅ x = x {\displaystyle x\cdot x=x}
* ( x ⋅ y ) ⋅ z = x ⋅ ( y ⋅ z ) {\displaystyle (x\cdot y)\cdot z=x\cdot (y\cdot z)}
* x ⋅ y = y ⋅ x {\displaystyle x\cdot y=y\cdot x}
* 0 ⋅ x = x {\displaystyle 0\cdot x=x}

Under these conditions, the operational frame is a join-semilattice.

An operational model  M {\displaystyle M} is a frame  F {\displaystyle F} with a valuation  V {\displaystyle V} that maps pairs of points and atomic propositions to truth values, T or F.  V {\displaystyle V} can be extended to a valuation  ⊩ {\displaystyle \Vdash } on complex formulas as follows.

* M , a ⊩ p ⟺ V ( a , p ) = T {\displaystyle M,a\Vdash p\iff V(a,p)=T} , for atomic propositions
* M , a ⊩ A ∧ B ⟺ M , a ⊩ A {\displaystyle M,a\Vdash A\land B\iff M,a\Vdash A} and  M , a ⊩ B {\displaystyle M,a\Vdash B}
* M , a ⊩ A ∨ B ⟺ M , a ⊩ A {\displaystyle M,a\Vdash A\lor B\iff M,a\Vdash A} or  M , a ⊩ B {\displaystyle M,a\Vdash B}
* M , a ⊩ A -> B ⟺ ∀ b ( M , b ⊩ A ⇒ M , a ⋅ b ⊩ B ) {\displaystyle M,a\Vdash A\to B\iff \forall b(M,b\Vdash A\Rightarrow M,a\cdot b\Vdash B)}

A formula  A {\displaystyle A} holds in a model  M {\displaystyle M} iff  M , 0 ⊩ A {\displaystyle M,0\Vdash A} . A formula  A {\displaystyle A} is valid in a class of models  C {\displaystyle C} iff it holds in each model  M ∈ C {\displaystyle M\in C} .

The conditional fragment of R is sound and complete with respect to the class of semilattice models. The logic with conjunction and disjunction is properly stronger than the conditional, conjunction, disjunction fragment of R. In particular, the formula  ( A -> ( B ∨ C ) ) ∧ ( B -> C ) -> ( A -> C ) {\displaystyle (A\to (B\lor C))\land (B\to C)\to (A\to C)} is valid for the operational models but it is invalid in R. The logic generated by the operational models for R has a complete axiomatic proof system, due Kit Fine and to Gerald Charlwood. Charlwood also provided a natural deduction system for the logic, which he proved equivalent to the axiomatic system. Charlwood showed that his natural deduction system is equivalent to a system provided by Dag Prawitz.

The operational semantics can be adapted to model the conditional of E by adding a non-empty set of worlds  W {\displaystyle W} and an accessibility relation  ≤ {\displaystyle \leq } on  W × W {\displaystyle W\times W} to the frames. The accessibility relation is required to be reflexive and transitive, to capture the idea that E's conditional has an S4 necessity. The valuations then map triples of atomic propositions, points, and worlds to truth values. The truth condition for the conditional is changed to the following.

* M , a , w ⊩ A -> B ⟺ ∀ b , ∀ w ′ ≥ w ( M , b , w ′ ⊩ A ⇒ M , a ⋅ b , w ′ ⊩ B ) {\displaystyle M,a,w\Vdash A\to B\iff \forall b,\forall w'\geq w(M,b,w'\Vdash A\Rightarrow M,a\cdot b,w'\Vdash B)}

The operational semantics can be adapted to model the conditional of T by adding a relation  ≤ {\displaystyle \leq } on  K × K {\displaystyle K\times K} . The relation is required to obey the following conditions.

* 0 ≤ x {\displaystyle 0\leq x}
* If  x ≤ y {\displaystyle x\leq y} and  y ≤ z {\displaystyle y\leq z} , then  x ≤ z {\displaystyle x\leq z}
* If  x ≤ y {\displaystyle x\leq y} , then  x ⋅ z ≤ y ⋅ z {\displaystyle x\cdot z\leq y\cdot z}

The truth condition for the conditional is changed to the following.

* M , a ⊩ A -> B ⟺ ∀ b ( ( a ≤ b ∧ M , b ⊩ A ) ⇒ M , a ⋅ b ⊩ B ) {\displaystyle M,a\Vdash A\to B\iff \forall b((a\leq b\land M,b\Vdash A)\Rightarrow M,a\cdot b\Vdash B)}

There are two ways to model the contraction-less relevance logics TW and RW with the operational models. The first way is to drop the condition that  x ⋅ x = x {\displaystyle x\cdot x=x} . The second way is to keep the semilattice conditions on frames and add a binary relation,  J {\displaystyle J} , of disjointness to the frame. For these models, the truth conditions for the conditional is changed to the following, with the addition of the ordering in the case of TW.

* M , a ⊩ A -> B ⟺ ∀ b ( ( J a b ∧ M , b ⊩ A ) ⇒ M , a ⋅ b ⊩ B ) {\displaystyle M,a\Vdash A\to B\iff \forall b((Jab\land M,b\Vdash A)\Rightarrow M,a\cdot b\Vdash B)}

#### Humberstone models

[edit]

Urquhart showed that the semilattice logic for R is properly stronger than the positive fragment of R. Lloyd Humberstone provided an enrichment of the operational models that permitted a different truth condition for disjunction. The resulting class of models generates exactly the positive fragment of R.

An operational frame  F {\displaystyle F} is a quadruple  ( K , ⋅ , + , 0 ) {\displaystyle (K,\cdot ,+,0)} , where  K {\displaystyle K} is a non-empty set,  0 ∈ K {\displaystyle 0\in K} , and { ⋅ {\displaystyle \cdot } ,  + {\displaystyle +} } are binary operations on  K {\displaystyle K} . Let  a ≤ b {\displaystyle a\leq b} be defined as  ∃ x ( a + x = b ) {\displaystyle \exists x(a+x=b)} . The frame conditions are the following.

1. 0 ⋅ x = x {\displaystyle 0\cdot x=x}
2. x ⋅ y = y ⋅ x {\displaystyle x\cdot y=y\cdot x}
3. ( x ⋅ y ) ⋅ z = x ⋅ ( y ⋅ z ) {\displaystyle (x\cdot y)\cdot z=x\cdot (y\cdot z)}
4. x ≤ x ⋅ x {\displaystyle x\leq x\cdot x}
5. x + y = y + x {\displaystyle x+y=y+x}
6. ( x + y ) + z = x + ( y + z ) {\displaystyle (x+y)+z=x+(y+z)}
7. x + x = x {\displaystyle x+x=x}
8. x ⋅ ( y + z ) = x ⋅ y + x ⋅ z {\displaystyle x\cdot (y+z)=x\cdot y+x\cdot z}
9. x ≤ y + z ⇒ ∃ y ′ , z ′ ∈ K ( y ′ ≤ y {\displaystyle x\leq y+z\Rightarrow \exists y',z'\in K(y'\leq y} ,  z ′ ≤ z {\displaystyle z'\leq z} and  x = y ′ + z ′ ) {\displaystyle x=y'+z')}

An operational model  M {\displaystyle M} is a frame  F {\displaystyle F} with a valuation  V {\displaystyle V} that maps pairs of points and atomic propositions to truth values, T or F.  V {\displaystyle V} can be extended to a valuation  ⊩ {\displaystyle \Vdash } on complex formulas as follows.

* M , a ⊩ p ⟺ V ( a , p ) = T {\displaystyle M,a\Vdash p\iff V(a,p)=T} , for atomic propositions
* M , a + b ⊩ p ⟺ M , a ⊩ p {\displaystyle M,a+b\Vdash p\iff M,a\Vdash p} and  M , b ⊩ p {\displaystyle M,b\Vdash p}
* M , a ⊩ A ∧ B ⟺ M , a ⊩ A {\displaystyle M,a\Vdash A\land B\iff M,a\Vdash A} and  M , a ⊩ B {\displaystyle M,a\Vdash B}
* M , a ⊩ A ∨ B ⟺ M , a ⊩ A {\displaystyle M,a\Vdash A\lor B\iff M,a\Vdash A} or  M , a ⊩ B {\displaystyle M,a\Vdash B} or  ∃ b , c ( a = b + c {\displaystyle \exists b,c(a=b+c} ;  M , b ⊩ A {\displaystyle M,b\Vdash A} and  M , c ⊩ B ) {\displaystyle M,c\Vdash B)}
* M , a ⊩ A -> B ⟺ ∀ b ( M , b ⊩ A ⇒ M , a ⋅ b ⊩ B ) {\displaystyle M,a\Vdash A\to B\iff \forall b(M,b\Vdash A\Rightarrow M,a\cdot b\Vdash B)}

A formula  A {\displaystyle A} holds in a model  M {\displaystyle M} iff  M , 0 ⊩ A {\displaystyle M,0\Vdash A} . A formula  A {\displaystyle A} is valid in a class of models  C {\displaystyle C} iff it holds in each model  M ∈ C {\displaystyle M\in C} .

The positive fragment of R is sound and complete with respect to the class of these models. Humberstone's semantics can be adapted to model different logics by dropping or adding frame conditions as follows.

System  | Frame conditions

|

B  | 1, 5-9, 14  |

10. x ≤ x ⋅ 0 {\displaystyle x\leq x\cdot 0}
11. ( x ⋅ y ) ⋅ z ≤ y ⋅ ( x ⋅ z ) {\displaystyle (x\cdot y)\cdot z\leq y\cdot (x\cdot z)}
12. ( x ⋅ y ) ⋅ z ≤ x ⋅ ( y ⋅ z ) {\displaystyle (x\cdot y)\cdot z\leq x\cdot (y\cdot z)}
13. x ⋅ y ≤ ( x ⋅ y ) ⋅ y {\displaystyle x\cdot y\leq (x\cdot y)\cdot y}
14. ( y + z ) ⋅ x = y ⋅ x + z ⋅ x {\displaystyle (y+z)\cdot x=y\cdot x+z\cdot x}
15. x ⋅ x = x {\displaystyle x\cdot x=x}

TW  | 1, 11, 12, 5-9, 14
EW  | 1, 10, 11, 5-9, 14
RW  | 1-3, 5-9
T  | 1, 11, 12, 13, 5-9, 14
E  | 1, 10, 11, 13, 5-9, 14
R  | 1-9
RM  | 1-3, 5-9, 15

### Algebraic models

[edit]

Some relevance logics can be given algebraic models, such as the logic R. The algebraic structures for R are de Morgan monoids, which are sextuples  ( D , ∧ , ∨ , ¬ , ∘ , e ) {\displaystyle (D,\land ,\lor ,\lnot ,\circ ,e)} where

* ( D , ∧ , ∨ , ¬ ) {\displaystyle (D,\land ,\lor ,\lnot )} is a distributive lattice with a unary operation,  ¬ {\displaystyle \lnot } obeying the laws  ¬ ¬ x = x {\displaystyle \lnot \lnot x=x} and if  x ≤ y {\displaystyle x\leq y} then  ¬ y ≤ ¬ x {\displaystyle \lnot y\leq \lnot x} ;
* e ∈ D {\displaystyle e\in D} , the binary operation  ∘ {\displaystyle \circ } is commutative ( x ∘ y = y ∘ x {\displaystyle x\circ y=y\circ x} ) and associative ( ( x ∘ y ) ∘ z = x ∘ ( y ∘ z ) {\displaystyle (x\circ y)\circ z=x\circ (y\circ z)} ), and  e ∘ x = x {\displaystyle e\circ x=x} , i.e.  ( D , ∘ , e ) {\displaystyle (D,\circ ,e)} is an Abelian monoid with identity e {\displaystyle e} ;
* the monoid is lattice-ordered and satisfies  x ∘ ( y ∨ z ) = ( x ∘ y ) ∨ ( x ∘ z ) {\displaystyle x\circ (y\lor z)=(x\circ y)\lor (x\circ z)} ;
* x ≤ x ∘ x {\displaystyle x\leq x\circ x} ; and
* if  x ∘ y ≤ z {\displaystyle x\circ y\leq z} , then  x ∘ ¬ z ≤ ¬ y {\displaystyle x\circ \lnot z\leq \lnot y} .

The operation  x -> y {\displaystyle x\to y} interpreting the conditional of R is defined as  ¬ ( x ∘ ¬ y ) {\displaystyle \lnot (x\circ \lnot y)} . A de Morgan monoid is a residuated lattice, obeying the following residuation condition.

x ∘ y ≤ z ⟺ x ≤ y -> z {\displaystyle x\circ y\leq z\iff x\leq y\to z}

An interpretation  v {\displaystyle v} is a homomorphism from the propositional language to a de Morgan monoid  M {\displaystyle M} such that

* v ( p ) ∈ D {\displaystyle v(p)\in D} for all atomic propositions,
* v ( ¬ A ) = ¬ v ( A ) {\displaystyle v(\lnot A)=\lnot v(A)}
* v ( A ∨ B ) = v ( A ) ∨ v ( B ) {\displaystyle v(A\lor B)=v(A)\lor v(B)}
* v ( A ∧ B ) = v ( A ) ∧ v ( B ) {\displaystyle v(A\land B)=v(A)\land v(B)}
* v ( A -> B ) = v ( A ) -> v ( B ) {\displaystyle v(A\to B)=v(A)\to v(B)}

Given a de Morgan monoid  M {\displaystyle M} and an interpretation  v {\displaystyle v} , one can say that formula  A {\displaystyle A} holds on  v {\displaystyle v} just in case  e ≤ v ( A ) {\displaystyle e\leq v(A)} . A formula  A {\displaystyle A} is valid just in case it holds on all interpretations on all de Morgan monoids. The logic R is sound and complete for de Morgan monoids.

## See also

[edit]

* Philosophy portal

* Connexive logic, a different approach to the paradoxes of material implication
* Non sequitur (logic)
* Relevant type system, a substructural type system

## References

[edit]

1. ^ Lewis, C. I. (1912). "Implication and the Algebra of Logic." Mind, 21(84):522–531.
2. ^ Lewis, C. I. (1917). "The issues concerning material implication." Journal of Philosophy, Psychology, and Scientific Methods, 14:350–356.
3. ^ Ackermann, W. (1956), "Begründung einer strengen Implikation", Journal of Symbolic Logic, 21 (2): 113–128, JSTOR 2268750
4. ^ Moh, Shaw-kwei (1950), "The Deduction Theorems and Two New Logical Systems", Methodos, 2: 56–75 Moh Shaw-Kwei, 1950, "," Methodos 2 56–75.
5. ^ Church, A. (1951), The Weak Theory of Implication in Kontroliertes Denken: Untersuchungen zum Logikkalkül und zur Logik der Einzelwissenschaften, Kommissions-Verlag Karl Alber, edited by A. Menne, A. Wilhelmy and H. Angsil, pp. 22–37.

## Bibliography

[edit]

* Alan Ross Anderson and Nuel Belnap, 1975. Entailment: the logic of relevance and necessity, vol. I. Princeton University Press. ISBN 0-691-07192-6
* \

- and J. M. Dunn, 1992. Entailment: the logic of relevance and necessity, vol. II, Princeton University Press.
* Mares, Edwin, and Meyer, R. K., 2001, "Relevant Logics", in Goble, Lou, ed., The Blackwell Guide to Philosophical Logic. Blackwell.
* Richard Routley, Val Plumwood, Robert K. Meyer, and Ross T. Brady. Relevant Logics and their Rivals. Ridgeview, 1982.
* R. Brady (ed.), Relevant Logics and their Rivals (Volume II), Aldershot: Ashgate, 2003.
* Urquhart, Alasdair (1972). "Semantics for relevant logics" (PDF). Journal of Symbolic Logic. 37: 159–169. doi:10.2307/2272559.
* Alasdair Urquhart. The Semantics of Entailment. PhD thesis, University of Pittsburgh, 1972.
* Katalin Bimbó, Relevance logics, in Philosophy of Logic, D. Jacquette (ed.), (volume 5 of Handbook of the Philosophy of Science, D. Gabbay, P. Thagard, J. Woods (eds.)), Elsevier (North-Holland), 2006, pp. 723–789.
* J. Michael Dunn and Greg Restall. Relevance logic. In Handbook of Philosophical Logic, Volume 6, F. Guenthner and D. Gabbay (eds.), Dordrecht: Kluwer, 2002, pp. 1–136.
* Stephen Read, Relevant Logic, Oxford: Blackwell, 1988.
* Humberstone, Lloyd (1987). "Operational semantics for positive R". Notre Dame Journal of Formal Logic. 29 (1): 61–80. doi:10.1305/ndjfl/1093637771.

## External links

[edit]

* Stanford Encyclopedia of Philosophy: "Relevance logic" – by Edwin Mares.
* Relevance logic – by J. Michael Dunn and Greg Restall
* Relevant Logic – by Stephen Read

* v
* t
* e

Non-classical logic

Intuitionistic|

* Intuitionistic logic
* Constructive analysis
* Heyting arithmetic
* Intuitionistic type theory
* Constructive set theory

Fuzzy|

* Degree of truth
* Fuzzy rule
* Fuzzy set
* Fuzzy finite element
* Fuzzy set operations

Substructural|

* Structural rule
* Relevance logic
* Linear logic

Paraconsistent|

* Dialetheism

Description|

* Ontology (computer science)
* Ontology language

Many-valued|

* Three-valued
* Four-valued
* Łukasiewicz

Digital logic|

* Three-state logic
* Tri-state buffer
* Four-valued
* Verilog
* IEEE 1164
* VHDL

Others|

* Dynamic semantics
* Inquisitive logic
* Intermediate logic
* Non-monotonic logic

*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template