comp-dec-modal
Modal logic proofs
Machine-checked proofs of soundness, completeness, and decidability for modal logics in Coq.
Completeness and Decidability of Modal Logic Calculi [maintainer=@chdoc]
8 stars
3 watching
2 forks
Language: Coq
last commit: over 1 year ago
Linked from 1 awesome list
coqctlmathcompmodal-logicspdl
Related projects:
| Repository | Description | Stars |
|---|---|---|
| | Formalizations of logical deduction systems using Coq | 44 |
| | A Coq library demonstrating design patterns for automated proof automation and canonical structures | 26 |
| | A Coq library providing algebraic data structures and algorithms | 67 |
| | Formalizations of compiler design and virtual machine calculations in Coq | 30 |
| | Provides definitions and verified translations between various representations of regular languages in the Coq proof assistant | 41 |
| | Mechanization of a proof for the decidability of Implicational Relevance Logic | 0 |
| | A formalization of Dedekind reals numbers in the Coq programming language | 43 |
| | Tutorials and materials for teaching Coq-based mathematical component development | 17 |
| | A collection of mathematical theorems and tools within the Coq proof assistant | 15 |
| | A Coq library providing an alternative set of axioms and type class mechanisms for building and proving mathematical theorems. | 38 |
| | Develops and formalizes basic concepts and results of general topology in Coq. | 47 |
| | A comprehensive formalization of mathematical structures and concepts for verified computation in Coq. | 111 |
| | Coq proof assistant book with exercises and examples | 114 |
| | A Coq proof-assistant library for real analysis and mathematical structures | 210 |