Results 1 
4 of
4
Exemplaric Expressivity of Modal Logics
, 2008
"... This paper investigates expressivity of modal logics for transition systems, multitransition systems, Markov chains, and Markov processes, as coalgebras of the powerset, finitely supported multiset, finitely supported distribution, and measure functor, respectively. Expressivity means that logically ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
This paper investigates expressivity of modal logics for transition systems, multitransition systems, Markov chains, and Markov processes, as coalgebras of the powerset, finitely supported multiset, finitely supported distribution, and measure functor, respectively. Expressivity means that logically indistinguishable states, satisfying the same formulas, are behaviourally indistinguishable. The investigation is based on the framework of dual adjunctions between spaces and logics and focuses on a crucial injectivity property. The approach is generic both in the choice of systems and modalities, and in the choice of a “base logic”. Most of these expressivity results are already known, but the applicability of the uniform setting of dual adjunctions to these particular examples is what constitutes the contribution of the paper.
Convexity, duality, and effects
 IFIP Theoretical Computer Science 2010, number 82(1) in IFIP Adv. in Inf. and Comm. Techn
, 2010
"... This paper describes some basic relationships between mathematical structures that are relevant in quantum logic and probability, namely convex sets, effect algebras, and a new class of functors that we call ‘convex functors’; they include what are usually called probability distribution functors. T ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
This paper describes some basic relationships between mathematical structures that are relevant in quantum logic and probability, namely convex sets, effect algebras, and a new class of functors that we call ‘convex functors’; they include what are usually called probability distribution functors. These relationships take the form of three adjunctions. Two of these three are ‘dual ’ adjunctions for convex sets, one time with the Boolean truth values {0, 1} as dualising object, and one time with the probablity values [0, 1]. The third adjunction is between effect algebras and convex functors. 1
The monad of probability measures over compact ordered spaces and its EilenbergMoore algebras. Topology and its Applications
, 2008
"... The probability measures on compact Hausdorff spaces K form a compact convex subset PK of the space of measures with the vague topology. Every continuous map f: K → L of compact Hausdorff spaces induces a continuous affine map Pf: PK → PL extending P. Together with the canonical embedding ε: K → PK ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
The probability measures on compact Hausdorff spaces K form a compact convex subset PK of the space of measures with the vague topology. Every continuous map f: K → L of compact Hausdorff spaces induces a continuous affine map Pf: PK → PL extending P. Together with the canonical embedding ε: K → PK associating to every point its Dirac measure and the barycentric map β associating to every probability measure on PK its barycenter, we obtain a monad (P, ε, β). The EilenbergMoore algebras of this monad have been characterised to be the compact convex sets embeddable in locally convex topological vector spaces by Swirszcz [31]. We generalise this result to compact ordered spaces in the sense of Nachbin [23]. The probability measures form again a compact ordered space when endowed with the stochastic order. The maps ε and β are shown to preserve the stochastic orders. Thus, we obtain a monad over the category of compact ordered spaces and order preserving continuous maps. The algebras of this monad are shown to be the compact convex ordered sets embeddable in locally convex ordered topological vector spaces. This result can be seen as a step towards the characterisation of the algebras of the monad of probability
Contents
, 903
"... Abstract. We propose an abstract definition of convex spaces as sets where one can take convex combinations in a consistent way. A priori, a convex space is an algebra over a finitary version of the Giry monad. We identify the corresponding Lawvere theory as the category from [Fri09] and use the res ..."
Abstract
 Add to MetaCart
Abstract. We propose an abstract definition of convex spaces as sets where one can take convex combinations in a consistent way. A priori, a convex space is an algebra over a finitary version of the Giry monad. We identify the corresponding Lawvere theory as the category from [Fri09] and use the results obtained there to extract a concrete definition of convex space in terms of a family of binary operations satisfying certain compatibility conditions. After giving an extensive list of examples of convex sets as they appear throughout mathematics and theoretical physics, we find that there also exist convex spaces that cannot be embedded into a vector space: semilattices are a class of examples of purely combinatorial type. In an informationtheoretic interpretation, convex subsets of vector spaces are probabilistic, while semilattices are possibilistic. Convex spaces unify these two concepts.