Home / Coq / Type Theory and Mathematics > Completeness and Decidability of Modal Logic Calculi Type Theory and Mathematics > Completeness and Decidability of Modal Logic Calculi Soundness, completeness, and decidability for the logics K, K*, CTL, and PDL. Package 12 stars GitHub Back to Coq