Supplement to Relevance Logic

The Logic R

Here is a Hilbert-style axiomatisation of the logic R.

Our language contains propositional variables, parentheses, negation, conjunction, and implication. In addition, we use the following defined connectives:

AB =df ¬(¬A & ¬B)
AB =df (AB) & (BA)
Axiom Scheme Axiom Name
1. AA Identity
2. (AB) → ((BC) → (AC)) Suffixing
3. A → ((AB) → B) Assertion
4. (A → (AB)) → (AB) Contraction
5. (A & B) → A,(A & B) → B & -Elimination
6. A → (AB), B → (AB) ∨-Introduction
7. ((AB) & (AC)) → (A → (B & C)) & -Introduction
8. ((AB) → C)↔((AC) & (BC)) ∨-Elimination
9. (A & (BC)) → ((A & B)∨(A & C)) Distribution
10. (A → ¬B) → (B → ¬A) Contraposition
11. ¬¬AA Double Negation

Rule Name
AB, AB Modus Ponens
A, BA & B Adjunction

Copyright © 2012 by
Edwin Mares <Edwin.Mares@vuw.ac.nz>

Open access to the SEP is made possible by a world-wide funding initiative.
Please Read How You Can Help Keep the Encyclopedia Free