Coq-Kruskal
Kruskal proof library
A comprehensive library of constructive Coq proofs for Kruskal's tree theorem and related concepts.
Description of the Coq-Kruskal project with a map and pointers
0 stars
1 watching
0 forks
last commit: almost 2 years agoLinked from 1 awesome list
Related projects:
| Repository | Description | Stars |
|---|---|---|
| dmxlarchey/kruskal-theorems | Provides theorem results for tree embeddings in inductive type theory | 1 |
| dmxlarchey/kruskal-trees | A Coq library formalizing rose trees for mathematical proof and theorem proving | 1 |
| dmxlarchey/kruskal-veldman | Provides a constructive account of Wim Veldman's proof of a variant of Kruskal's tree theorem for rose trees in Coq. | 0 |
| dmxlarchey/kruskal-higman | An inductive proof of Higman's theorem for unary trees and lists, providing a constructive basis for Kruskal's theorem | 0 |
| dmxlarchey/kruskal-almostfull | A formalization of ground results about Almost Full relations in Coq 8.14+, including closure properties and Dickson's lemma. | 1 |
| dmxlarchey/kruskal-finite | Tools for determining and working with finite data structures in a proof assistant. | 0 |
| dmxlarchey/kruskal-fan | A Coq proof framework for Fan theorem and König's lemma | 1 |
| dmxlarchey/friedman-tree | A Coq implementation of Harvey Friedman's tree(n) function and its properties related to homeomorphic embedding. | 0 |
| dmxlarchey/quasi-morphisms | A Coq library providing tools and definitions for quasi-morphisms in the context of Almost Full relations | 1 |
| dmxlarchey/relevant-decidability | Mechanization of a proof for the decidability of Implicational Relevance Logic | 0 |
 charguer/tlc | A Coq library providing an alternative set of axioms and type class mechanisms for building and proving mathematical theorems. | 38 |
 uds-psl/coq-library-undecidability | A collection of mechanized undecidability proofs in Coq | 111 |
 hivert/coq-combi | An algebraic combinatorics library formalized in Coq, providing a comprehensive set of functions and theories for symmetric functions. | 1 |
 damien-pous/coinduction | A library that enables formal proofs using enhanced coinduction techniques | 15 |
 coq-community/atbr | A Coq library providing algebraic tools and tactics for working with binary relations | 23 |