Final coalgebras for functors on measurable spaces

Authors:
Lawrence S. Moss;Ignacio D. Viglizzo
Affiliations:
Department of Mathematics, Indiana University, Bloomington, IN 47405, USA;Department of Mathematics, Indiana University, Bloomington, IN 47405, USA
Venue:
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Year:
2006

Citing 6
Cited 7

Specifying coalgebras with modal logic

Theoretical Computer Science
From modal logic to terminal coalgebras

Theoretical Computer Science
Bisimulation for labelled Markov processes

Information and Computation - Special issue: LICS'97
Domain theory, testing and simulation for labelled Markov processes

Theoretical Computer Science - Foundations of software science and computation structures
Harsanyi Type Spaces and Final Coalgebras Constructed from Satisfied Theories

Electronic Notes in Theoretical Computer Science (ENTCS)
Final sequences and final coalgebras for measurable spaces

CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science

Terminal Coalgebras for Measure-Polynomial Functors

TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Probability Logic of Finitely Additive Beliefs

Journal of Logic, Language and Information
Coalgebraic logic over general measurable spaces ??? a survey

Mathematical Structures in Computer Science
Connections of coalgebra and semantic modeling

Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
Intuitive probability logic

TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Final sequences and final coalgebras for measurable spaces

CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Approximating Markov processes through filtration

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.