We consider a general notion of coalgebraic game, whereby games are viewed as elements of a final coalgebra. This allows for a smooth definition of game operations (e.g. sum, negation, and linear implication) as final morphisms. The notion of coalgebraic game subsumes different notions of games, e.g. possibly non-wellfounded Conway games and games arising in Game Semantics à la [AJM00]. We defi...

Coalgebraic games have been recently introduced as a generalization of Conway games and other notions of games arising in different contexts. Using coalgebraic methods, games can be viewed as elements of a final coalgebra for a suitable functor, and operations on games can be analyzed in terms of (generalized) coiteration schemata. Coalgebraic games are sequential in nature, i.e. at each step e...

Motivated by the recent study on categorical properties of latticevalued topology, the paper considers a generalization of the notion of topological system introduced by S. Vickers, providing an algebraic and a coalgebraic category of the new structures. As a result, the nature of the category   TopSys   of S. Vickers gets clari ed, and a metatheorem is stated, claiming that (latticevalu...

motivated by the recent study on categorical properties of latticevalued topology, the paper considers a generalization of the notion of topological system introduced by s. vickers, providing an algebraic and a coalgebraic category of the new structures. as a result, the nature of the category   topsys   of s. vickers gets clari ed, and a metatheorem is stated, claiming that (latticevalu...

A category CoLog of distributive laws is introduced to unify different approaches to modal logic for coalgebras, based merely on the presence of a contravariant functor P that maps a state space to its collection of predicates. We show that categorical constructions, including colimits, limits, and compositions of distributive laws as a tensor product, in CoLog generalise and extend existing co...

A category of one-step semantics is introduced to unify different approaches to coalgebraic logic parametric in a contravariant functor that assigns to the state space its collection of predicates with propositional connectives. Modular constructions of coalgebraic logic are identified as colimits, limits, and tensor products, extending known results for predicate liftings. Generalised predicat...

We pursue the principles of duality and symmetry building upon Pratt’s idea of the Stone Gamut and Abramsky’s representations of quantum systems. In the first part of the paper, we first observe that the Chu space representation of quantum systems leads us to an operational form of state-observable duality, and then show via the Chu space formalism enriched with a generic concept of closure con...

A coalgebraic definition of finite and infinite trace semantics for probabilistic transition systems has recently been given using a certain Kleisli category. In this paper this semantics is developed using a coalgebraic method which is an instance of general determinization. Once applied to discrete systems, this point of view allows the exploitation of the determinized structure by up-to tech...

In this paper, we study extensions of mathematical operational semantics with algebraic effects. Our starting point is an effect-free coalgebraic operational semantics, given by a natural transformation of syntax over behaviour. The operational semantics of the extended language arises by distributing program syntax over effects, again inducing a coalgebraic operational semantics, but this time...

The category Rel(Set) of sets and relations can be described as a category of spans and as the Kleisli category for the powerset monad. A set-functor can be lifted to a functor on Rel(Set) iff it preserves weak pullbacks. We show that these results extend to the enriched setting, if we replace sets by posets or preorders. Preservation of weak pullbacks becomes preservation of exact lax squares....