Game semantics for the constructive -calculus
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 . We then show the completeness of extended with fixed-point operators.