Metraipolis › archive › dc_8254281fd759

Affine logic — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Affine_logic
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-15T18:59:07.749Z
SHA-256 of the archived text
168b871d15a1e566133ab6deb3170ad83381ea27708c4db9b608020ff0760f1c
Stable URL of this page
https://metraipolis.com/documento/dc_8254281fd759

How to cite

Affine logic — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Affine_logic (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_8254281fd759 (Metraipolis archive dc_8254281fd759, sha256 168b871d15a1e566133ab6deb3170ad83381ea27708c4db9b608020ff0760f1c)
BibTeX
@misc{dc8254281fd759,
  title = {Affine logic — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Affine_logic},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_8254281fd759; sha256 168b871d15a1e566133ab6deb3170ad83381ea27708c4db9b608020ff0760f1c},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Affine_logic. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Affine logic is a substructural logic whose proof theory rejects the structural rule of contraction. It can also be characterized as linear logic with weakening. The name "affine logic" is associated with linear logic, to which it differs by allowing the weakening rule. Jean-Yves Girard introduced the name as part of the geometry of interaction semantics of linear logic, which characterizes linear logic in terms of linear algebra; here he alludes to affine transformations on vector spaces. Affine logic predated linear logic. V. N. Grishin used this logic in 1974, after observing that Russell's paradox cannot be derived in a set theory without contraction, even with an unbounded comprehension axiom. Likewise, the logic formed the basis of a decidable sub-theory of predicate logic, called 'Direct logic' (Ketonen & Wehrauch, 1984; Ketonen & Bellin, 1989). Affine logic can be embedded into linear logic by rewriting the affine arrow A → B {\displaystyle A\rightarrow B} as the linear arrow A ⊸ B ⊗ ⊤ {\displaystyle A\multimap B\otimes \top } . Whereas full linear logic (i.e. propositional linear logic with multiplicatives, additives, and exponentials) is undecidable, full affine logic is decidable. Affine logic forms the foundation of ludics.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «linear algebra»).
Fonte: Wikipedia in inglese, voce «Affine logic» — https://en.wikipedia.org/wiki/Affine_logic
Wikidata Q4688943 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q4688943
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Affine_logic?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1344586076, consultata il 2026-10-15T18:21:15.342Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: ed3e35be68056fc14e30a8dcbcaad0c803e08f95f35800584a2815718245698b