Affine logic

From Wikipedia, the free encyclopedia

Affine logic is a substructural logic that denies the structural rule of contraction. It can also be characterized as linear logic with weakening.

Affine logic can be embedded into linear logic by rewriting the affine arrow A \rightarrow B as the linear arrow A {-\!\circ} B \otimes \top.

Whereas full linear logic (ie. linear logic with multiplicatives, additives and exponentials) is undecidable, full affine logic is decidable.

Affine logic forms the foundation of ludics.

[edit] References

[edit] See also

\lnot(p\land\lnot p)  This logic-related article is a stub. You can help by expanding it.
This article does not cite any references or sources. (December 2007)
Please help improve this article by adding citations to reliable sources. Unverifiable material may be challenged and removed.