agda-unimath
agda-unimath copied to clipboard
Modal logic
Module containing the formalization of normal modal logics. It includes:
- Syntax and Kripke semantics of modal logics
- Definition of modal logics K and S5
- Constructive proofs of soundness and consistency
- Classical proofs of completeness and finite approximability
The theorems proved are easily generalized to other normal modal logics.
The code is currently being refactored.