| |
Difino
| • | In mathematical logic, linear logic is a type of substructural logic that denies the structural rules of weakening and contraction. The interpretation is of hypotheses as resources: every hypothesis must be consumed exactly once in a proof. This differs from usual logics such as classical or intuitionistic logic where the governing judgement is of truth, which may be freely used as many times as necessary. To give an example, from propositions A and A ⇒ B one may conclude A ∧ B as follows:
· Modus ponens (or implication elimination) on the assumptions A and A ⇒ B to conclude B. Source: [wikipedia: linear logic]
|
substructural_logics:nonstandard_logics_and_extensions
 |
Applications of Linear Logic to Computation (1993) |
| | survey article by vladimir alexiev providing an overview of existing applications of linear logic to issues of computation. discusses implications of the theory in several fields of theoretical computer science, such as functional programming, and the correct treatment of negation in logic programming.
|
 |
Chu Spaces |
| | site created by vaughan pratt. chu spaces provide a rich class of model for linear logic.
|
 |
Computational Interpretations of Linear Logic (1993) |
| | article by samson abramsky which proposes a formulae-as-types correspondence first for intuitionsitic linear logic, and then for classical linear logic.
|
alebrije.info
:
alebrijes
:
sites
:
advertising
:
link to us
:
contact
|
|