Document Open Access Logo

Uniform Interpolation for Coalgebraic Fixpoint Logic

Authors Johannes Marti, Fatemeh Seifan, Yde Venema



PDF
Thumbnail PDF

File

LIPIcs.CALCO.2015.238.pdf
  • Filesize: 0.52 MB
  • 15 pages

Document Identifiers

Author Details

Johannes Marti
Fatemeh Seifan
Yde Venema

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

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)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail