From multiple sequent for Additive Linear Logic to decision procedures for Free Lattices
Identifieur interne : 00AB38 ( Main/Merge ); précédent : 00AB37; suivant : 00AB39From multiple sequent for Additive Linear Logic to decision procedures for Free Lattices
Auteurs : Jean-Yves MarionSource :
- Theoretical Computer Science - TCS ; 1999.
English descriptors
Abstract
The additive fragment of linear logic is complete for general (non-distributive) lattices. A sequent calculus for general lattices is presented with multiple antecedents and succedents. This construction is extended to give a sequent calculus for propositional linear logic with both additive and multiplicative contexts. Then, various decision procedures are investigated for general lattices.
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 002476
- to stream Crin, to step Curation: 002476
- to stream Crin, to step Checkpoint: 001D32
Links to Exploration step
CRIN:marion99aLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="93">From multiple sequent for Additive Linear Logic to decision procedures for Free Lattices</title>
</titleStmt>
<publicationStmt><idno type="RBID">CRIN:marion99a</idno>
<date when="1999" year="1999">1999</date>
<idno type="wicri:Area/Crin/Corpus">002476</idno>
<idno type="wicri:Area/Crin/Curation">002476</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">002476</idno>
<idno type="wicri:Area/Crin/Checkpoint">001D32</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">001D32</idno>
<idno type="wicri:Area/Main/Merge">00AB38</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">From multiple sequent for Additive Linear Logic to decision procedures for Free Lattices</title>
<author><name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name>
</author>
</analytic>
<series><title level="j">Theoretical Computer Science - TCS</title>
<imprint><date when="1999" type="published">1999</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>additive linear logic</term>
<term>decision procedure</term>
<term>free lattices</term>
<term>sequent calculus</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en" wicri:score="1169">The additive fragment of linear logic is complete for general (non-distributive) lattices. A sequent calculus for general lattices is presented with multiple antecedents and succedents. This construction is extended to give a sequent calculus for propositional linear logic with both additive and multiplicative contexts. Then, various decision procedures are investigated for general lattices.</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 00AB38 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 00AB38 | 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é= CRIN:marion99a |texte= From multiple sequent for Additive Linear Logic to decision procedures for Free Lattices }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |