A note on the incompleteness of Afshari & Leigh's system Clo

Abstract

The system $\mathsf{Clo}$ is a cyclic, cut-free proof system for the modal $\mu$-calculus. It was introduced by Afshari & Leigh as an intermediate system in their intent to show the completeness of Kozen's axiomatisation for the modal $\mu$-calculus. We prove that $\mathsf{Clo}$ is incomplete by giving a valid sequent that is not provable in $\mathsf{Clo}$.

Cited by in corpus (1)

• Complete Game Logic with Sabotage