AbstractA characterization result for behaviorally definable classes of hidden algebras shows that a class of hidden algebras is behaviorally definable by equations if and only if it is closed under coproducts, quotients, morphisms and representative inclusions. The second part of the paper categorically generalizes this result to a framework of any category with coproducts, a final object and an inclusion system; this is general enough to include all coalgebra categories of interest. As a technical issue, the notions of equation and satisfaction are axiomatized in order to include the different approaches in the literature
The existence of a final coalgebra is equivalent to the existence of a formal logic with a set (smal...
) H. PETER GUMM Abstract. If T : Set ! Set is a functor which is bounded and preserves weak pullback...
AbstractIf F:Set→Set is a functor which is bounded and preserves weak generalized pullbacks then a c...
A characterization result for equationally definable classes of certain coalgebras (including basic ...
AbstractA characterization result for behaviorally definable classes of hidden algebras shows that a...
AbstractLogical definability is investigated for certain classes of coalgebras related to state-tran...
The use of coalgebras for the specification of dynamical systems with a hidden state space is receiv...
Abstract. Hidden algebra is a behavioural algebraic specification for-malism for objects. It capture...
The use of coalgebras for the specification of dynamical systems with a hidden state space is receiv...
AbstractHow can algebraic and coalgebraic specifications be integrated? How can behavioral equivalen...
The theory of hidden algebras combines standard algebraic techniques with coalgebraic techniques to ...
Abstract: We extend the classical hidden algebra formalism by a re-arrangement of the basic concepts...
For large signatures S we prove that Birkhoff’s Variety Theorem holds (i.e., equationally presentabl...
We extend the classical hidden algebra formalism by a re-arrangement of the basic concepts. This re-...
AbstractA syntax and semantics of types, terms and formulas for coalgebras of polynomial functors is...
The existence of a final coalgebra is equivalent to the existence of a formal logic with a set (smal...
) H. PETER GUMM Abstract. If T : Set ! Set is a functor which is bounded and preserves weak pullback...
AbstractIf F:Set→Set is a functor which is bounded and preserves weak generalized pullbacks then a c...
A characterization result for equationally definable classes of certain coalgebras (including basic ...
AbstractA characterization result for behaviorally definable classes of hidden algebras shows that a...
AbstractLogical definability is investigated for certain classes of coalgebras related to state-tran...
The use of coalgebras for the specification of dynamical systems with a hidden state space is receiv...
Abstract. Hidden algebra is a behavioural algebraic specification for-malism for objects. It capture...
The use of coalgebras for the specification of dynamical systems with a hidden state space is receiv...
AbstractHow can algebraic and coalgebraic specifications be integrated? How can behavioral equivalen...
The theory of hidden algebras combines standard algebraic techniques with coalgebraic techniques to ...
Abstract: We extend the classical hidden algebra formalism by a re-arrangement of the basic concepts...
For large signatures S we prove that Birkhoff’s Variety Theorem holds (i.e., equationally presentabl...
We extend the classical hidden algebra formalism by a re-arrangement of the basic concepts. This re-...
AbstractA syntax and semantics of types, terms and formulas for coalgebras of polynomial functors is...
The existence of a final coalgebra is equivalent to the existence of a formal logic with a set (smal...
) H. PETER GUMM Abstract. If T : Set ! Set is a functor which is bounded and preserves weak pullback...
AbstractIf F:Set→Set is a functor which is bounded and preserves weak generalized pullbacks then a c...