Kruskal-Theorems
Tree theorem library
A library that provides formal proofs of tree theorems using inductive type theory.
Kruskal and Higman type tree theorems for the Kruskal-AlmostFull library
1 stars
2 watching
0 forks
Language: Coq
last commit: 3 months ago Related projects:
| Repository | Description | Stars |
|---|---|---|
| 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-higman | Provides detailed proofs and tools for Higman's theorem on unary trees | 0 |
| dmxlarchey/kruskal-trees | Formalizes rose trees in Coq with implementations of induction principles and manipulation tools | 1 |
| 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 |
| dmxlarchey/kruskal-finite | Tools for proving properties about finite types and predicates using proof assistants | 0 |
| dmxlarchey/friedman-tree | A Coq implementation of Harvey Friedman's tree(n) function and its properties related to homeomorphic embedding. | 0 |
| dmxlarchey/kruskal-almostfull | A Coq library that formalizes ground results about Almost Full relations in constructive mathematics | 1 |
| dmxlarchey/relevant-decidability | Mechanization of a proof for the decidability of Implicational Relevance Logic | 0 |
 dkendal/zipper_tree | Provides an efficient way to traverse and modify nested data structures in Elixir. | 19 |
| dmxlarchey/quasi-morphisms | A Coq library providing tools and definitions for quasi-morphisms in the context of Almost Full relations | 1 |
| dmxlarchey/karp-miller | An algorithm to decide coverability in Petri nets using the Karp-Miller tree construction | 1 |
 coq-community/fourcolor | A formal proof of a fundamental result in graph theory using the Coq proof assistant | 166 |
 kpeeters/tree.hh | An STL-like C++ header-only tree class with n-ary structure and various iterator types. | 133 |
 jtsiomb/kdtree | A C library implementation of a data structure for efficient searching and nearest neighbor queries in k-dimensional space | 395 |