InforLorV4, PascalFrancis, Corpus, bibRecord, 000B00

From multiple sequent for additive linear logic to decision procedures for free lattices

Identifieur interne : 000B00 ( PascalFrancis/Corpus ); précédent : 000A99; suivant : 000B01

From multiple sequent for additive linear logic to decision procedures for free lattices

Auteurs : J.-Y. Marion

Source :

Theoretical computer science [ 0304-3975 ] ; 1999.

RBID : Pascal:99-0463969

Descripteurs français

Pascal (Inist)
- Complexité calcul, Logique mathématique, Calcul propositionnel, Logique propositionnelle, Treillis, Théorie décision.

English descriptors

KwdEn :
- Computational complexity, Decision theory, Lattice, Mathematical logic, Propositional calculus, Propositional logic.

Abstract

The additive fragment of linear logic is complete for general (nondistributive) 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.

Notice en format standard (ISO 2709)

Pour connaître la documentation sur le format Inist Standard.

A01	`01`	`1`		`@0 0304-3975`
A02	`01`			`@0 TCSCDI`
A03		`1`		`@0 Theor. comput. sci.`
A05				`@2 224`
A06				`@2 1-2`
A08	`01`	`1`	`ENG`	`@1 From multiple sequent for additive linear logic to decision procedures for free lattices`
A09	`01`	`1`	`ENG`	`@1 Logical Foundations of Computer Science`
A11	`01`	`1`		`@1 MARION (J.-Y.)`
A12	`01`	`1`		`@1 ADIAN (Sergei I.) @9 ed.`
A14	`01`			`@1 Universitè Nancy 2, Loria, Projet Calligramme, Campus Scientifique - B.P. 239 @2 54506 Vandoeuvre-lès-Nancy @3 FRA @Z 1 aut.`
A18	`01`	`1`		`@1 Yaroslavl University @3 RUS @9 patr.`
A18	`02`	`1`		`@1 Steklov Mathematical Institute @2 Moscow @3 RUS @9 patr.`
A18	`03`	`1`		`@1 Cornell University @2 Ithaca, NY 14853 @3 USA @9 patr.`
A20				`@1 157-172`
A21				`@1 1999`
A23	`01`			`@0 ENG`
A43	`01`			`@1 INIST @2 17243 @5 354000089524500080`
A44				`@0 0000 @1 © 1999 INIST-CNRS. All rights reserved.`
A45				`@0 17 ref.`
A47	`01`	`1`		`@0 99-0463969`
A60				`@1 P @2 C`
A61				`@0 A`
A64	`01`	`1`		`@0 Theoretical computer science`
A66	`01`			`@0 NLD`
C01	`01`		`ENG`	`@0 The additive fragment of linear logic is complete for general (nondistributive) 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.`
C02	`01`	`X`		`@0 001D02A05`
C03	`01`	`X`	`FRE`	`@0 Complexité calcul @5 01`
C03	`01`	`X`	`ENG`	`@0 Computational complexity @5 01`
C03	`01`	`X`	`SPA`	`@0 Complejidad computación @5 01`
C03	`02`	`X`	`FRE`	`@0 Logique mathématique @5 02`
C03	`02`	`X`	`ENG`	`@0 Mathematical logic @5 02`
C03	`02`	`X`	`SPA`	`@0 Lógica matemática @5 02`
C03	`03`	`X`	`FRE`	`@0 Calcul propositionnel @5 03`
C03	`03`	`X`	`ENG`	`@0 Propositional calculus @5 03`
C03	`03`	`X`	`SPA`	`@0 Cálculo proposicional @5 03`
C03	`04`	`X`	`FRE`	`@0 Logique propositionnelle @5 04`
C03	`04`	`X`	`ENG`	`@0 Propositional logic @5 04`
C03	`04`	`X`	`SPA`	`@0 Lógica proposicional @5 04`
C03	`05`	`X`	`FRE`	`@0 Treillis @5 05`
C03	`05`	`X`	`ENG`	`@0 Lattice @5 05`
C03	`05`	`X`	`SPA`	`@0 Enrejado @5 05`
C03	`06`	`X`	`FRE`	`@0 Théorie décision @5 06`
C03	`06`	`X`	`ENG`	`@0 Decision theory @5 06`
C03	`06`	`X`	`SPA`	`@0 Teoría decisión @5 06`
N21				`@1 298`

A30	`01`	`1`	`ENG`	`@1 LFCS'97 International Symposium on Logical Foundations of Computer Science @2 4 @3 Yaroslavl RUS @4 1997-07-06`

Format Inist (serveur)

NO :	PASCAL 99-0463969 INIST
ET :	From multiple sequent for additive linear logic to decision procedures for free lattices
AU :	MARION (J.-Y.); ADIAN (Sergei I.)
AF :	Universitè Nancy 2, Loria, Projet Calligramme, Campus Scientifique - B.P. 239/54506 Vandoeuvre-lès-Nancy/France (1 aut.)
DT :	Publication en série; Congrès; Niveau analytique
SO :	Theoretical computer science; ISSN 0304-3975; Coden TCSCDI; Pays-Bas; Da. 1999; Vol. 224; No. 1-2; Pp. 157-172; Bibl. 17 ref.
LA :	Anglais
EA :	The additive fragment of linear logic is complete for general (nondistributive) 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.
CC :	001D02A05
FD :	Complexité calcul; Logique mathématique; Calcul propositionnel; Logique propositionnelle; Treillis; Théorie décision
ED :	Computational complexity; Mathematical logic; Propositional calculus; Propositional logic; Lattice; Decision theory
SD :	Complejidad computación; Lógica matemática; Cálculo proposicional; Lógica proposicional; Enrejado; Teoría decisión
LO :	INIST-17243.354000089524500080
ID :	99-0463969

Links to Exploration step

Pascal:99-0463969

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">From multiple sequent for additive linear logic to decision procedures for free lattices</title>
<author><name sortKey="Marion, J Y" sort="Marion, J Y" uniqKey="Marion J" first="J.-Y." last="Marion">J.-Y. Marion</name>
<affiliation><inist:fA14 i1="01"><s1>Universitè Nancy 2, Loria, Projet Calligramme, Campus Scientifique - B.P. 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">99-0463969</idno>
<date when="1999">1999</date>
<idno type="stanalyst">PASCAL 99-0463969 INIST</idno>
<idno type="RBID">Pascal:99-0463969</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000B00</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">From multiple sequent for additive linear logic to decision procedures for free lattices</title>
<author><name sortKey="Marion, J Y" sort="Marion, J Y" uniqKey="Marion J" first="J.-Y." last="Marion">J.-Y. Marion</name>
<affiliation><inist:fA14 i1="01"><s1>Universitè Nancy 2, Loria, Projet Calligramme, Campus Scientifique - B.P. 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Theoretical computer science</title>
<title level="j" type="abbreviated">Theor. comput. sci.</title>
<idno type="ISSN">0304-3975</idno>
<imprint><date when="1999">1999</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Theoretical computer science</title>
<title level="j" type="abbreviated">Theor. comput. sci.</title>
<idno type="ISSN">0304-3975</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Computational complexity</term>
<term>Decision theory</term>
<term>Lattice</term>
<term>Mathematical logic</term>
<term>Propositional calculus</term>
<term>Propositional logic</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Complexité calcul</term>
<term>Logique mathématique</term>
<term>Calcul propositionnel</term>
<term>Logique propositionnelle</term>
<term>Treillis</term>
<term>Théorie décision</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">The additive fragment of linear logic is complete for general (nondistributive) 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>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0304-3975</s0>
</fA01>
<fA02 i1="01"><s0>TCSCDI</s0>
</fA02>
<fA03 i2="1"><s0>Theor. comput. sci.</s0>
</fA03>
<fA05><s2>224</s2>
</fA05>
<fA06><s2>1-2</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>From multiple sequent for additive linear logic to decision procedures for free lattices</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>Logical Foundations of Computer Science</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>MARION (J.-Y.)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>ADIAN (Sergei I.)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>Universitè Nancy 2, Loria, Projet Calligramme, Campus Scientifique - B.P. 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA18 i1="01" i2="1"><s1>Yaroslavl University</s1>
<s3>RUS</s3>
<s9>patr.</s9>
</fA18>
<fA18 i1="02" i2="1"><s1>Steklov Mathematical Institute</s1>
<s2>Moscow</s2>
<s3>RUS</s3>
<s9>patr.</s9>
</fA18>
<fA18 i1="03" i2="1"><s1>Cornell University</s1>
<s2>Ithaca, NY 14853</s2>
<s3>USA</s3>
<s9>patr.</s9>
</fA18>
<fA20><s1>157-172</s1>
</fA20>
<fA21><s1>1999</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>17243</s2>
<s5>354000089524500080</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 1999 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>17 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>99-0463969</s0>
</fA47>
<fA60><s1>P</s1>
<s2>C</s2>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Theoretical computer science</s0>
</fA64>
<fA66 i1="01"><s0>NLD</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>The additive fragment of linear logic is complete for general (nondistributive) 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.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02A05</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Complexité calcul</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Computational complexity</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Complejidad computación</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Logique mathématique</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Mathematical logic</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Lógica matemática</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Calcul propositionnel</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Propositional calculus</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Cálculo proposicional</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Logique propositionnelle</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Propositional logic</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Lógica proposicional</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Treillis</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Lattice</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Enrejado</s0>
<s5>05</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Théorie décision</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Decision theory</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Teoría decisión</s0>
<s5>06</s5>
</fC03>
<fN21><s1>298</s1>
</fN21>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>LFCS'97 International Symposium on Logical Foundations of Computer Science</s1>
<s2>4</s2>
<s3>Yaroslavl RUS</s3>
<s4>1997-07-06</s4>
</fA30>
</pR>
</standard>
<server><NO>PASCAL 99-0463969 INIST</NO>
<ET>From multiple sequent for additive linear logic to decision procedures for free lattices</ET>
<AU>MARION (J.-Y.); ADIAN (Sergei I.)</AU>
<AF>Universitè Nancy 2, Loria, Projet Calligramme, Campus Scientifique - B.P. 239/54506 Vandoeuvre-lès-Nancy/France (1 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Theoretical computer science; ISSN 0304-3975; Coden TCSCDI; Pays-Bas; Da. 1999; Vol. 224; No. 1-2; Pp. 157-172; Bibl. 17 ref.</SO>
<LA>Anglais</LA>
<EA>The additive fragment of linear logic is complete for general (nondistributive) 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.</EA>
<CC>001D02A05</CC>
<FD>Complexité calcul; Logique mathématique; Calcul propositionnel; Logique propositionnelle; Treillis; Théorie décision</FD>
<ED>Computational complexity; Mathematical logic; Propositional calculus; Propositional logic; Lattice; Decision theory</ED>
<SD>Complejidad computación; Lógica matemática; Cálculo proposicional; Lógica proposicional; Enrejado; Teoría decisión</SD>
<LO>INIST-17243.354000089524500080</LO>
<ID>99-0463969</ID>
</server>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Corpus

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000B00 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000B00 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Corpus
   |type=    RBID
   |clé=     Pascal:99-0463969
   |texte=   From multiple sequent for additive linear logic to decision procedures for free lattices
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

From multiple sequent for additive linear logic to decision procedures for free lattices

From multiple sequent for additive linear logic to decision procedures for free lattices

Source :

Descripteurs français

English descriptors

Abstract

Notice en format standard (ISO 2709)

Format Inist (serveur)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri