Game semantics for the constructive μ-calculus

2023/08/31 by Pacheco, Leonardo · 1 citation
#03B45 (Primary) #03B62 (Secondary) #03F55 #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Logic in Computer Science (cs.LO)

paper · doi:10.48550/arxiv.2308.16697

Abstract

We define game semantics for the constructive μ-calculus and prove its equivalence to bi-relational semantics. As an application, we use the game semantics to prove that the μ-calculus collapses to modal logic over the modal logic IS5. We then show the completeness of IS5 extended with fixed-point operators.

Cited by

• The mu-calculus' Alternation Hierarchy is Strict over Non-Trivial Fusion Logics

Related

• Game semantics for lattice-based modal μ-calculus
• Bounded game-theoretic semantics for modal mu-calculus
• First-Order Game Logic and Modal Mu-Calculus
• Canonicity of Proofs in Constructive Modal Logic
• Differential Equations as Fixpoints and Games