A semantic characterisation of the correctness of a proof net
Identifieur interne : 002032 ( Crin/Curation ); précédent : 002031; suivant : 002033A semantic characterisation of the correctness of a proof net
Auteurs : Christian RetoreSource :
- Mathematical Structures in Computer Science ; 1997.
English descriptors
- KwdEn :
Abstract
The purpose of this note is to show that the correctness of a multiplicative proof net with mix is equivalent to its semantical correctness : a proof structure is a proof net if and only if its semantical interpretation is a clique, where one given finite coherence space interprets all the propositional variables. This is just an example of what can be done with these kinds of semantic techniques ; for more information and further results the reader is referred to Retore 94 (= INRIA RR-2430).
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: Pour aller vers cette notice dans l'étape Curation :002032
Links to Exploration step
CRIN:retore97aLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="234">A semantic characterisation of the correctness of a proof net</title>
</titleStmt>
<publicationStmt><idno type="RBID">CRIN:retore97a</idno>
<date when="1997" year="1997">1997</date>
<idno type="wicri:Area/Crin/Corpus">002032</idno>
<idno type="wicri:Area/Crin/Curation">002032</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">002032</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">A semantic characterisation of the correctness of a proof net</title>
<author><name sortKey="Retore, Christian" sort="Retore, Christian" uniqKey="Retore C" first="Christian" last="Retore">Christian Retore</name>
</author>
</analytic>
<series><title level="j">Mathematical Structures in Computer Science</title>
<imprint><date when="1997" type="published">1997</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Denotational semantics</term>
<term>Logic</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en" wicri:score="971">The purpose of this note is to show that the correctness of a multiplicative proof net with mix is equivalent to its semantical correctness : a proof structure is a proof net if and only if its semantical interpretation is a clique, where one given finite coherence space interprets all the propositional variables. This is just an example of what can be done with these kinds of semantic techniques ; for more information and further results the reader is referred to Retore 94 (= INRIA RR-2430).</div>
</front>
</TEI>
<BibTex type="article"><ref>retore97a</ref>
<crinnumber>97-R-339</crinnumber>
<category>1</category>
<equipe>CALLIGRAMME</equipe>
<author><e>Retore, Christian</e>
</author>
<title>A semantic characterisation of the correctness of a proof net</title>
<journal>Mathematical Structures in Computer Science</journal>
<year>1997</year>
<volume>7</volume>
<number>5</number>
<pages>445-452</pages>
<month>{0ct}</month>
<keywords><e>Logic</e>
<e>Denotational semantics</e>
</keywords>
<abstract>The purpose of this note is to show that the correctness of a multiplicative proof net with mix is equivalent to its semantical correctness : a proof structure is a proof net if and only if its semantical interpretation is a clique, where one given finite coherence space interprets all the propositional variables. This is just an example of what can be done with these kinds of semantic techniques ; for more information and further results the reader is referred to Retore 94 (= INRIA RR-2430).</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 002032 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Crin/Curation/biblio.hfd -nk 002032 | 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:retore97a |texte= A semantic characterisation of the correctness of a proof net }}
This area was generated with Dilib version V0.6.33. |