Kruskal-Higman
Tree embedding library
An inductive proof of Higman's theorem for unary trees and lists, providing a constructive basis for Kruskal's theorem
Detailed proof of Higman's lemma for unary trees and lists
0 stars
2 watching
0 forks
Language: Coq
last commit: 3 months ago Related projects:
| Repository | Description | Stars |
|---|---|---|
| dmxlarchey/kruskal-theorems | Provides theorem results for tree embeddings in inductive type theory | 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/coq-kruskal | A comprehensive library of constructive Coq proofs for Kruskal's tree theorem and related concepts. | 0 |
| dmxlarchey/kruskal-trees | A Coq library formalizing rose trees for mathematical proof and theorem proving | 1 |
| dmxlarchey/friedman-tree | A Coq implementation of Harvey Friedman's tree(n) function and its properties related to homeomorphic embedding. | 0 |
| dmxlarchey/kruskal-fan | A Coq proof framework for Fan theorem and König's lemma | 1 |
| dmxlarchey/kruskal-finite | Tools for determining and working with finite data structures in a proof assistant. | 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/karp-miller | An algorithm to decide coverability in Petri nets using the Karp-Miller tree construction | 1 |
| dmxlarchey/relevant-decidability | Mechanization of a proof for the decidability of Implicational Relevance Logic | 0 |
| dmxlarchey/quasi-morphisms | A Coq library providing tools and definitions for quasi-morphisms in the context of Almost Full relations | 1 |
 kpeeters/tree.hh | A C++ header-only library implementing an n-ary tree data structure with STL-like interfaces | 135 |
 dkendal/zipper_tree | Provides an efficient way to traverse and modify nested data structures in Elixir. | 19 |
 roglo/puiseuxth | Formal proof and implementation of Puiseux's Theorem for computing roots of polynomials. | 4 |
 aagarwal1996/additive_trees | Repository for reproducing experiments and figures from a decision tree paper, implementing additive models for trees | 2 |