Relevant-decidability
by DmxLarchey
A constructive account of Kripke-Curry's decidability proof for Implicational Relevance logic (see README.md below)
AI summary
Relevance logic proof
Mechanization of a proof for the decidability of Implicational Relevance Logic
- stars
- 0
- forks
- 1
- watching
- 2
Similar projects
Found by comparing what the projects do, not just their names.
Modal logic proofs
Machine-checked proofs of soundness, completeness, and decidability for modal logics in Coq.
Kruskal proof library
A comprehensive library of constructive Coq proofs for Kruskal's tree theorem and related concepts.
Tree theorem proof
Provides a constructive account of Wim Veldman's proof of a variant of Kruskal's tree theorem for rose trees in Coq.
Almost Full relation library
A formalization of ground results about Almost Full relations in Coq 8.14+, including closure properties and Dickson's lemma.
Logical Deduction Library
Formalizations of logical deduction systems using Coq
Formal semantics tools
Development of formal semantics and verification tools for imperative languages and functional programming languages.
Galois theorem formalizer
Formalization of mathematical theorems about solvability and Galois theory for polynomials
Proof framework
A Coq proof framework for Fan theorem and König's lemma
Undecidability library
A collection of mechanized undecidability proofs in Coq
Quasi morphism library
A Coq library providing tools and definitions for quasi-morphisms in the context of Almost Full relations
Tree embedding theorems
Provides theorem results for tree embeddings in inductive type theory
Data analysis tools
Tools for determining and working with finite data structures in a proof assistant.
Algebra library
A Coq formalization of abstract algebra using functional programming style
Coq simulator
A learning environment for theorem proving with the Coq proof assistant
