Constructing orders by means of inductive definitions
Identifieur interne : 00AD92 ( Main/Merge ); précédent : 00AD91; suivant : 00AD93Constructing orders by means of inductive definitions
Auteurs : Guillaume Bonfante ; François LamarcheSource :
English descriptors
- KwdEn :
Abstract
We present a class of algebraic theories that are enriched over a novel symmetrical monoidal closed structure on the category of graphs, whose free models are posets that are equipped with an induction principle, which is easily formalized in type theory. We give examples.
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 002501
- to stream Crin, to step Curation: 002501
- to stream Crin, to step Checkpoint: 001F86
Links to Exploration step
CRIN:bonfante99aLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="222">Constructing orders by means of inductive definitions</title>
</titleStmt>
<publicationStmt><idno type="RBID">CRIN:bonfante99a</idno>
<date when="1999" year="1999">1999</date>
<idno type="wicri:Area/Crin/Corpus">002501</idno>
<idno type="wicri:Area/Crin/Curation">002501</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">002501</idno>
<idno type="wicri:Area/Crin/Checkpoint">001F86</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">001F86</idno>
<idno type="wicri:Area/Main/Merge">00AD92</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Constructing orders by means of inductive definitions</title>
<author><name sortKey="Bonfante, Guillaume" sort="Bonfante, Guillaume" uniqKey="Bonfante G" first="Guillaume" last="Bonfante">Guillaume Bonfante</name>
</author>
<author><name sortKey="Lamarche, Francois" sort="Lamarche, Francois" uniqKey="Lamarche F" first="François" last="Lamarche">François Lamarche</name>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>induction</term>
<term>martin lof</term>
<term>orders</term>
<term>ordinals</term>
<term>universal algebra</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en" wicri:score="490">We present a class of algebraic theories that are enriched over a novel symmetrical monoidal closed structure on the category of graphs, whose free models are posets that are equipped with an induction principle, which is easily formalized in type theory. We give examples.</div>
</front>
</TEI>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00AD92 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 00AD92 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Main |étape= Merge |type= RBID |clé= CRIN:bonfante99a |texte= Constructing orders by means of inductive definitions }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |