2 papers
cs.LO2023★ 1 cited
Proof Systems for the Modal -Calculus Obtained by Determinizing Automata
Maurice Dekker, Johannes Kloibhofer, Johannes Marti +1
Automata operating on infinite objects feature prominently in the theory of the modal -calculus. One such application concerns the tableau games introduced by Niwiński & Walukie…
math.LO2023★ 2 cited
A note on the incompleteness of Afshari & Leigh's system Clo
Johannes Kloibhofer
The system is a cyclic, cut-free proof system for the modal -calculus. It was introduced by Afshari & Leigh as an intermediate system in their intent to show the…