Games for topological fixpoint logic

Tools

Bezhanishvili, Nick and Kupke, Clemens; Cantone, Domenico and Delzanno, Giorgio, eds. (2016) Games for topological fixpoint logic. In: Proceedings of the Seventh International Symposium on Games, Automata, Logics, and Formal Verification. Electronic Proceedings in Theoretical Computer Science, ITA, pp. 46-60. (https://arxiv.org/html/1609.03648)

[thumbnail of Bezhanishvili-Kupke-GandALF-2016-games-for-topological-fixpoint-logic]
Preview
 Text. Filename: Bezhanishvili_Kupke_GandALF_2016_games_for_topological_fixpoint_logic.pdf
Accepted Author Manuscript
License: Creative Commons Attribution 4.0 logo
Download (243kB)| Preview

Abstract

Topological fixpoint logics are a family of logics that admits topological models and where the fixpoint operators are defined with respect to the topological interpretations. Here we consider a topological fixpoint logic for relational structures based on Stone spaces, where the fixpoint operators are interpreted via clopen sets. We develop a game-theoretic semantics for this logic. First we introduce games characterising clopen fixpoints of monotone operators on Stone spaces. These fixpoint games allow us to characterise the semantics for our topological fixpoint logic using a two-player graph game. Adequacy of this game is the main result of our paper. Finally, we define bisimulations for the topological structures under consideration and use our game semantics to prove that the truth of a formula of our topological fixpoint logic is bisimulation-invariant.

CORE (COnnecting REpositories)