Connection-based proof construction in Non-Commutative Logic
Identifieur interne : 003944 ( Crin/Curation ); précédent : 003943; suivant : 003945Connection-based proof construction in Non-Commutative Logic
Auteurs : Didier Galmiche ; Jean-Marc NotinSource :
English descriptors
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.
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: Pour aller vers cette notice dans l'étape Curation :003944
Links to Exploration step
CRIN:galmiche03bLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="639">Connection-based proof construction in Non-Commutative Logic</title></titleStmt><publicationStmt><idno type="RBID">CRIN:galmiche03b</idno><date when="2003" year="2003">2003</date><idno type="wicri:Area/Crin/Corpus">003944</idno><idno type="wicri:Area/Crin/Curation">003944</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">003944</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Connection-based proof construction in Non-Commutative Logic</title><author><name sortKey="Galmiche, Didier" sort="Galmiche, Didier" uniqKey="Galmiche D" first="Didier" last="Galmiche">Didier Galmiche</name></author><author><name sortKey="Notin, Jean Marc" sort="Notin, Jean Marc" uniqKey="Notin J" first="Jean-Marc" last="Notin">Jean-Marc Notin</name></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>connection method</term><term>constraints</term><term>labels</term><term>linear logic</term><term>non-commutative logic</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="3028">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><BibTex type="inproceedings"><ref>galmiche03b</ref><crinnumber>A03-R-210</crinnumber><category>3</category><equipe>TYPES</equipe><author><e>Galmiche, Didier</e><e>Notin, Jean-Marc</e></author><title>Connection-based proof construction in Non-Commutative Logic</title><booktitle>{10th International Conference on Logic for Programming Artificial Intelligence and Reasoning 2003 - LPAR'03, Almaty, Kazakhstan}</booktitle><year>2003</year><volume>2850</volume><series>Lecture Notes in Computer Science</series><pages>422 - 436</pages><month>Sep</month><publisher>Springer Verlag</publisher><keywords><e>linear logic</e><e>non-commutative logic</e><e>connection method</e><e>labels</e><e>constraints</e></keywords><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.</abstract></BibTex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Crin/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003944 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Crin/Curation/biblio.hfd -nk 003944 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Crin
|étape= Curation
|type= RBID
|clé= CRIN:galmiche03b
|texte= Connection-based proof construction in Non-Commutative Logic
}}
| This area was generated with Dilib version V0.6.33. |  |