Completeness and Decidability of Modal Logic Calculi
NOASSERTIONCoqv1.2
Machine-checked constructive proofs of soundness, completeness, and decidability for modal logics K, K*, CTL, and PDL.
12 stars2 forks0 contributors
Overview
Completeness and Decidability of Modal Logic Calculi [maintainer=@chdoc]
Related Projects
Community-curated · Updated weekly · 100% open source
Found a gem we're missing?
Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.
