Substructural logic
In logic, a substructural logic is a logic lacking one of the usual structural rules, such as weakening, contraction, exchange or associativity. Two of the more significant substructural logics are relevance logic and linear logic.
Examples
In a sequent calculus, one writes each line of a proof asHere the structural rules are rules for rewriting the LHS of the sequent, denoted Γ, initially conceived of as a finite string of propositions. The standard interpretation of this string is as conjunction: we expect to read
as the sequent notation for
Here we are taking the RHS Σ to be a single proposition C ; but everything applies equally to the general case, since all the manipulations are taking place to the left of the turnstile symbol.
Since conjunction is a commutative and associative operation, the formal setting-up of sequent theory normally includes structural rules for rewriting the sequent Γ accordingly—for example for deducing
from
There are further structural rules corresponding to the idempotent and monotonic properties of conjunction: from
we can deduce
Also from
one can deduce, for any B,
Linear logic, in which duplicated hypotheses 'count' differently from single occurrences, leaves out both of these rules, while relevant logics merely leaves out the latter rule, on the ground that B is clearly irrelevant to the conclusion.
The above are basic examples of structural rules. It is not that these rules are contentious, when applied in conventional propositional calculus. They occur naturally in proof theory, and were first noticed there.