LIPIcs.CALCO.2015.238.pdf
- Filesize: 0.52 MB
- 15 pages
Document
Uniform Interpolation for Coalgebraic Fixpoint Logic
Authors
-
Part of:
Volume:
6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Conference on Algebra and Coalgebra in Computer Science (CALCO) - License:
Creative Commons Attribution 3.0 Unported license
- Publication date: 2015-10-28
Cite AsGet BibTex
Johannes Marti, Fatemeh Seifan, and Yde Venema. Uniform Interpolation for Coalgebraic Fixpoint Logic. In 6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 35, pp. 238-252, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
https://doi.org/10.4230/LIPIcs.CALCO.2015.238
https://doi.org/10.4230/LIPIcs.CALCO.2015.238
Abstract
We use the connection between automata and logic to prove that a wide class of coalgebraic fixpoint logics enjoys uniform interpolation. To this aim, first we generalize one of the central results in coalgebraic automata theory, namely closure under projection, which is known to hold for weak-pullback preserving functors, to a more general class of functors, i.e., functors with quasifunctorial lax extensions. Then we will show that closure under projection implies definability of the bisimulation quantifier in the language of coalgebraic fixpoint logic, and finally we prove the uniform interpolation theorem.
Keywords
- mu-calculus
- uniform interpolation
- coalgebra
- automata
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads