When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CALCO.2015.238
URN: urn:nbn:de:0030-drops-55379
Go to the corresponding LIPIcs Volume Portal

Marti, Johannes ; Seifan, Fatemeh ; Venema, Yde

Uniform Interpolation for Coalgebraic Fixpoint Logic

17.pdf (0.5 MB)


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.

BibTeX - Entry

  author =	{Johannes Marti and Fatemeh Seifan and Yde Venema},
  title =	{{Uniform Interpolation for Coalgebraic Fixpoint Logic}},
  booktitle =	{6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015)},
  pages =	{238--252},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-84-2},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{35},
  editor =	{Lawrence S. Moss and Pawel Sobocinski},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-55379},
  doi =		{10.4230/LIPIcs.CALCO.2015.238},
  annote =	{Keywords: mu-calculus, uniform interpolation, coalgebra, automata}

Keywords: mu-calculus, uniform interpolation, coalgebra, automata
Seminar: 6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015)
Issue Date: 2015
Date of publication: 21.10.2015

DROPS-Home | Fulltext Search | Imprint Published by LZI