Relevant-decidability
Relevance logic proof
Mechanization of a proof for the decidability of Implicational Relevance Logic
A constructive account of Kripke-Curry's decidability proof for Implicational Relevance logic (see README.md below)
0 stars
2 watching
1 forks
Language: Coq
last commit: over 2 years ago coqcoq-formalizationdecidability-proofkripke-currylogicrelevance
Related projects:
| Repository | Description | Stars |
|---|---|---|
 coq-community/comp-dec-modal | Machine-checked proofs of soundness, completeness, and decidability for modal logics in Coq. | 8 |
| dmxlarchey/coq-kruskal | A comprehensive library of constructive Coq proofs for Kruskal's tree theorem and related concepts. | 0 |
| dmxlarchey/kruskal-veldman | A detailed proof of Wim Veldman's tree theorem adaptation in Coq | 0 |
| dmxlarchey/kruskal-almostfull | A Coq library that formalizes ground results about Almost Full relations in constructive mathematics | 1 |
 dschepler/coq-sequent-calculus | Formalizations of logical deduction systems using Coq | 44 |
 xavierleroy/cdf-mech-sem | Development of formal semantics and verification tools for imperative languages and functional programming languages. | 64 |
 math-comp/abel | Formalization of mathematical theorems about solvability and Galois theory for polynomials | 28 |
| dmxlarchey/kruskal-fan | A Coq implementation of the Fan theorem and König's lemma for proving properties about monotone relations on lists and finite fans. | 1 |
 uds-psl/coq-library-undecidability | A collection of mechanized undecidability proofs in Coq | 111 |
| dmxlarchey/quasi-morphisms | A Coq library providing tools and definitions for quasi-morphisms in the context of Almost Full relations | 1 |
| dmxlarchey/kruskal-theorems | A library that provides formal proofs of tree theorems using inductive type theory. | 1 |
| dmxlarchey/kruskal-finite | Tools for proving properties about finite types and predicates using proof assistants | 0 |
 llee454/functional-algebra | A Coq formalization of abstract algebra using functional programming style | 28 |
 princeton-vl/coqgym | A learning environment for theorem proving with the Coq proof assistant | 384 |