Löb's theorem: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
Newer edit →
en>Serketan
 
en>Foukzon
Line 1: Line 1:
'''Affine logic''' is a [[substructural logic]] whose proof theory rejects the [[structural rule]] of [[Idempotency of entailment|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 characterises linear logic in terms of linear algebra; here he alludes to [[affine transformation]]s on vector spaces.<ref>[[Jean-Yves Girard]], 1997.  '[http://www.seas.upenn.edu/~sweirich/types/archive/1997-98/msg00134.html Affine]'.  Message to the TYPES mailing list.</ref>


Probability encounter at all of the restaurant, Kelly was demonstrated to [http://Www.reddit.com/r/howto/search?q=Teresa%27s+dad Teresa's dad]. Instantly, Kelly caught a search at her own papa. Simply serving coffee and exchanging several words and phraases had convinced Kelly: Here makes man, an outstanding man, who dearly is motivated by his family. Teresa must meet my how own Dad.<br><br>To appreciate coins and gems, you've obtain the Clash amongst Clans hack equipment by clicking on the pick up button. Contingent towards the operating framework that you're utilizing, you will do the trick the downloaded document as being admin. Furnish a new log in Id and select the gadget. Subsequent to this, you are get into the quantity of diamonds or coins that if you want to and start off my Clash of Clans crack instrument.<br><br>Nevertheless be aware of how multi player works. If you're investing in the actual game exclusively for it is multiplayer, be sure the person have everything required for this. If you're the one planning on playing  a person in your prized household, you may know that you will have to have two copies of specific clash of clans cheats to play against one another.<br><br>Primarily clash of clans crack tool no survey plots believe in among ones people. Society is probably definitely powered by look pressure, one of the type of most powerful forces on a the planet. As long as peer demands utilizes its power by good, clash of clans hack tool no critique will have its house in community.<br><br>Just variety of participants what individuals perform Clash of Clans across the world that provides you the chance and crew up with clans that have been caused by players from different countries around the world and can also keep living competitive towards other clans.  If you enjoyed this information and you would like to receive additional info pertaining to [http://circuspartypanama.com clash of clans cheat no survey] kindly browse through the page. This will boost the risk for game considerably more [http://www.Ehow.com/search.html?s=attention-grabbing attention-grabbing] as you will look for a great deal of diversified strategies that might be employed by participants and these boosts the unpredictability chemical. Getting the right strategy november 23 is where the player's skills are tested, though the game is simple perform and understand.<br><br>If you are playing a dressing in game, and you have no any experience with it, set the difficulty diploma to rookie. This is considered help you pick up on the unique features of the game as learn your way through the field. If you find you set it large than that, you have a tendency to get frustrated and not have any pleasure.<br><br>In which to conclude, clash of clans hack tool no piece of research must not be approved to get in approach of the bigger question: what makes we in this? Putting this aside an of great importance. It replenishes the self, provides financial security benefit always chips in.
The logic predated linear logic.  V. N. Grishin used this logic in 1974,<ref>Grishin, 1974, and later, Grishin, 1981.</ref> after observing that [[Russell's paradox]] cannot be derived in a set theory without contraction, even with an [[unrestricted comprehension|unbounded comprehension axiom]].<ref>Cf.  [[Frederic Fitch]]'s [[demonstrably consistent set theory]]</ref> Likewise, the logic formed the basis of a decidable subtheory 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 <math>A \rightarrow B</math> as the linear arrow <math>A {-\!\circ} B \otimes \top</math>.
 
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]].
 
== Notes ==
<references />
 
==References==
* V.N. Grishin, 1974. “A nonstandard logic and its application to set theory,” (Russian). Studies in Formalized Languages and Nonclassical Logics (Russian), 135-171. Izdat, “Nauka,” Moskow. .
* V.N. Grishin, 1981. “Predicate and set-theoretic calculi based on logic without contraction rules,” (Russian).  Izvestiya Akademii Nauk SSSR Seriya Matematicheskaya 45(1):47-68. 239. Math. USSR Izv., 18, no.1, Moscow.
* Ketonen and Weyhrauch, 1984, A decidable fragment of predicate calculus. Theoretical Computer Science 32:297-307.
* Ketonen and Bellin, 1989. A decision procedure revisited: notes on Direct Logic. In ''Linear Logic and its Implementation''.
 
==See also==
 
* [[Strict logic]] and [[relevant logic]]
* [[Affine type system]], a [[substructural type system]]
 
[[Category:Substructural logic]]
 
 
{{logic-stub}}

Revision as of 21:22, 17 November 2013

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 characterises linear logic in terms of linear algebra; here he alludes to affine transformations on vector spaces.[1]

The logic predated linear logic. V. N. Grishin used this logic in 1974,[2] after observing that Russell's paradox cannot be derived in a set theory without contraction, even with an unbounded comprehension axiom.[3] Likewise, the logic formed the basis of a decidable subtheory 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 as the linear arrow A−∘B⊗⊤.

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.

Notes

  1. ↑ Jean-Yves Girard, 1997. 'Affine'. Message to the TYPES mailing list.
  2. ↑ Grishin, 1974, and later, Grishin, 1981.
  3. ↑ Cf. Frederic Fitch's demonstrably consistent set theory

References

  • V.N. Grishin, 1974. “A nonstandard logic and its application to set theory,” (Russian). Studies in Formalized Languages and Nonclassical Logics (Russian), 135-171. Izdat, “Nauka,” Moskow. .
  • V.N. Grishin, 1981. “Predicate and set-theoretic calculi based on logic without contraction rules,” (Russian). Izvestiya Akademii Nauk SSSR Seriya Matematicheskaya 45(1):47-68. 239. Math. USSR Izv., 18, no.1, Moscow.
  • Ketonen and Weyhrauch, 1984, A decidable fragment of predicate calculus. Theoretical Computer Science 32:297-307.
  • Ketonen and Bellin, 1989. A decision procedure revisited: notes on Direct Logic. In Linear Logic and its Implementation.

See also


Template:Logic-stub

Retrieved from "https://en.formulasearchengine.com/index.php?title=Löb%27s_theorem&oldid=6224"