Proof net
≈ 2 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In proof theory, proof nets are a geometrical method of representing proofs that eliminates two forms of bureaucracy that differentiate proofs: (A) irrelevant syntactical features of regular proof calculi, and (B) the order of rules applied in a derivation. In this way, the formal properties of proof identity correspond more closely to the intuitively desirable properties. This distinguishes proof nets from regular proof calculi such as the natural deduction calculus and the sequent calculus, where these phenomena are present. Proof nets were introduced by Jean-Yves Girard. As an illustration, these two linear logic proofs are identical: | style="text-align: center;" | |} And their corresponding nets will be the same.
In proof theory, proof nets are a geometrical method of representing proofs that eliminates two forms of bureaucracy that differentiate proofs: (A) irrelevant syntactical features of regular proof calculi, and (B) the order of rules applied in a derivation. In this way, the formal properties of proof identity correspond more closely to the intuitively desirable properties. This distinguishes proof nets from regular proof calculi such as the natural deduction calculus and the sequent calculus, where these phenomena are present. Proof nets were introduced by Jean-Yves Girard. As an illustration, these two linear logic proofs are identical: | style="text-align: center;" | |} And their corresponding nets will be the same.
See also
Linear logic Ludics Geometry of interaction Coherent space Deep inference Interaction nets
References
Text derived from https://en.wikipedia.org/w/index.php?oldid=1319086385 under CC BY-SA 4.0; modifications have been made.