An algebraic correctness criterion for intuitionistic proof-nets (Q4376053)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1114337
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algebraic correctness criterion for intuitionistic proof-nets |
scientific article; zbMATH DE number 1114337 |
Statements
17 May 1998
0 references
intuitionistic proof-nets
0 references
intuitionistic fragments of multiplicative linear logic
0 references
correctness criterion
0 references
Lambek calculus
0 references
0.9372488856315612
0 references
0.8299821019172668
0 references
0.8285180926322937
0 references
An algebraic correctness criterion for intuitionistic proof-nets (English)
0 references
We consider intuitionistic fragments of multiplicative linear logic for which we define appropriate notions of proof-nets. Intuitionistic proof-nets may be easily defined by first introducing intuitionistic (or polarized) proof-structures and then by using any usual correctness criterion. Nevertheless, when using a criterion such as Girard's or Danos-Regnier's, one does not take any advantage of the intuitionistic nature of the polarized proof-nets. Indeed, the aforementioned criteria have been formulated in the classical framework. In this paper, we formulate a new criterion, which is intrinsically intuitionistic. This criterion consists in decorating the proof-structures with algebraic terms that must obey some constraints reminiscent of phase semantics. These constraints are defined according to the polarities of the proof-structure, which explains the intuitionistic nature of our criterion. We first state our criterion for intuitionistic implicative multiplicative linear logic (that is the fragment of linear logic whose only connective is ``\(\multimap\)''). Then we explain how to accommodate the multiplicative conjunction ``\(\otimes\)''. Finally, we adapt our criterion to the non-commutative case, i.e., the Lambek calculus. In this last case, the criterion is particularly interesting, as we explain at the end of the paper. For the entire collection see [Zbl 0865.00035].
0 references