Abstract canonical presentations
Identifieur interne : 005623 ( Main/Curation ); précédent : 005622; suivant : 005624Abstract canonical presentations
Auteurs : Nachum Dershowitz [Israël] ; Claude Kirchner [France]Source :
- Theoretical computer science [ 0304-3975 ] ; 2006.
Descripteurs français
- Pascal (Inist)
English descriptors
- KwdEn :
Abstract
Solving goals-like proving properties, deciding word problems or resolving constraints-is much easier with some presentations of the underlying theory than with others. Typically, what have been called "completion processes", in particular in the study of equational logic, involve finding appropriate presentations of a given theory to more easily solve a given class of problems. We provide a general proof-theoretic setting that relies directly on the fundamental concept of "good", that is, normal-form, proofs, itself defined using well-founded orderings on proof objects. This foundational framework allows for abstract definitions of canonical presentations and very general characterizations of saturation and redundancy criteria.
Url:
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000434
- to stream PascalFrancis, to step Curation: Pour aller vers cette notice dans l'étape Curation :000599
- to stream PascalFrancis, to step Checkpoint: Pour aller vers cette notice dans l'étape Curation :000411
- to stream Main, to step Merge: Pour aller vers cette notice dans l'étape Curation :005816
- to stream Hal, to step Corpus: Pour aller vers cette notice dans l'étape Curation :006A51
- to stream Hal, to step Curation: Pour aller vers cette notice dans l'étape Curation :006A51
- to stream Hal, to step Checkpoint: Pour aller vers cette notice dans l'étape Curation :004178
- to stream Main, to step Merge: Pour aller vers cette notice dans l'étape Curation :005391
Links to Exploration step
Pascal:06-0371738Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Abstract canonical presentations</title><author><name sortKey="Dershowitz, Nachum" sort="Dershowitz, Nachum" uniqKey="Dershowitz N" first="Nachum" last="Dershowitz">Nachum Dershowitz</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>School of Computer Science, Tel Aviv University, P.O. Box 39040, RamatAviv</s1><s2>Tel Aviv 69978</s2><s3>ISR</s3><sZ>1 aut.</sZ></inist:fA14><country>Israël</country><wicri:noRegion>Tel Aviv 69978</wicri:noRegion></affiliation></author><author><name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name><affiliation wicri:level="3"><inist:fA14 i1="02"><s1>JNRJA & LORIA, 615, rue du Jardin Botanique, B.P 101</s1><s2>54602 WIers-les-Nancy</s2><s3>FRA</s3><sZ>2 aut.</sZ></inist:fA14><country>France</country><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">WIers-les-Nancy</settlement></placeName></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">06-0371738</idno><date when="2006">2006</date><idno type="stanalyst">PASCAL 06-0371738 INIST</idno><idno type="RBID">Pascal:06-0371738</idno><idno type="wicri:Area/PascalFrancis/Corpus">000434</idno><idno type="wicri:Area/PascalFrancis/Curation">000599</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000411</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000411</idno><idno type="wicri:doubleKey">0304-3975:2006:Dershowitz N:abstract:canonical:presentations</idno><idno type="wicri:Area/Main/Merge">005816</idno><idno type="wicri:source">HAL</idno><idno type="RBID">Hal:inria-00121760</idno><idno type="url">https://hal.inria.fr/inria-00121760</idno><idno type="wicri:Area/Hal/Corpus">006A51</idno><idno type="wicri:Area/Hal/Curation">006A51</idno><idno type="wicri:Area/Hal/Checkpoint">004178</idno><idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">004178</idno><idno type="wicri:doubleKey">0304-3975:2006:Dershowitz N:abstract:canonical:presentations</idno><idno type="wicri:Area/Main/Merge">005391</idno><idno type="wicri:Area/Main/Curation">005623</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Abstract canonical presentations</title><author><name sortKey="Dershowitz, Nachum" sort="Dershowitz, Nachum" uniqKey="Dershowitz N" first="Nachum" last="Dershowitz">Nachum Dershowitz</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>School of Computer Science, Tel Aviv University, P.O. Box 39040, RamatAviv</s1><s2>Tel Aviv 69978</s2><s3>ISR</s3><sZ>1 aut.</sZ></inist:fA14><country>Israël</country><wicri:noRegion>Tel Aviv 69978</wicri:noRegion></affiliation></author><author><name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name><affiliation wicri:level="3"><inist:fA14 i1="02"><s1>JNRJA & LORIA, 615, rue du Jardin Botanique, B.P 101</s1><s2>54602 WIers-les-Nancy</s2><s3>FRA</s3><sZ>2 aut.</sZ></inist:fA14><country>France</country><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">WIers-les-Nancy</settlement></placeName></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="2006">2006</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>Canonical rewriting</term><term>Canonicity</term><term>Completion</term><term>Computer theory</term><term>Equational logic</term><term>Normal form</term><term>Proof ordering</term><term>Redundancy</term><term>Rewriting</term><term>Saturation</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Complétion</term><term>Forme normale</term><term>Saturation</term><term>Redondance</term><term>Réécriture</term><term>Informatique théorique</term><term>Problème mot</term><term>Logique équationnelle</term><term>Réécriture canonique</term><term>Canonicité</term><term>Relation ordre preuve</term></keywords><keywords scheme="mix" xml:lang="it"><term>abstract canonical presentation</term><term>completion</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Solving goals-like proving properties, deciding word problems or resolving constraints-is much easier with some presentations of the underlying theory than with others. Typically, what have been called "completion processes", in particular in the study of equational logic, involve finding appropriate presentations of a given theory to more easily solve a given class of problems. We provide a general proof-theoretic setting that relies directly on the fundamental concept of "good", that is, normal-form, proofs, itself defined using well-founded orderings on proof objects. This foundational framework allows for abstract definitions of canonical presentations and very general characterizations of saturation and redundancy criteria.</div></front></TEI><double idat="0304-3975:2006:Dershowitz N:abstract:canonical:presentations"><INIST><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Abstract canonical presentations</title><author><name sortKey="Dershowitz, Nachum" sort="Dershowitz, Nachum" uniqKey="Dershowitz N" first="Nachum" last="Dershowitz">Nachum Dershowitz</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>School of Computer Science, Tel Aviv University, P.O. Box 39040, RamatAviv</s1><s2>Tel Aviv 69978</s2><s3>ISR</s3><sZ>1 aut.</sZ></inist:fA14><country>Israël</country><wicri:noRegion>Tel Aviv 69978</wicri:noRegion></affiliation></author><author><name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name><affiliation wicri:level="3"><inist:fA14 i1="02"><s1>JNRJA & LORIA, 615, rue du Jardin Botanique, B.P 101</s1><s2>54602 WIers-les-Nancy</s2><s3>FRA</s3><sZ>2 aut.</sZ></inist:fA14><country>France</country><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">WIers-les-Nancy</settlement></placeName></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">06-0371738</idno><date when="2006">2006</date><idno type="stanalyst">PASCAL 06-0371738 INIST</idno><idno type="RBID">Pascal:06-0371738</idno><idno type="wicri:Area/PascalFrancis/Corpus">000434</idno><idno type="wicri:Area/PascalFrancis/Curation">000599</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000411</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000411</idno><idno type="wicri:doubleKey">0304-3975:2006:Dershowitz N:abstract:canonical:presentations</idno><idno type="wicri:Area/Main/Merge">005816</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Abstract canonical presentations</title><author><name sortKey="Dershowitz, Nachum" sort="Dershowitz, Nachum" uniqKey="Dershowitz N" first="Nachum" last="Dershowitz">Nachum Dershowitz</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>School of Computer Science, Tel Aviv University, P.O. Box 39040, RamatAviv</s1><s2>Tel Aviv 69978</s2><s3>ISR</s3><sZ>1 aut.</sZ></inist:fA14><country>Israël</country><wicri:noRegion>Tel Aviv 69978</wicri:noRegion></affiliation></author><author><name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name><affiliation wicri:level="3"><inist:fA14 i1="02"><s1>JNRJA & LORIA, 615, rue du Jardin Botanique, B.P 101</s1><s2>54602 WIers-les-Nancy</s2><s3>FRA</s3><sZ>2 aut.</sZ></inist:fA14><country>France</country><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">WIers-les-Nancy</settlement></placeName></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="2006">2006</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>Canonical rewriting</term><term>Canonicity</term><term>Completion</term><term>Computer theory</term><term>Equational logic</term><term>Normal form</term><term>Proof ordering</term><term>Redundancy</term><term>Rewriting</term><term>Saturation</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Complétion</term><term>Forme normale</term><term>Saturation</term><term>Redondance</term><term>Réécriture</term><term>Informatique théorique</term><term>Problème mot</term><term>Logique équationnelle</term><term>Réécriture canonique</term><term>Canonicité</term><term>Relation ordre preuve</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Solving goals-like proving properties, deciding word problems or resolving constraints-is much easier with some presentations of the underlying theory than with others. Typically, what have been called "completion processes", in particular in the study of equational logic, involve finding appropriate presentations of a given theory to more easily solve a given class of problems. We provide a general proof-theoretic setting that relies directly on the fundamental concept of "good", that is, normal-form, proofs, itself defined using well-founded orderings on proof objects. This foundational framework allows for abstract definitions of canonical presentations and very general characterizations of saturation and redundancy criteria.</div></front></TEI></INIST><HAL><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="it">Abstract canonical presentations</title><author><name sortKey="Dershowitz, Nachum" sort="Dershowitz, Nachum" uniqKey="Dershowitz N" first="Nachum" last="Dershowitz">Nachum Dershowitz</name></author><author><name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name><affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-2360" status="OLD"><idno type="RNSR">199221357D</idno><orgName>Constraints, automatic deduction and software properties proofs</orgName><orgName type="acronym">PROTHEO</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.inria.fr/equipes/protheo</ref></desc><listRelation><relation active="#struct-160" type="direct"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-300291" type="indirect"></relation><relation active="#struct-300292" type="indirect"></relation><relation active="#struct-300293" type="indirect"></relation><relation active="#struct-2496" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName><orgName type="acronym">LORIA</orgName><desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.loria.fr</ref></desc><listRelation><relation name="UMR7503" active="#struct-441569" type="direct"></relation><relation active="#struct-300009" type="direct"></relation><relation active="#struct-300291" type="direct"></relation><relation active="#struct-300292" type="direct"></relation><relation active="#struct-300293" type="direct"></relation></listRelation></org></tutelle><tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno><idno type="IdRef">02636817X</idno><orgName>Centre National de la Recherche Scientifique</orgName><orgName type="acronym">CNRS</orgName><date type="start">1939-10-19</date><desc><address><country key="FR"></country></address><ref type="url">http://www.cnrs.fr/</ref></desc></org></tutelle><tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName><orgName type="acronym">Inria</orgName><desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/en/</ref></desc></org></tutelle><tutelle active="#struct-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName><orgName type="acronym">UHP</orgName><date type="end">2011-12-31</date><desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName><date type="end">2011-12-31</date><desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName><orgName type="acronym">INPL</orgName><date type="end">2011-12-31</date><desc><address><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-2496" type="direct"><org type="laboratory" xml:id="struct-2496" status="OLD"><orgName>INRIA Lorraine</orgName><desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/centre-de-recherche-inria/nancy-grand-est</ref></desc><listRelation><relation active="#struct-300009" type="direct"></relation></listRelation></org></tutelle></tutelles></hal:affiliation><country>France</country><placeName><settlement type="city">Nancy</settlement><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region></placeName><orgName type="university">Université Nancy 2</orgName><orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName><placeName><settlement type="city">Nancy</settlement><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region></placeName><orgName type="university">Institut national polytechnique de Lorraine</orgName><orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">HAL</idno><idno type="RBID">Hal:inria-00121760</idno><idno type="halId">inria-00121760</idno><idno type="halUri">https://hal.inria.fr/inria-00121760</idno><idno type="url">https://hal.inria.fr/inria-00121760</idno><idno type="doi">10.1016/j.tcs.2006.03.012</idno><date when="2006">2006</date><idno type="wicri:Area/Hal/Corpus">006A51</idno><idno type="wicri:Area/Hal/Curation">006A51</idno><idno type="wicri:Area/Hal/Checkpoint">004178</idno><idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">004178</idno><idno type="wicri:doubleKey">0304-3975:2006:Dershowitz N:abstract:canonical:presentations</idno><idno type="wicri:Area/Main/Merge">005391</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="it">Abstract canonical presentations</title><author><name sortKey="Dershowitz, Nachum" sort="Dershowitz, Nachum" uniqKey="Dershowitz N" first="Nachum" last="Dershowitz">Nachum Dershowitz</name></author><author><name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name><affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-2360" status="OLD"><idno type="RNSR">199221357D</idno><orgName>Constraints, automatic deduction and software properties proofs</orgName><orgName type="acronym">PROTHEO</orgName><desc><address><country key="FR"></country></address><ref type="url">http://www.inria.fr/equipes/protheo</ref></desc><listRelation><relation active="#struct-160" type="direct"></relation><relation name="UMR7503" active="#struct-441569" type="indirect"></relation><relation active="#struct-300009" type="indirect"></relation><relation active="#struct-300291" type="indirect"></relation><relation active="#struct-300292" type="indirect"></relation><relation active="#struct-300293" type="indirect"></relation><relation active="#struct-2496" type="direct"></relation></listRelation><tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName><orgName type="acronym">LORIA</orgName><desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.loria.fr</ref></desc><listRelation><relation name="UMR7503" active="#struct-441569" type="direct"></relation><relation active="#struct-300009" type="direct"></relation><relation active="#struct-300291" type="direct"></relation><relation active="#struct-300292" type="direct"></relation><relation active="#struct-300293" type="direct"></relation></listRelation></org></tutelle><tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno><idno type="IdRef">02636817X</idno><orgName>Centre National de la Recherche Scientifique</orgName><orgName type="acronym">CNRS</orgName><date type="start">1939-10-19</date><desc><address><country key="FR"></country></address><ref type="url">http://www.cnrs.fr/</ref></desc></org></tutelle><tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName><orgName type="acronym">Inria</orgName><desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/en/</ref></desc></org></tutelle><tutelle active="#struct-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName><orgName type="acronym">UHP</orgName><date type="end">2011-12-31</date><desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName><date type="end">2011-12-31</date><desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName><orgName type="acronym">INPL</orgName><date type="end">2011-12-31</date><desc><address><country key="FR"></country></address></desc></org></tutelle><tutelle active="#struct-2496" type="direct"><org type="laboratory" xml:id="struct-2496" status="OLD"><orgName>INRIA Lorraine</orgName><desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine><country key="FR"></country></address><ref type="url">http://www.inria.fr/centre-de-recherche-inria/nancy-grand-est</ref></desc><listRelation><relation active="#struct-300009" type="direct"></relation></listRelation></org></tutelle></tutelles></hal:affiliation><country>France</country><placeName><settlement type="city">Nancy</settlement><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region></placeName><orgName type="university">Université Nancy 2</orgName><orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName><placeName><settlement type="city">Nancy</settlement><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region></placeName><orgName type="university">Institut national polytechnique de Lorraine</orgName><orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName></affiliation></author></analytic><idno type="DOI">10.1016/j.tcs.2006.03.012</idno><series><title level="j">Theoretical Computer Science</title><idno type="ISSN">0304-3975</idno><imprint><date type="datePub">2006</date></imprint></series></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="mix" xml:lang="it"><term>abstract canonical presentation</term><term>completion</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Solving goals -- like proving properties, deciding word problems or resolving constraints -- is much easier with some presentations of the underlying theory than with others. Typically, what have been called "completion processes", in particular in the study of equational logic, involve finding appropriate presentations of a given theory to more easily solve a given class of problems. We provide a general proof-theoretic setting that relies directly on the fundamental concept of "good", that is, normal-form, proofs, itself defined using well-founded orderings on proof objects. This foundational framework allows for abstract definitions of canonical presentations and very general characterizations of saturation and redundancy criteria.</div></front></TEI></HAL></double></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 005623 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Curation/biblio.hfd -nk 005623 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Curation
|type= RBID
|clé= Pascal:06-0371738
|texte= Abstract canonical presentations
}}
| This area was generated with Dilib version V0.6.33. |  |