arXiv Analytics

Sign in

arXiv:2308.16697 [math.LO]AbstractReferencesReviewsResources

Game semantics for the constructive $μ$-calculus

Leonardo Pacheco

Published 2023-08-31Version 1

We define game semantics for the constructive $\mu$-calculus and prove its correctness. We use these game semantics to prove that the $\mu$-calculus collapses to modal logic over $\mathsf{CS5}$ frames. Finally, we prove the completeness of $\mathsf{\mu CS5}$ over $\mathsf{CS5}$ frames.

Categories: math.LO, cs.LO
Subjects: 03B45, 03F55, 03B62
Related articles: Most relevant | Search more
arXiv:1808.10007 [math.LO] (Published 2018-08-29)
Modal Logic With Non-deterministic Semantics: Part I - Propositional Case
arXiv:1611.04740 [math.LO] (Published 2016-11-15)
A Modal Logic of Supervenience
arXiv:1401.0648 [math.LO] (Published 2014-01-03)
The modal logic of Reverse Mathematics

Links

Toolbox