AustralieFrV1, PascalFrancis, Corpus, bibRecord, 006053

Proof finding algorithms for implicational logics

Identifieur interne : 006053 ( PascalFrancis/Corpus ); précédent : 006052; suivant : 006054

Proof finding algorithms for implicational logics

Auteurs : M. W. Bunder

Source :

Theoretical computer science [ 0304-3975 ] ; 2000.

RBID : Pascal:00-0103711

Descripteurs français

Pascal (Inist)
- Lambda calcul, Programmation logique, Logique combinatoire, Théorie type, Logique implication, Recherche preuve, Logique intuitioniste.

English descriptors

KwdEn :
- Combinatory logic, Implicational logic, Intutionistic logic, Lambda calculus, Logical programming, Proof finding, Type theory.

Abstract

The work in Bunder (Theoret. Comput. Sci. 169 (1996) 3-21) shows that for each one of many implicational logics the set of all lambda terms, that represent proofs in that logic, can be specified. This paper gives, for most of these logics, algorithms which produce, for any given formula, a form of minimal proof within a fixed number of steps or otherwise a guarantee of unprovability. For the remaining logics there are similar algorithms that produce proofs, but not within a fixed number of steps. The new algorithms have been implemented in Oostdijk (Lambda Cal2).

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 232`
A06				`@2 1-2`
A08	`01`	`1`	`ENG`	`@1 Proof finding algorithms for implicational logics`
A09	`01`	`1`	`ENG`	`@1 Proof-search in Type-theoretic Languages`
A11	`01`	`1`		`@1 BUNDER (M. W.)`
A12	`01`	`1`		`@1 GALMICHE (Didier) @9 ed.`
A12	`02`	`1`		`@1 PYM (David J.) @9 ed.`
A14	`01`			`@1 Mathematics Department, University of Wollongong @2 Wollongong, NSW 2522 @3 AUS @Z 1 aut.`
A15	`01`			`@1 LORIA - Université Henri Poincaré, Campus Scientifique, B.P. 239 @2 54506 Vandoeuvre-les-Nancy @3 FRA @Z 1 aut.`
A15	`02`			`@1 Queen Mary & Westfield College, Department of Computer Science, University of London, Mile End Road @2 London, E1 4NS @3 GBR @Z 2 aut.`
A20				`@1 165-186`
A21				`@1 2000`
A23	`01`			`@0 ENG`
A43	`01`			`@1 INIST @2 17243 @5 354000081470930060`
A44				`@0 0000 @1 © 2000 INIST-CNRS. All rights reserved.`
A45				`@0 11 ref.`
A47	`01`	`1`		`@0 00-0103711`
A60				`@1 P`
A61				`@0 A`
A64	`01`	`1`		`@0 Theoretical computer science`
A66	`01`			`@0 NLD`
C01	`01`		`ENG`	@0 The work in Bunder (Theoret. Comput. Sci. 169 (1996) 3-21) shows that for each one of many implicational logics the set of all lambda terms, that represent proofs in that logic, can be specified. This paper gives, for most of these logics, algorithms which produce, for any given formula, a form of minimal proof within a fixed number of steps or otherwise a guarantee of unprovability. For the remaining logics there are similar algorithms that produce proofs, but not within a fixed number of steps. The new algorithms have been implemented in Oostdijk (Lambda Cal2).
C02	`01`	`X`		`@0 001A02A01B`
C02	`02`	`X`		`@0 001A02A01D`
C02	`03`	`X`		`@0 001A02A01F`
C03	`01`	`X`	`FRE`	`@0 Lambda calcul @5 01`
C03	`01`	`X`	`ENG`	`@0 Lambda calculus @5 01`
C03	`01`	`X`	`SPA`	`@0 Lambda cálculo @5 01`
C03	`02`	`X`	`FRE`	`@0 Programmation logique @5 02`
C03	`02`	`X`	`ENG`	`@0 Logical programming @5 02`
C03	`02`	`X`	`SPA`	`@0 Programación lógica @5 02`
C03	`03`	`X`	`FRE`	`@0 Logique combinatoire @5 03`
C03	`03`	`X`	`ENG`	`@0 Combinatory logic @5 03`
C03	`03`	`X`	`SPA`	`@0 Lógica combinatoria @5 03`
C03	`04`	`3`	`FRE`	`@0 Théorie type @5 04`
C03	`04`	`3`	`ENG`	`@0 Type theory @5 04`
C03	`05`	`X`	`FRE`	`@0 Logique implication @4 CD @5 96`
C03	`05`	`X`	`ENG`	`@0 Implicational logic @4 CD @5 96`
C03	`06`	`X`	`FRE`	`@0 Recherche preuve @4 CD @5 97`
C03	`06`	`X`	`ENG`	`@0 Proof finding @4 CD @5 97`
C03	`07`	`X`	`FRE`	`@0 Logique intuitioniste @4 CD @5 98`
C03	`07`	`X`	`ENG`	`@0 Intutionistic logic @4 CD @5 98`
N21				`@1 073`

Format Inist (serveur)

NO :	PASCAL 00-0103711 INIST
ET :	Proof finding algorithms for implicational logics
AU :	BUNDER (M. W.); GALMICHE (Didier); PYM (David J.)
AF :	Mathematics Department, University of Wollongong/Wollongong, NSW 2522/Australie (1 aut.); LORIA - Université Henri Poincaré, Campus Scientifique, B.P. 239/54506 Vandoeuvre-les-Nancy/France (1 aut.); Queen Mary & Westfield College, Department of Computer Science, University of London, Mile End Road/London, E1 4NS/Royaume-Uni (2 aut.)
DT :	Publication en série; Niveau analytique
SO :	Theoretical computer science; ISSN 0304-3975; Coden TCSCDI; Pays-Bas; Da. 2000; Vol. 232; No. 1-2; Pp. 165-186; Bibl. 11 ref.
LA :	Anglais
EA :	The work in Bunder (Theoret. Comput. Sci. 169 (1996) 3-21) shows that for each one of many implicational logics the set of all lambda terms, that represent proofs in that logic, can be specified. This paper gives, for most of these logics, algorithms which produce, for any given formula, a form of minimal proof within a fixed number of steps or otherwise a guarantee of unprovability. For the remaining logics there are similar algorithms that produce proofs, but not within a fixed number of steps. The new algorithms have been implemented in Oostdijk (Lambda Cal2).
CC :	001A02A01B; 001A02A01D; 001A02A01F
FD :	Lambda calcul; Programmation logique; Logique combinatoire; Théorie type; Logique implication; Recherche preuve; Logique intuitioniste
ED :	Lambda calculus; Logical programming; Combinatory logic; Type theory; Implicational logic; Proof finding; Intutionistic logic
SD :	Lambda cálculo; Programación lógica; Lógica combinatoria
LO :	INIST-17243.354000081470930060
ID :	00-0103711

Links to Exploration step

Pascal:00-0103711

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Proof finding algorithms for implicational logics</title>
<author><name sortKey="Bunder, M W" sort="Bunder, M W" uniqKey="Bunder M" first="M. W." last="Bunder">M. W. Bunder</name>
<affiliation><inist:fA14 i1="01"><s1>Mathematics Department, University of Wollongong</s1>
<s2>Wollongong, NSW 2522</s2>
<s3>AUS</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">00-0103711</idno>
<date when="2000">2000</date>
<idno type="stanalyst">PASCAL 00-0103711 INIST</idno>
<idno type="RBID">Pascal:00-0103711</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">006053</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Proof finding algorithms for implicational logics</title>
<author><name sortKey="Bunder, M W" sort="Bunder, M W" uniqKey="Bunder M" first="M. W." last="Bunder">M. W. Bunder</name>
<affiliation><inist:fA14 i1="01"><s1>Mathematics Department, University of Wollongong</s1>
<s2>Wollongong, NSW 2522</s2>
<s3>AUS</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="2000">2000</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>Combinatory logic</term>
<term>Implicational logic</term>
<term>Intutionistic logic</term>
<term>Lambda calculus</term>
<term>Logical programming</term>
<term>Proof finding</term>
<term>Type theory</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Lambda calcul</term>
<term>Programmation logique</term>
<term>Logique combinatoire</term>
<term>Théorie type</term>
<term>Logique implication</term>
<term>Recherche preuve</term>
<term>Logique intuitioniste</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">The work in Bunder (Theoret. Comput. Sci. 169 (1996) 3-21) shows that for each one of many implicational logics the set of all lambda terms, that represent proofs in that logic, can be specified. This paper gives, for most of these logics, algorithms which produce, for any given formula, a form of minimal proof within a fixed number of steps or otherwise a guarantee of unprovability. For the remaining logics there are similar algorithms that produce proofs, but not within a fixed number of steps. The new algorithms have been implemented in Oostdijk (Lambda Cal2).</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>232</s2>
</fA05>
<fA06><s2>1-2</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>Proof finding algorithms for implicational logics</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>Proof-search in Type-theoretic Languages</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>BUNDER (M. W.)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>GALMICHE (Didier)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>PYM (David J.)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>Mathematics Department, University of Wollongong</s1>
<s2>Wollongong, NSW 2522</s2>
<s3>AUS</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA15 i1="01"><s1>LORIA - Université Henri Poincaré, Campus Scientifique, B.P. 239</s1>
<s2>54506 Vandoeuvre-les-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA15>
<fA15 i1="02"><s1>Queen Mary & Westfield College, Department of Computer Science, University of London, Mile End Road</s1>
<s2>London, E1 4NS</s2>
<s3>GBR</s3>
<sZ>2 aut.</sZ>
</fA15>
<fA20><s1>165-186</s1>
</fA20>
<fA21><s1>2000</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>17243</s2>
<s5>354000081470930060</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2000 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>11 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>00-0103711</s0>
</fA47>
<fA60><s1>P</s1>
</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 work in Bunder (Theoret. Comput. Sci. 169 (1996) 3-21) shows that for each one of many implicational logics the set of all lambda terms, that represent proofs in that logic, can be specified. This paper gives, for most of these logics, algorithms which produce, for any given formula, a form of minimal proof within a fixed number of steps or otherwise a guarantee of unprovability. For the remaining logics there are similar algorithms that produce proofs, but not within a fixed number of steps. The new algorithms have been implemented in Oostdijk (Lambda Cal2).</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001A02A01B</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001A02A01D</s0>
</fC02>
<fC02 i1="03" i2="X"><s0>001A02A01F</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Lambda calcul</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Lambda calculus</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Lambda cálculo</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Programmation logique</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Logical programming</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Programación lógica</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Logique combinatoire</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Combinatory logic</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Lógica combinatoria</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="3" l="FRE"><s0>Théorie type</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="3" l="ENG"><s0>Type theory</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Logique implication</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Implicational logic</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Recherche preuve</s0>
<s4>CD</s4>
<s5>97</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Proof finding</s0>
<s4>CD</s4>
<s5>97</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Logique intuitioniste</s0>
<s4>CD</s4>
<s5>98</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Intutionistic logic</s0>
<s4>CD</s4>
<s5>98</s5>
</fC03>
<fN21><s1>073</s1>
</fN21>
</pA>
</standard>
<server><NO>PASCAL 00-0103711 INIST</NO>
<ET>Proof finding algorithms for implicational logics</ET>
<AU>BUNDER (M. W.); GALMICHE (Didier); PYM (David J.)</AU>
<AF>Mathematics Department, University of Wollongong/Wollongong, NSW 2522/Australie (1 aut.); LORIA - Université Henri Poincaré, Campus Scientifique, B.P. 239/54506 Vandoeuvre-les-Nancy/France (1 aut.); Queen Mary & Westfield College, Department of Computer Science, University of London, Mile End Road/London, E1 4NS/Royaume-Uni (2 aut.)</AF>
<DT>Publication en série; Niveau analytique</DT>
<SO>Theoretical computer science; ISSN 0304-3975; Coden TCSCDI; Pays-Bas; Da. 2000; Vol. 232; No. 1-2; Pp. 165-186; Bibl. 11 ref.</SO>
<LA>Anglais</LA>
<EA>The work in Bunder (Theoret. Comput. Sci. 169 (1996) 3-21) shows that for each one of many implicational logics the set of all lambda terms, that represent proofs in that logic, can be specified. This paper gives, for most of these logics, algorithms which produce, for any given formula, a form of minimal proof within a fixed number of steps or otherwise a guarantee of unprovability. For the remaining logics there are similar algorithms that produce proofs, but not within a fixed number of steps. The new algorithms have been implemented in Oostdijk (Lambda Cal2).</EA>
<CC>001A02A01B; 001A02A01D; 001A02A01F</CC>
<FD>Lambda calcul; Programmation logique; Logique combinatoire; Théorie type; Logique implication; Recherche preuve; Logique intuitioniste</FD>
<ED>Lambda calculus; Logical programming; Combinatory logic; Type theory; Implicational logic; Proof finding; Intutionistic logic</ED>
<SD>Lambda cálculo; Programación lógica; Lógica combinatoria</SD>
<LO>INIST-17243.354000081470930060</LO>
<ID>00-0103711</ID>
</server>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Asie/explor/AustralieFrV1/Data/PascalFrancis/Corpus

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

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

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

{{Explor lien
   |wiki=    Wicri/Asie
   |area=    AustralieFrV1
   |flux=    PascalFrancis
   |étape=   Corpus
   |type=    RBID
   |clé=     Pascal:00-0103711
   |texte=   Proof finding algorithms for implicational logics
}}

This area was generated with Dilib version V0.6.33.
Data generation: Tue Dec 5 10:43:12 2017. Site generation: Tue Mar 5 14:07:20 2024

	Serveur d'exploration sur les relations entre la France et l'Australie
	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 les relations entre la France et l'Australie

Proof finding algorithms for implicational logics

Proof finding algorithms for implicational logics

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