The Constructive -calculus: Game Semantics and Non-Wellfounded Proof Systems
arXiv:2604.23273
Abstract
We study a variant of the modal -calculus based on the constructive modal logic . We define game semantics for the constructive -calculus and prove its equivalence to the birelational Kripke semantics. We then use the game semantics to prove the soundness and completeness of a fully-labeled non-wellfounded proof system for it. At last, we briefly describe how to adapt the game semantics and proof system to the -calculus over other non-classical modal logics.
Text overlap with arxiv:2308.16697