Affine logic: Difference between revisions

Content deleted Content added

Inline

Revision as of 17:36, 18 April 2008

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.

Revision as of 19:16, 27 January 2008 edit 85.228.39.192 (talk) →See also: Removed double stub ← Previous edit		Revision as of 17:36, 18 April 2008 edit undo Michael Hardy (talk \| contribs) Administrators 210,244 edits fixed the two usual newbie errors; see WP:MOS Next edit →
Line 1:		Line 1:
	A [[substructural logic]] that denies the [[structural rule]] of [[Idempotency of entailment\|contraction]]. It can also be characterized as [[linear logic]] with [[weakening]].		'''Affine logic''' is a [[substructural logic]] that denies the [[structural rule]] of [[Idempotency of entailment\|contraction]]. It can also be characterized as [[linear logic]] with [[weakening]].

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