This HTML5 document contains 36 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n17http://localhost/temp/predkladatel/
n16http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n5http://linked.opendata.cz/ontology/domain/vavai/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n7http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n14http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F06%3A00124026%21RIV10-MSM-21230___/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n11http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F06%3A00124026%21RIV10-MSM-21230___
rdf:type
n5:Vysledek skos:Concept
dcterms:description
Every finitary endofunctor H of Set can be represented via a finitary signature Sigma and a collection of equations called %22basic%22. We describe a terminal coalgebra for Has the terminal Sigma-coalgebra (of all E-trees) modulo the congruence of applying the basic equations potentially infinitely often. As an application we describe a free iterative theory on H (in the sense of Calvin Elgot) as the theory of all rational E-trees modulo the analogous congruence. This yields a number of new examples of iterative theories, e.g., the theory of all strongly extensional, rational, finitely branching trees, free on the finite power-set functor, or the theory of all binary, rational unordered trees, free on one commutative binary operation. (c) 2006 Elsevier Inc. All rights reserved. Every finitary endofunctor H of Set can be represented via a finitary signature Sigma and a collection of equations called %22basic%22. We describe a terminal coalgebra for Has the terminal Sigma-coalgebra (of all E-trees) modulo the congruence of applying the basic equations potentially infinitely often. As an application we describe a free iterative theory on H (in the sense of Calvin Elgot) as the theory of all rational E-trees modulo the analogous congruence. This yields a number of new examples of iterative theories, e.g., the theory of all strongly extensional, rational, finitely branching trees, free on the finite power-set functor, or the theory of all binary, rational unordered trees, free on one commutative binary operation. (c) 2006 Elsevier Inc. All rights reserved.
dcterms:title
Terminal Coalgebras and Free Iterative Theories Terminal Coalgebras and Free Iterative Theories
skos:prefLabel
Terminal Coalgebras and Free Iterative Theories Terminal Coalgebras and Free Iterative Theories
skos:notation
RIV/68407700:21230/06:00124026!RIV10-MSM-21230___
n3:aktivita
n4:V
n3:aktivity
V
n3:cisloPeriodika
7
n3:dodaniDat
n11:2010
n3:domaciTvurceVysledku
n16:5613078
n3:druhVysledku
n9:J
n3:duvernostUdaju
n12:S
n3:entitaPredkladatele
n14:predkladatel
n3:idSjednocenehoVysledku
503481
n3:idVysledku
RIV/68407700:21230/06:00124026
n3:jazykVysledku
n15:eng
n3:klicovaSlova
algebra; Free Iterative Theories
n3:klicoveSlovo
n7:algebra n7:Free%20Iterative%20Theories
n3:kodStatuVydavatele
US - Spojené státy americké
n3:kontrolniKodProRIV
[39B254E1CFAB]
n3:nazevZdroje
Information and Computation
n3:obor
n10:BA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
2
n3:rokUplatneniVysledku
n11:2006
n3:svazekPeriodika
204
n3:tvurceVysledku
Adámek, Jiří
n3:wos
000238782700005
s:issn
0890-5401
s:numberOfPages
34
n17:organizacniJednotka
21230