Connection-based proof construction in non-commutative logic
Identifieur interne : 007F76 ( Main/Merge ); précédent : 007F75; suivant : 007F77Connection-based proof construction in non-commutative logic
Auteurs : D. Galmiche [France] ; J.-M. Notin [France]Source :
- Lecture notes in computer science [ 0302-9743 ] ; 2003.
Descripteurs français
- Pascal (Inist)
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 PascalFrancis, to step Corpus: 000698
- to stream PascalFrancis, to step Curation: 000343
- to stream PascalFrancis, to step Checkpoint: 000717
Links to Exploration step
Pascal:04-0200594Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">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"><inist:fA14 i1="01"><s1>LORIA - Université Henri Poincaré</s1><s2>54506 Vandœuvre-lès-Nancy</s2><s3>FRA</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></inist:fA14><country>France</country><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></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"><inist:fA14 i1="01"><s1>LORIA - Université Henri Poincaré</s1><s2>54506 Vandœuvre-lès-Nancy</s2><s3>FRA</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></inist:fA14><country>France</country><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></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">04-0200594</idno><date when="2003">2003</date><idno type="stanalyst">PASCAL 04-0200594 INIST</idno><idno type="RBID">Pascal:04-0200594</idno><idno type="wicri:Area/PascalFrancis/Corpus">000698</idno><idno type="wicri:Area/PascalFrancis/Curation">000343</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000717</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000717</idno><idno type="wicri:doubleKey">0302-9743:2003:Galmiche D:connection:based:proof</idno><idno type="wicri:Area/Main/Merge">007F76</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">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"><inist:fA14 i1="01"><s1>LORIA - Université Henri Poincaré</s1><s2>54506 Vandœuvre-lès-Nancy</s2><s3>FRA</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></inist:fA14><country>France</country><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></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"><inist:fA14 i1="01"><s1>LORIA - Université Henri Poincaré</s1><s2>54506 Vandœuvre-lès-Nancy</s2><s3>FRA</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></inist:fA14><country>France</country><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></author></analytic><series><title level="j" type="main">Lecture notes in computer science</title><idno type="ISSN">0302-9743</idno><imprint><date when="2003">2003</date></imprint></series></biblStruct></sourceDesc><seriesStmt><title level="j" type="main">Lecture notes in computer science</title><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Label</term><term>Linear logic</term><term>Logical programming</term><term>Multiplicative logic</term><term>Polarization</term><term>Proof net</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Programmation logique</term><term>Logique linéaire</term><term>Etiquette</term><term>Polarisation</term><term>Logique multiplicative</term><term>Réseau preuve</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">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><affiliations><list><country><li>France</li></country><region><li>Grand Est</li><li>Lorraine (région)</li></region><settlement><li>Vandœuvre-lès-Nancy</li></settlement><orgName><li>Université Henri Poincaré</li></orgName></list><tree><country name="France"><region name="Grand Est"><name sortKey="Galmiche, D" sort="Galmiche, D" uniqKey="Galmiche D" first="D." last="Galmiche">D. Galmiche</name></region><name sortKey="Notin, J M" sort="Notin, J M" uniqKey="Notin J" first="J.-M." last="Notin">J.-M. Notin</name></country></tree></affiliations></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 007F76 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 007F76 | 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é= Pascal:04-0200594
|texte= Connection-based proof construction in non-commutative logic
}}
| This area was generated with Dilib version V0.6.33. |  |