Connections of coalgebra and semantic modeling

The aim of this tutorial is to present the area of coalgebra to people interested in the kinds of semantic modeling that is prominent at TARK. Coalgebra is a general study of a great many kinds of models, and these include type spaces and Kripke models, and many others. But the theory is not overly general, it is not a theory of absolutely everything. The tutorial is designed to be a short introduction to a substantial technical field, bearing in mind that this is nearly impossible. It is also intended to bring together literatures from theoretical computer science and game theory.

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

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

[3]  Lawrence S. Moss,et al.  FINITE MODELS CONSTRUCTED FROM CANONICAL FORMULAS , 2007, J. Philos. Log..

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

[5]  Alexander Kurz,et al.  Coalgebras and their logics , 2006, SIGA.

[6]  Eddie Dekel,et al.  Hierarchies of Beliefs and Common Knowledge , 1993 .

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

[8]  Kit Fine,et al.  Normal forms in modal logic , 1975, Notre Dame J. Formal Log..

[9]  B. Jacobs,et al.  A tutorial on (co)algebras and (co)induction , 1997 .

[10]  Lawrence S. Moss A Note on Expressive Coalgebraic Logics for Finitary Set Functors , 2010, J. Log. Comput..

[11]  Ignacio Darío Viglizzo,et al.  Coalgebras on Measurable Spaces , 2010 .

[12]  Dirk Pattinson,et al.  Rank-1 Modal Logics are Coalgebraic , 2007, J. Log. Comput..

[13]  M. Pintér,et al.  The existence of an inverse limit of an inverse system of measure spaces — A purely measurable case , 2010 .

[14]  E. Doberkat Stochastic Relations : Foundations for Markov Transition Systems , 2007 .

[15]  Dirk Pattinson,et al.  An Introduction to the Theory of Coalgebras , 2003 .

[16]  James Worrell,et al.  On the final sequence of a finitary set functor , 2005, Theor. Comput. Sci..

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

[18]  Ji Ad mek,et al.  Initial algebras and terminal coalgebras in many-sorted sets , 2011 .

[19]  Václav Koubek,et al.  Least Fixed Point of a Functor , 1979, J. Comput. Syst. Sci..

[20]  Jan J. M. M. Rutten,et al.  Universal coalgebra: a theory of systems , 2000, Theor. Comput. Sci..

[21]  Corina Cîrstea,et al.  Modal Logics are Coalgebraic , 2008, Comput. J..

[22]  Martín Hötzel Escardó,et al.  Calculus in coinductive form , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[23]  J. Lambek A fixpoint theorem for complete categories , 1968 .

[24]  Dirk Pattinson Expressive Logics for Coalgebras via Terminal Sequence Induction , 2004, Notre Dame J. Formal Log..

[25]  Jiří Adámek,et al.  Free algebras and automata realizations in the language of categories , 1974 .

[26]  Christoph Schubert Terminal Coalgebras for Measure-Polynomial Functors , 2009, TAMC.

[27]  Lawrence S. Moss,et al.  Final coalgebras for functors on measurable spaces , 2006, Inf. Comput..

[28]  Michael Barr,et al.  Terminal Coalgebras in Well-Founded Set Theory , 1993, Theor. Comput. Sci..

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

[30]  Martin Meier Universal knowledge-belief structures , 2008, Games Econ. Behav..