Kruskal-Veldman
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.
An adaptation of Wim Veldman's proof of the tree theorem to Coq
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/coq-kruskal | A comprehensive library of constructive Coq proofs for Kruskal's tree theorem and related concepts. | 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-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 |
 coq-community/fourcolor | A formal proof of a fundamental result in graph theory using the Coq proof assistant | 174 |
| dmxlarchey/relevant-decidability | Mechanization of a proof for the decidability of Implicational Relevance Logic | 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 |
 barry-jay-personal/tree-calculus | Proofs in Coq for a theoretical book on tree calculus programming language | 143 |
| dmxlarchey/kruskal-finite | Tools for determining and working with finite data structures in a proof assistant. | 0 |
 math-comp/odd-order | Verifies a mathematical theorem in finite group theory | 27 |
| coq-community/coq-100-theorems | Repository tracking famous theorems proved using proof assistants. | 57 |
| dmxlarchey/quasi-morphisms | A Coq library providing tools and definitions for quasi-morphisms in the context of Almost Full relations | 1 |
| math-comp/abel | Formalization of mathematical theorems about solvability and Galois theory for polynomials | 28 |