natural deduction metalanguage, practical foundations
type theory (dependent, intensional, observational type theory, homotopy type theory)
computational trinitarianism =
propositions as types +programs as proofs +relation type theory/category theory
Substructural logic is a general term for formal logics in which the structural inference rules:
the contraction rule
the weakening rule
the exchange rule
are not necessarily assumed, or only with restrictions.
Among substructural logics are the following:
linear logic, perhaps the best-known to category theorists, which omits the contraction and weakening rules (if also the exchange rule is omitted, one speaks of noncommutative linear logic);
affine logic which omits only the contraction rule. (one might call it coaffine logic if also the weakening rule is omitted);
some forms of relevant logic and paraconsistent logic (often of the coaffine variety).
Last revised on May 28, 2024 at 13:15:24. See the history of this page for a list of all contributions to it.