. Functors preserving weak pullbacks provide the basis for a rich structure theory of coalgebras. We give an easy to use criterion to check whether a functor preserves weak pullbacks. We apply the characterization to the functor F which associates a set X with the set F(X) of all filters on X. It turns out that this functor preserves weak pullbacks, yet does not preserve weak generalized pullbacks. Since topological spaces can be considered as F- coalgebras, in fact they constitute a covariety, we find that the intersection of subcoalgebras need not be a coalgebra, and 1-generated F-coalgebras need not exist. 1. Introduction Coalgebras have been introduced by Aczel and Mendler [AM89] to model various types of transition systems. Reichel ...
Abstract. We present accessible set functors by signatures and equations and we determine how preser...
We generalize some of the central results in automata theory to the abstraction level of coalgebras ...
) H. PETER GUMM Abstract. If T : Set ! Set is a functor which is bounded and preserves weak pullback...
Functors preserving weak pullbacks provide the basis for a rich structure theory of coalgebras. We g...
We generalize some of the central results in automata theory to the abstraction level of coalgebras ...
AbstractIf F:Set→Set is a functor which is bounded and preserves weak generalized pullbacks then a c...
AbstractIf F:Set→Set is a functor which is bounded and preserves weak generalized pullbacks then a c...
We generalize some of the central results in automata theory to the abstraction level of coalgebras ...
We generalize some of the central results in automata theory to the abstraction level of coalgebras ...
We generalize some of the central results in automata theory to the abstraction level of coalgebras ...
We generalize some of the central results in automata theory to theabstraction level of coalgebras a...
For deterministic systems, expressed as coalgebras over polynomial functors, every tree t (an elemen...
We generalize some of the central results in automata theory to the abstraction level of coalgebras ...
AbstractConsideration of categories of transition systems and related constructions leads to the stu...
AbstractGiven an endofunctor F on the category of sets, we investigate how the structure theory of S...
Abstract. We present accessible set functors by signatures and equations and we determine how preser...
We generalize some of the central results in automata theory to the abstraction level of coalgebras ...
) H. PETER GUMM Abstract. If T : Set ! Set is a functor which is bounded and preserves weak pullback...
Functors preserving weak pullbacks provide the basis for a rich structure theory of coalgebras. We g...
We generalize some of the central results in automata theory to the abstraction level of coalgebras ...
AbstractIf F:Set→Set is a functor which is bounded and preserves weak generalized pullbacks then a c...
AbstractIf F:Set→Set is a functor which is bounded and preserves weak generalized pullbacks then a c...
We generalize some of the central results in automata theory to the abstraction level of coalgebras ...
We generalize some of the central results in automata theory to the abstraction level of coalgebras ...
We generalize some of the central results in automata theory to the abstraction level of coalgebras ...
We generalize some of the central results in automata theory to theabstraction level of coalgebras a...
For deterministic systems, expressed as coalgebras over polynomial functors, every tree t (an elemen...
We generalize some of the central results in automata theory to the abstraction level of coalgebras ...
AbstractConsideration of categories of transition systems and related constructions leads to the stu...
AbstractGiven an endofunctor F on the category of sets, we investigate how the structure theory of S...
Abstract. We present accessible set functors by signatures and equations and we determine how preser...
We generalize some of the central results in automata theory to the abstraction level of coalgebras ...
) H. PETER GUMM Abstract. If T : Set ! Set is a functor which is bounded and preserves weak pullback...