Sciweavers

Share
CALCO
2015
Springer

Uniform Interpolation for Coalgebraic Fixpoint Logic

4 years 9 months ago
Uniform Interpolation for Coalgebraic Fixpoint Logic
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. 1998 ACM Subject Classification F.4.1 Mathematical Logic Keywords and phrases µ-calculus, uniform interpolation, coalgebra, automata Digital Object Identifier 10.4230/LIPIcs.xxx.yyy.p
Johannes Marti, Fatemeh Seifan, Yde Venema
Added 17 Apr 2016
Updated 17 Apr 2016
Type Journal
Year 2015
Where CALCO
Authors Johannes Marti, Fatemeh Seifan, Yde Venema
Comments (0)
books