License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CSL.2016.7
URN: urn:nbn:de:0030-drops-65470
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/6547/
Go to the corresponding LIPIcs Volume Portal

Enqvist, Sebastian ; Seifan, Fatemeh ; Venema, Yde

Completeness for Coalgebraic Fixpoint Logic

pdf-format:
LIPIcs-CSL-2016-7.pdf (0.6 MB)

Abstract

We introduce an axiomatization for the coalgebraic fixed point logic which was introduced by Venema as a generalization, based on Moss' coalgebraic modality, of the well-known modal mu-calculus. Our axiomatization can be seen as a generalization of Kozen's proof system for the modal mu-calculus to the coalgebraic level of generality. It consists of a complete axiomatization for Moss'modality, extended with Kozen's axiom and rule for the fixpoint operators.

Our main result is a completeness theorem stating that, for functors that preserve weak pullbacks and restrict to finite sets, our axiomatization is sound and complete for the standard interpretation of the language in coalgebraic models. Our proof is based on automata-theoretic ideas: in particular, we introduce the notion of consequence game for modal automata, which plays a crucial role in the proof of our main result.

The result generalizes the celebrated Kozen-Walukiewicz completeness theorem for the modal mu-calculus, and our automata-theoretic methods simplify parts of Walukiewicz' proof.

BibTeX - Entry

@InProceedings{enqvist_et_al:LIPIcs:2016:6547,
  author =	{Sebastian Enqvist and Fatemeh Seifan and Yde Venema},
  title =	{{Completeness for Coalgebraic Fixpoint Logic}},
  booktitle =	{25th EACSL Annual Conference on Computer Science Logic (CSL 2016)},
  pages =	{7:1--7:19},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-022-4},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{62},
  editor =	{Jean-Marc Talbot and Laurent Regnier},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/6547},
  URN =		{urn:nbn:de:0030-drops-65470},
  doi =		{10.4230/LIPIcs.CSL.2016.7},
  annote =	{Keywords: mu-calculus, coalgebra, coalgebraic modal logic, automata, completeness}
}

Keywords: mu-calculus, coalgebra, coalgebraic modal logic, automata, completeness
Collection: 25th EACSL Annual Conference on Computer Science Logic (CSL 2016)
Issue Date: 2016
Date of publication: 29.08.2016

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI