Final coalgebras for functors on measurable spaces

We prove that every functor on the category Meas of measurable spaces built from the identity and constant functors using products, coproducts, and the probability measure functor @D has a final coalgebra. Our work builds on the construction of the universal Harsanyi type spaces by Heifetz and Samet and papers by Rosziger and Jacobs on coalgebraic modal logic. We construct logical languages, probabilistic logics of transition systems, and interpret them on coalgebras. The final coalgebra is carried by the set of descriptions of all points in all coalgebras. For the category Set, we work with the functor D of discrete probability measures. We prove that every functor on Set built from D and the expected functors has a final coalgebra. The work for Set differs from the work for Meas: negation in needed for final coalgebras on Set but not for Meas.

[1]  Martin Rößiger.  From modal logic to terminal coalgebras , 2001 .

[2]  Joël Ouaknine,et al.  Duality for Labelled Markov Processes , 2004, FoSSaCS.

[3]  A. R. D. Mathias,et al.  NON‐WELL‐FOUNDED SETS (CSLI Lecture Notes 14) , 1991 .

[4]  R. Aumann.  Borel structures for function spaces , 1961 .

[5]  Abbas Edalat,et al.  Bisimulation for Labelled Markov Processes , 2002, Inf. Comput..

[6]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[7]  A. Heifetz.  The bayesian formulation of incomplete information — The non-compact case , 1993 .

[8]  Erik P. de Vink,et al.  A hierarchy of probabilistic system types , 2003, CMCS.

[9]  Bart Jacobs,et al.  Many-Sorted Coalgebraic Modal Logic: a Model-theoretic Study , 2001, RAIRO Theor. Informatics Appl..

[10]  Michèle Giry,et al.  A categorical approach to probability theory , 1982 .

[11]  Martin Rößiger.  Languages for Coalgebras on Datafunctors , 1999, CMCS.

[12]  A. Heifetz,et al.  Topology-Free Typology of Beliefs , 1998 .

[13]  Lawrence S. Moss,et al.  Harsanyi Type Spaces and Final Coalgebras Constructed from Satisfied Theories , 2004, CMCS.

[14]  S. Zamir,et al.  Formulation of Bayesian analysis for games with incomplete information , 1985 .

[15]  Alexander Kurz.  Specifying coalgebras with modal logic , 2001, Theor. Comput. Sci..

[16]  P. Billingsley,et al.  Probability and Measure , 1980 .

[17]  James Worrell,et al.  Terminal sequences for accessible endofunctors , 1999, CMCS.

[18]  Peter Aczel,et al.  Non-well-founded sets , 1988, CSLI lecture notes series.

[19]  Yde Venema,et al.  Stone coalgebras , 2004, Theor. Comput. Sci..

[20]  Ignacio Darío Viglizzo,et al.  Final Sequences and Final Coalgebras for Measurable Spaces , 2005, CALCO.

[21]  T. Eisele,et al.  On solutions of Bayesian games , 1979 .

[22]  Joël Ouaknine,et al.  Domain theory, testing and simulation for labelled Markov processes , 2005, Theor. Comput. Sci..

[23]  John C. Harsanyi,et al.  Games with Incomplete Information Played by "Bayesian" Players, I-III: Part I. The Basic Model& , 2004, Manag. Sci..

[24]  J. Harsanyi.  Games with Incomplete Information Played by 'Bayesian' Players, Part III. The Basic Probability Distribution of the Game , 1968 .