- Games for topological fixpoint logic
- Electronic Proceedings in Theoretical Computer Science
- Pages (from-to)
- Document type
- Interfacultary Research Institutes
Faculty of Science (FNWI)
- Institute for Logic, Language and Computation (ILLC)
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.
- go to publisher's site
- In: Proceedings of the Seventh International Symposium on Games, Automata, Logics and Formal Verification.
Edited by Domenico Cantone and Giorgio Delzanno
If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library, or send a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.