Weak completeness of coalgebraic dynamic logics

Helle Hvid Hansen, Clemens Kupke

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

3 Citations (Scopus)
14 Downloads (Pure)

Abstract

We present a coalgebraic generalisation of Fischer and Ladner's Propositional Dynamic Logic (PDL) and Parikh's Game Logic (GL). In earlier work, we proved a generic strong completeness result for coalgebraic dynamic logics without iteration. The coalgebraic semantics of such programs is given by a monad T, and modalities are interpreted via a predicate lifting \^I whose transpose is a monad morphism from T to the neighbourhood monad. In this paper, we show that if the monad T carries a complete semilattice structure, then we can define an iteration construct, and suitable notions of diamond-likeness and box-likeness of predicate-liftings which allows for the definition of an axiomatisation parametric in T, \^I and a chosen set of pointwise program operations. As our main result, we show that if the pointwise operations are "negation-free" and Kleisli composition left-distributes over the induced join on Kleisli arrows, then this axiomatisation is weakly complete with respect to the class of standard models. As special instances, we recover the weak completeness of PDL and of dual-free Game Logic. As a modest new result we obtain completeness for dual-free GL extended with intersection (demonic choice) of games.
Original languageEnglish
Title of host publicationProceedings Tenth International Workshop on Fixed Points in Computer Science
EditorsRalph Matthes, Matteo Mio
Place of PublicationBerlin
Pages90-104
Number of pages15
Volume191
DOIs
Publication statusPublished - 9 Sep 2015

Fingerprint

Diamonds
Semantics
Chemical analysis

Keywords

  • game logic
  • coalgebra
  • dynamic logics

Cite this

Hansen, H. H., & Kupke, C. (2015). Weak completeness of coalgebraic dynamic logics. In R. Matthes, & M. Mio (Eds.), Proceedings Tenth International Workshop on Fixed Points in Computer Science (Vol. 191, pp. 90-104). Berlin. https://doi.org/10.4204/EPTCS.191.9
Hansen, Helle Hvid ; Kupke, Clemens. / Weak completeness of coalgebraic dynamic logics. Proceedings Tenth International Workshop on Fixed Points in Computer Science . editor / Ralph Matthes ; Matteo Mio. Vol. 191 Berlin, 2015. pp. 90-104
@inproceedings{d93e3092374644289bfca6ba9e1fb10d,
title = "Weak completeness of coalgebraic dynamic logics",
abstract = "We present a coalgebraic generalisation of Fischer and Ladner's Propositional Dynamic Logic (PDL) and Parikh's Game Logic (GL). In earlier work, we proved a generic strong completeness result for coalgebraic dynamic logics without iteration. The coalgebraic semantics of such programs is given by a monad T, and modalities are interpreted via a predicate lifting \^I whose transpose is a monad morphism from T to the neighbourhood monad. In this paper, we show that if the monad T carries a complete semilattice structure, then we can define an iteration construct, and suitable notions of diamond-likeness and box-likeness of predicate-liftings which allows for the definition of an axiomatisation parametric in T, \^I and a chosen set of pointwise program operations. As our main result, we show that if the pointwise operations are {"}negation-free{"} and Kleisli composition left-distributes over the induced join on Kleisli arrows, then this axiomatisation is weakly complete with respect to the class of standard models. As special instances, we recover the weak completeness of PDL and of dual-free Game Logic. As a modest new result we obtain completeness for dual-free GL extended with intersection (demonic choice) of games.",
keywords = "game logic, coalgebra, dynamic logics",
author = "Hansen, {Helle Hvid} and Clemens Kupke",
year = "2015",
month = "9",
day = "9",
doi = "10.4204/EPTCS.191.9",
language = "English",
volume = "191",
pages = "90--104",
editor = "Ralph Matthes and Matteo Mio",
booktitle = "Proceedings Tenth International Workshop on Fixed Points in Computer Science",

}

Hansen, HH & Kupke, C 2015, Weak completeness of coalgebraic dynamic logics. in R Matthes & M Mio (eds), Proceedings Tenth International Workshop on Fixed Points in Computer Science . vol. 191, Berlin, pp. 90-104. https://doi.org/10.4204/EPTCS.191.9

Weak completeness of coalgebraic dynamic logics. / Hansen, Helle Hvid; Kupke, Clemens.

Proceedings Tenth International Workshop on Fixed Points in Computer Science . ed. / Ralph Matthes; Matteo Mio. Vol. 191 Berlin, 2015. p. 90-104.

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

TY - GEN

T1 - Weak completeness of coalgebraic dynamic logics

AU - Hansen, Helle Hvid

AU - Kupke, Clemens

PY - 2015/9/9

Y1 - 2015/9/9

N2 - We present a coalgebraic generalisation of Fischer and Ladner's Propositional Dynamic Logic (PDL) and Parikh's Game Logic (GL). In earlier work, we proved a generic strong completeness result for coalgebraic dynamic logics without iteration. The coalgebraic semantics of such programs is given by a monad T, and modalities are interpreted via a predicate lifting \^I whose transpose is a monad morphism from T to the neighbourhood monad. In this paper, we show that if the monad T carries a complete semilattice structure, then we can define an iteration construct, and suitable notions of diamond-likeness and box-likeness of predicate-liftings which allows for the definition of an axiomatisation parametric in T, \^I and a chosen set of pointwise program operations. As our main result, we show that if the pointwise operations are "negation-free" and Kleisli composition left-distributes over the induced join on Kleisli arrows, then this axiomatisation is weakly complete with respect to the class of standard models. As special instances, we recover the weak completeness of PDL and of dual-free Game Logic. As a modest new result we obtain completeness for dual-free GL extended with intersection (demonic choice) of games.

AB - We present a coalgebraic generalisation of Fischer and Ladner's Propositional Dynamic Logic (PDL) and Parikh's Game Logic (GL). In earlier work, we proved a generic strong completeness result for coalgebraic dynamic logics without iteration. The coalgebraic semantics of such programs is given by a monad T, and modalities are interpreted via a predicate lifting \^I whose transpose is a monad morphism from T to the neighbourhood monad. In this paper, we show that if the monad T carries a complete semilattice structure, then we can define an iteration construct, and suitable notions of diamond-likeness and box-likeness of predicate-liftings which allows for the definition of an axiomatisation parametric in T, \^I and a chosen set of pointwise program operations. As our main result, we show that if the pointwise operations are "negation-free" and Kleisli composition left-distributes over the induced join on Kleisli arrows, then this axiomatisation is weakly complete with respect to the class of standard models. As special instances, we recover the weak completeness of PDL and of dual-free Game Logic. As a modest new result we obtain completeness for dual-free GL extended with intersection (demonic choice) of games.

KW - game logic

KW - coalgebra

KW - dynamic logics

UR - https://www.irit.fr/FICS2015/

U2 - 10.4204/EPTCS.191.9

DO - 10.4204/EPTCS.191.9

M3 - Conference contribution book

VL - 191

SP - 90

EP - 104

BT - Proceedings Tenth International Workshop on Fixed Points in Computer Science

A2 - Matthes, Ralph

A2 - Mio, Matteo

CY - Berlin

ER -

Hansen HH, Kupke C. Weak completeness of coalgebraic dynamic logics. In Matthes R, Mio M, editors, Proceedings Tenth International Workshop on Fixed Points in Computer Science . Vol. 191. Berlin. 2015. p. 90-104 https://doi.org/10.4204/EPTCS.191.9