Abstract
A measure polynomial functor is a functor in the category Meas built up from constant measurable spaces, the identity functor and using products, coproducts and the probability measure functor Δ. In [1] it was proved that these functors have final coalgebras. We present here a different proof of that fact, one that uses the final sequence of the functor, instead of an ad hoc language. We also show how this method works for certain functors in Set and explore the connection with results in the literature that use the final sequence in other ways.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Moss, L.S., Viglizzo, I.D.: Harsanyi type spaces and final coalgebras constructed from satisfied theories. Electronic Notes in Theoretical Computer Science 106, 279–295 (2004)
Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. Inform. and Comput. 94, 1–28 (1991)
de Vink, E.P., Rutten, J.J.M.M.: Bisimulation for probabilistic transition systems: a coalgebraic approach. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 271–293. Springer, Heidelberg (1997)
Moss, L.S., Viglizzo, I.: Final coalgebras for functors on measurable spaces. Information and Computation (2005) (Accepted, under revision)
Heifetz, A., Samet, D.: Topology-free typology of beliefs. Journal of Economic Theory 82, 324–341 (1998)
Giry, M.: A categorical approach to probability theory. In: Categorical aspects of topology and analysis. Springer Lecture Notes in Mathematics, vol. 915, pp. 68–85. Springer, Heidelberg (1982)
Kechris, A.S.: Classical Descriptive Set Theory. Springer, New York (1995)
Andersen, E.S., Jessen, B.: On the introduction of measures in infinite product sets. Danske Vid. Selsk. Mat-Fys. Medd. 25, 8 (1948)
Halmos, P.R.: Measure Theory. D, Van Nostrand Company, Inc., New York, xi + pp. 304 (1950)
Kurz, A., Pattinson, D.: Definability, canonical models, compactness for finitary coalgebraic modal logic. In: CMCS 2002: coalgebraic methods in computer science (Berlin). Electron. Notes Theor. Comput. Sci, vol. 65 (2002)
van Breugel, F., Mislove, M., Ouaknine, J., Worrell, J.: Domain theory, testing and simulation for labelled Markov processes. Theoret. Comput. Sci. 333, 171–197 (2005)
Worrell, J.: Terminal sequences for accessible endofunctors. In: CMCS 1999 Coalgebraic Methods in Computer Science, Amsterdam. Electron, vol. 19, p. 15. Elsevier, Amsterdam (1999) (electronic)
Adámek, J.: On final coalgebras of continuous functors. Theoret. Comput. Sci. 294, 3–29 (2003); Category theory and computer science
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Viglizzo, I.D. (2005). Final Sequences and Final Coalgebras for Measurable Spaces. In: Fiadeiro, J.L., Harman, N., Roggenbach, M., Rutten, J. (eds) Algebra and Coalgebra in Computer Science. CALCO 2005. Lecture Notes in Computer Science, vol 3629. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11548133_25
Download citation
DOI: https://doi.org/10.1007/11548133_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28620-2
Online ISBN: 978-3-540-31876-7
eBook Packages: Computer ScienceComputer Science (R0)