Substructural logic

Substructural logic

In mathematical logic, in particular in connection with proof theory, a number of substructural logics have been introduced, as systems of propositional calculus that are weaker than the conventional one. They differ in having fewer structural rules available: the concept of structural rule is based on the sequent presentation, rather than the natural deduction formulation. Two of the more significant substructural logics are relevant logic and linear logic.

In a sequent calculus, one writes each line of a proof as


Here the structural rules are rules for rewriting the LHS Γ of the sequent, initially conceived of as a string of propositions. The standard interpretation of this string is as conjunction: we expect to read

:mathcal A,mathcal B vdashmathcal C

as the sequent notation for

:("A" and "B") implies "C".

Here we are taking the RHS Σ to be a single proposition "C" (which is the intuitionistic style of sequent); 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

:mathcal B,mathcal Avdashmathcal C


:mathcal A,mathcal Bvdashmathcal C.

There are further structural rules corresponding to the "idempotent" and "monotonic" properties of conjunction: from

: Gamma,mathcal A,mathcal A,Deltavdashmathcal C

we can deduce

: Gamma,mathcal A,Deltavdashmathcal C.

Also from

: Gamma,mathcal A,Deltavdashmathcal C

one can deduce, for any "B",

: Gamma,mathcal A,mathcal B,Deltavdashmathcal C.

Linear logic, in which duplicated hypotheses 'count' differently from single occurrences, leaves out both of these rules, while relevant (or relevance) logics merely leaves out the latter rule, on the ground that "B" is clearly irrelevant to the conclusion.

These 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 (before receiving a name).

External links

* [ Article on "Substructural logics"] at the Stanford Encyclopedia of Philosophy

Wikimedia Foundation. 2010.

Look at other dictionaries:

  • Logic — For other uses, see Logic (disambiguation). Philosophy …   Wikipedia

  • BL (logic) — Basic fuzzy Logic (or shortly BL), the logic of continuous t norms, is one of t norm fuzzy logics. It belongs to the broader class of substructural logics, or logics of residuated lattices;Ono (2003).] it extends the logic of all left continuous… …   Wikipedia

  • Łukasiewicz logic — In mathematics, Łukasiewicz logic is a non classical, many valued logic. It was originally defined by Jan Łukasiewicz as a three valued logic;Łukasiewicz J., 1920, O logice trójwartościowej (in Polish). Ruch filozoficzny 5:170–171. English… …   Wikipedia

  • Outline of logic — The following outline is provided as an overview of and topical guide to logic: Logic – formal science of using reason, considered a branch of both philosophy and mathematics. Logic investigates and classifies the structure of statements and… …   Wikipedia

  • List of mathematical logic topics — Clicking on related changes shows a list of most recent edits of articles to which this page links. This page links to itself in order that recent changes to this page will also be included in related changes. This is a list of mathematical logic …   Wikipedia

  • Noncommutative logic — is an extension of linear logic which combines the commutative connectives of linear logic with the noncommutative multiplicative connectives of the Lambek calculus (see External links below). Its sequent calculus relies on the structure of order …   Wikipedia

  • Relevance logic — Relevance logic, also called relevant logic, is a kind of non classical logic requiring the antecedent and consequent of implications be relevantly related. They may be viewed as a family of substructural or modal logics. (It is generally, but… …   Wikipedia

  • First-order logic — is a formal logical system used in mathematics, philosophy, linguistics, and computer science. It goes by many names, including: first order predicate calculus, the lower predicate calculus, quantification theory, and predicate logic (a less… …   Wikipedia

  • Mathematical logic — (also known as symbolic logic) is a subfield of mathematics with close connections to foundations of mathematics, theoretical computer science and philosophical logic.[1] The field includes both the mathematical study of logic and the… …   Wikipedia

  • History of logic — Philosophy ( …   Wikipedia