Completeness and Decidability of Modal Logic Calculi

github.comtool

Soundness, completeness, and decidability for the logics K, K*, CTL, and PDL.

from

Coq

added

2026-10-10

likes

0

Coq › Projects > Type Theory and Mathematics: “Soundness, completeness, and decidability for the logics K, K*, CTL, and PDL.”