- Model constructions for Moss' coalgebraic logic
- Lecture Notes in Computer Science
- Pages (from-to)
- Document type
- Interfacultary Research Institutes
- Institute for Logic, Language and Computation (ILLC)
We discuss two model constructions related to the coalgebraic logic introduced by Moss. Our starting point is the derivation system M T for this logic, given by Kupke, Kurz and Venema. Based on the one-step completeness of this system, we first construct a finite coalgebraic model for an arbitrary M T -consistent formula. This construction yields a simplified completeness proof for the logic M T with respect to the intended, coalgebraic semantics. Our second main result concerns a strong completeness result for M T , provided that the functor T satisfies some additional constraints. Our proof for this result is based on the construction, for an M T -consistent set of formulas A, of a coalgebraic model in which A is satisfiable.
- go to publisher's site
- Proceedings title: Algebra and Coalgebra in Computer Science: 4th International Conference, CALCO 2011, Winchester, UK, August
30-September 2, 2011: proceedings
Place of publication: Berlin
Editors: A. Corradini, B. Klin, C. Cîrstea
If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library, or send a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.