Connection-Based Proof Construction in Non-commutative Logic
Identifieur interne : 007E62 ( Main/Merge ); précédent : 007E61; suivant : 007E63Connection-Based Proof Construction in Non-commutative Logic
Auteurs : D. Galmiche [France] ; J. M. Notin [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract.: We propose a connection-based characterization of the multiplicative fragment of non-commutative logic (MNL), that is a conservative extension of both commutative (MLL) and non-commutative or cyclic (MCyLL) linear logic. It is based on a characterization for MLL together with the introduction of labels and constraints from a formula polarization process. We also study a similar characterization for the intuitionistic fragment of MNL. Finally, we consider the relationships between these results and proof nets construction in MNL based on labels and constraints.
Url:
DOI: 10.1007/978-3-540-39813-4_30
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000301
- to stream Istex, to step Curation: 000300
- to stream Istex, to step Checkpoint: 001A73
Links to Exploration step
ISTEX:0DCF7396E9D9B84A9FE7C582A039BFA9C1E7C28ALe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Connection-Based Proof Construction in Non-commutative Logic</title><author><name sortKey="Galmiche, D" sort="Galmiche, D" uniqKey="Galmiche D" first="D." last="Galmiche">D. Galmiche</name></author><author><name sortKey="Notin, J M" sort="Notin, J M" uniqKey="Notin J" first="J. M." last="Notin">J. M. Notin</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:0DCF7396E9D9B84A9FE7C582A039BFA9C1E7C28A</idno><date when="2003" year="2003">2003</date><idno type="doi">10.1007/978-3-540-39813-4_30</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-39W1GLVN-9/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">000301</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000301</idno><idno type="wicri:Area/Istex/Curation">000300</idno><idno type="wicri:Area/Istex/Checkpoint">001A73</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001A73</idno><idno type="wicri:doubleKey">0302-9743:2003:Galmiche D:connection:based:proof</idno><idno type="wicri:Area/Main/Merge">007E62</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Connection-Based Proof Construction in Non-commutative Logic</title><author><name sortKey="Galmiche, D" sort="Galmiche, D" uniqKey="Galmiche D" first="D." last="Galmiche">D. Galmiche</name><affiliation wicri:level="4"><country xml:lang="fr">France</country><wicri:regionArea>LORIA – Université Henri Poincaré, 54506, Vandœuvre-lés-Nancy Cedex</wicri:regionArea><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Vandœuvre-lès-Nancy</settlement></placeName><orgName type="university">Université Henri Poincaré</orgName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Notin, J M" sort="Notin, J M" uniqKey="Notin J" first="J. M." last="Notin">J. M. Notin</name><affiliation wicri:level="4"><country xml:lang="fr">France</country><wicri:regionArea>LORIA – Université Henri Poincaré, 54506, Vandœuvre-lés-Nancy Cedex</wicri:regionArea><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Vandœuvre-lès-Nancy</settlement></placeName><orgName type="university">Université Henri Poincaré</orgName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract.: We propose a connection-based characterization of the multiplicative fragment of non-commutative logic (MNL), that is a conservative extension of both commutative (MLL) and non-commutative or cyclic (MCyLL) linear logic. It is based on a characterization for MLL together with the introduction of labels and constraints from a formula polarization process. We also study a similar characterization for the intuitionistic fragment of MNL. Finally, we consider the relationships between these results and proof nets construction in MNL based on labels and constraints.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 007E62 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 007E62 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Merge
|type= RBID
|clé= ISTEX:0DCF7396E9D9B84A9FE7C582A039BFA9C1E7C28A
|texte= Connection-Based Proof Construction in Non-commutative Logic
}}
| This area was generated with Dilib version V0.6.33. |  |