InforLorV4, PascalFrancis, Corpus, bibRecord, 000782

Binding logic: Proofs and models

Identifieur interne : 000782 ( PascalFrancis/Corpus ); précédent : 000781; suivant : 000783

Binding logic: Proofs and models

Auteurs : Gilles Dowek ; Thérèse Hardin ; Claude Kirchner

Source :

Lecture notes in computer science [ 0302-9743 ] ; 2002.

RBID : Pascal:03-0334101

Descripteurs français

Pascal (Inist)
- Complétude, Codage, Logique ordre 1, Consistance sémantique, Modèle logique, Binding logic.

English descriptors

KwdEn :
- Coding, Completeness, First order logic, Logic model, Soundness.

Abstract

We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. This theorem is obtained by encoding this logic back into predicate logic and using the classical soundness and completeness theorem there.

Notice en format standard (ISO 2709)

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

A01	`01`	`1`		`@0 0302-9743`
A05				`@2 2514`
A08	`01`	`1`	`ENG`	`@1 Binding logic: Proofs and models`
A09	`01`	`1`	`ENG`	`@1 LPAR 2002 : logic for programming, artificial intelligence, and reasoning : Tbilisi, 14-18 October 2002`
A11	`01`	`1`		`@1 DOWEK (Gilles)`
A11	`02`	`1`		`@1 HARDIN (Thérèse)`
A11	`03`	`1`		`@1 KIRCHNER (Claude)`
A12	`01`	`1`		`@1 BAAZ (Matthias) @9 ed.`
A12	`02`	`1`		`@1 VORONKOV (Andrei) @9 ed.`
A14	`01`			`@1 INRIA-Rocquencourt, B.P. 105 @2 78153 Le Chesnay @3 FRA @Z 1 aut.`
A14	`02`			`@1 LIP6, UPMC, 8 Rue du Capitaine Scott @2 75015 Paris @3 FRA @Z 2 aut.`
A14	`03`			`@1 LORIA & INRIA, 615, rue du Jardin Botanique @2 54600 Villers-lès-Nancy @3 FRA @Z 3 aut.`
A20				`@1 130-144`
A21				`@1 2002`
A23	`01`			`@0 ENG`
A26	`01`			`@0 3-540-00010-0`
A43	`01`			`@1 INIST @2 16343 @5 354000108488370090`
A44				`@0 0000 @1 © 2003 INIST-CNRS. All rights reserved.`
A45				`@0 22 ref.`
A47	`01`	`1`		`@0 03-0334101`
A60				`@1 P @2 C`
A61				`@0 A`
A64	`01`	`1`		`@0 Lecture notes in computer science`
A66	`01`			`@0 DEU`
C01	`01`		`ENG`	`@0 We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. This theorem is obtained by encoding this logic back into predicate logic and using the classical soundness and completeness theorem there.`
C02	`01`	`X`		`@0 001D02A02`
C03	`01`	`X`	`FRE`	`@0 Complétude @5 01`
C03	`01`	`X`	`ENG`	`@0 Completeness @5 01`
C03	`01`	`X`	`SPA`	`@0 Completitud @5 01`
C03	`02`	`X`	`FRE`	`@0 Codage @5 02`
C03	`02`	`X`	`ENG`	`@0 Coding @5 02`
C03	`02`	`X`	`SPA`	`@0 Codificación @5 02`
C03	`03`	`X`	`FRE`	`@0 Logique ordre 1 @5 03`
C03	`03`	`X`	`ENG`	`@0 First order logic @5 03`
C03	`03`	`X`	`SPA`	`@0 Lógica orden 1 @5 03`
C03	`04`	`X`	`FRE`	`@0 Consistance sémantique @5 04`
C03	`04`	`X`	`ENG`	`@0 Soundness @5 04`
C03	`04`	`X`	`SPA`	`@0 Consistencia semantica @5 04`
C03	`05`	`X`	`FRE`	`@0 Modèle logique @5 05`
C03	`05`	`X`	`ENG`	`@0 Logic model @5 05`
C03	`05`	`X`	`SPA`	`@0 Modelo lógico @5 05`
C03	`06`	`X`	`FRE`	`@0 Binding logic @4 INC @5 82`
N21				`@1 230`
N82				`@1 PSI`

A30	`01`	`1`	`ENG`	`@1 International conference on logic for programming, artificial intelligence, and reasoning @2 9 @3 Tbilisi GEO @4 2002-10-14`

Format Inist (serveur)

NO :	PASCAL 03-0334101 INIST
ET :	Binding logic: Proofs and models
AU :	DOWEK (Gilles); HARDIN (Thérèse); KIRCHNER (Claude); BAAZ (Matthias); VORONKOV (Andrei)
AF :	INRIA-Rocquencourt, B.P. 105/78153 Le Chesnay/France (1 aut.); LIP6, UPMC, 8 Rue du Capitaine Scott/75015 Paris/France (2 aut.); LORIA & INRIA, 615, rue du Jardin Botanique/54600 Villers-lès-Nancy/France (3 aut.)
DT :	Publication en série; Congrès; Niveau analytique
SO :	Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2002; Vol. 2514; Pp. 130-144; Bibl. 22 ref.
LA :	Anglais
EA :	We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. This theorem is obtained by encoding this logic back into predicate logic and using the classical soundness and completeness theorem there.
CC :	001D02A02
FD :	Complétude; Codage; Logique ordre 1; Consistance sémantique; Modèle logique; Binding logic
ED :	Completeness; Coding; First order logic; Soundness; Logic model
SD :	Completitud; Codificación; Lógica orden 1; Consistencia semantica; Modelo lógico
LO :	INIST-16343.354000108488370090
ID :	03-0334101

Links to Exploration step

Pascal:03-0334101

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Binding logic: Proofs and models</title>
<author><name sortKey="Dowek, Gilles" sort="Dowek, Gilles" uniqKey="Dowek G" first="Gilles" last="Dowek">Gilles Dowek</name>
<affiliation><inist:fA14 i1="01"><s1>INRIA-Rocquencourt, B.P. 105</s1>
<s2>78153 Le Chesnay</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Hardin, Therese" sort="Hardin, Therese" uniqKey="Hardin T" first="Thérèse" last="Hardin">Thérèse Hardin</name>
<affiliation><inist:fA14 i1="02"><s1>LIP6, UPMC, 8 Rue du Capitaine Scott</s1>
<s2>75015 Paris</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name>
<affiliation><inist:fA14 i1="03"><s1>LORIA & INRIA, 615, rue du Jardin Botanique</s1>
<s2>54600 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">03-0334101</idno>
<date when="2002">2002</date>
<idno type="stanalyst">PASCAL 03-0334101 INIST</idno>
<idno type="RBID">Pascal:03-0334101</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000782</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Binding logic: Proofs and models</title>
<author><name sortKey="Dowek, Gilles" sort="Dowek, Gilles" uniqKey="Dowek G" first="Gilles" last="Dowek">Gilles Dowek</name>
<affiliation><inist:fA14 i1="01"><s1>INRIA-Rocquencourt, B.P. 105</s1>
<s2>78153 Le Chesnay</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Hardin, Therese" sort="Hardin, Therese" uniqKey="Hardin T" first="Thérèse" last="Hardin">Thérèse Hardin</name>
<affiliation><inist:fA14 i1="02"><s1>LIP6, UPMC, 8 Rue du Capitaine Scott</s1>
<s2>75015 Paris</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name>
<affiliation><inist:fA14 i1="03"><s1>LORIA & INRIA, 615, rue du Jardin Botanique</s1>
<s2>54600 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2002">2002</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>Coding</term>
<term>Completeness</term>
<term>First order logic</term>
<term>Logic model</term>
<term>Soundness</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Complétude</term>
<term>Codage</term>
<term>Logique ordre 1</term>
<term>Consistance sémantique</term>
<term>Modèle logique</term>
<term>Binding logic</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. This theorem is obtained by encoding this logic back into predicate logic and using the classical soundness and completeness theorem there.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>2514</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>Binding logic: Proofs and models</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>LPAR 2002 : logic for programming, artificial intelligence, and reasoning : Tbilisi, 14-18 October 2002</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>DOWEK (Gilles)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>HARDIN (Thérèse)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>KIRCHNER (Claude)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>BAAZ (Matthias)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>VORONKOV (Andrei)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>INRIA-Rocquencourt, B.P. 105</s1>
<s2>78153 Le Chesnay</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>LIP6, UPMC, 8 Rue du Capitaine Scott</s1>
<s2>75015 Paris</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA14 i1="03"><s1>LORIA & INRIA, 615, rue du Jardin Botanique</s1>
<s2>54600 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</fA14>
<fA20><s1>130-144</s1>
</fA20>
<fA21><s1>2002</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA26 i1="01"><s0>3-540-00010-0</s0>
</fA26>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000108488370090</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2003 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>22 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>03-0334101</s0>
</fA47>
<fA60><s1>P</s1>
<s2>C</s2>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0>
</fA64>
<fA66 i1="01"><s0>DEU</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. This theorem is obtained by encoding this logic back into predicate logic and using the classical soundness and completeness theorem there.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02A02</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Complétude</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Completeness</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Completitud</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Codage</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Coding</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Codificación</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Logique ordre 1</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>First order logic</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Lógica orden 1</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Consistance sémantique</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Soundness</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Consistencia semantica</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Modèle logique</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Logic model</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Modelo lógico</s0>
<s5>05</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Binding logic</s0>
<s4>INC</s4>
<s5>82</s5>
</fC03>
<fN21><s1>230</s1>
</fN21>
<fN82><s1>PSI</s1>
</fN82>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>International conference on logic for programming, artificial intelligence, and reasoning</s1>
<s2>9</s2>
<s3>Tbilisi GEO</s3>
<s4>2002-10-14</s4>
</fA30>
</pR>
</standard>
<server><NO>PASCAL 03-0334101 INIST</NO>
<ET>Binding logic: Proofs and models</ET>
<AU>DOWEK (Gilles); HARDIN (Thérèse); KIRCHNER (Claude); BAAZ (Matthias); VORONKOV (Andrei)</AU>
<AF>INRIA-Rocquencourt, B.P. 105/78153 Le Chesnay/France (1 aut.); LIP6, UPMC, 8 Rue du Capitaine Scott/75015 Paris/France (2 aut.); LORIA & INRIA, 615, rue du Jardin Botanique/54600 Villers-lès-Nancy/France (3 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2002; Vol. 2514; Pp. 130-144; Bibl. 22 ref.</SO>
<LA>Anglais</LA>
<EA>We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. This theorem is obtained by encoding this logic back into predicate logic and using the classical soundness and completeness theorem there.</EA>
<CC>001D02A02</CC>
<FD>Complétude; Codage; Logique ordre 1; Consistance sémantique; Modèle logique; Binding logic</FD>
<ED>Completeness; Coding; First order logic; Soundness; Logic model</ED>
<SD>Completitud; Codificación; Lógica orden 1; Consistencia semantica; Modelo lógico</SD>
<LO>INIST-16343.354000108488370090</LO>
<ID>03-0334101</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 000782 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000782 | 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:03-0334101
   |texte=   Binding logic: Proofs and models
}}

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

Binding logic: Proofs and models

Binding logic: Proofs and models

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