This HTML5 document contains 39 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/
n18http://localhost/temp/predkladatel/
n16http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n15http://linked.opendata.cz/ontology/domain/vavai/
n11http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n17http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F10%3A00160019%21RIV11-MSM-21230___/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n10http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n12http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n9http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F10%3A00160019%21RIV11-MSM-21230___
rdf:type
skos:Concept n15:Vysledek
dcterms:description
Iterative monads were introduced by Calvin Elgot in the 1970's and are those ideal monads in which every guarded system of recursive equations has a unique solution. We prove that every ideal monad M has an iterative reflection, that is, an embedding into an iterative monad with the expected universal property. We also introduce the concept of iterativity for algebras for the monad M, following in the footsteps of Evelyn Nelson and Jerzy Tiuryn, and prove that M is iterative if and only if all free algebras for M are iterative algebras. Iterative monads were introduced by Calvin Elgot in the 1970's and are those ideal monads in which every guarded system of recursive equations has a unique solution. We prove that every ideal monad M has an iterative reflection, that is, an embedding into an iterative monad with the expected universal property. We also introduce the concept of iterativity for algebras for the monad M, following in the footsteps of Evelyn Nelson and Jerzy Tiuryn, and prove that M is iterative if and only if all free algebras for M are iterative algebras.
dcterms:title
Iterative Reflections of Monads Iterative Reflections of Monads
skos:prefLabel
Iterative Reflections of Monads Iterative Reflections of Monads
skos:notation
RIV/68407700:21230/10:00160019!RIV11-MSM-21230___
n3:aktivita
n12:Z
n3:aktivity
Z(MSM6840770014)
n3:cisloPeriodika
3
n3:dodaniDat
n9:2011
n3:domaciTvurceVysledku
n16:1462571
n3:druhVysledku
n7:J
n3:duvernostUdaju
n14:S
n3:entitaPredkladatele
n17:predkladatel
n3:idSjednocenehoVysledku
265059
n3:idVysledku
RIV/68407700:21230/10:00160019
n3:jazykVysledku
n4:eng
n3:klicovaSlova
ALGEBRAS; TREES
n3:klicoveSlovo
n10:TREES n10:ALGEBRAS
n3:kodStatuVydavatele
GB - Spojené království Velké Británie a Severního Irska
n3:kontrolniKodProRIV
[1AFB9DE23F37]
n3:nazevZdroje
Mathematical Structures in Computer Science
n3:obor
n8:BA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
3
n3:rokUplatneniVysledku
n9:2010
n3:svazekPeriodika
20
n3:tvurceVysledku
Adamek, J. Velebil, Jiří Milius, S.
n3:wos
000278636600004
n3:zamer
n11:MSM6840770014
s:issn
0960-1295
s:numberOfPages
34
n18:organizacniJednotka
21230