Friedman-TREE
Tree function
A Coq implementation of Harvey Friedman's tree(n) function and its properties related to homeomorphic embedding.
Construction of Friedman's tree(n) and TREE(n) in Coq
0 stars
1 watching
0 forks
Language: Coq
last commit: 3 months ago Related projects:
Repository | Description | Stars |
---|---|---|
| Provides a constructive account of Wim Veldman's proof of a variant of Kruskal's tree theorem for rose trees in Coq. | 0 |
| An inductive proof of Higman's theorem for unary trees and lists, providing a constructive basis for Kruskal's theorem | 0 |
| A comprehensive library of constructive Coq proofs for Kruskal's tree theorem and related concepts. | 0 |
| A Coq library formalizing rose trees for mathematical proof and theorem proving | 1 |
| Provides theorem results for tree embeddings in inductive type theory | 1 |
| A comprehensive library of verified data structures and algorithms in Coq | 45 |
| An algebraic combinatorics library formalized in Coq, providing a comprehensive set of functions and theories for symmetric functions. | 1 |
| A Coq library providing tools and definitions for quasi-morphisms in the context of Almost Full relations | 1 |
| A formalization of ground results about Almost Full relations in Coq 8.14+, including closure properties and Dickson's lemma. | 1 |
| Provides an efficient way to traverse and modify nested data structures in Elixir. | 19 |
| A formalization of Dedekind reals numbers in the Coq programming language | 43 |
| A Coq proof framework for Fan theorem and König's lemma | 1 |
| Investigating various aspects of discrete mathematics and formal proofs in Coq, including ordinal numbers and computability theory. | 69 |
| An axiomatic formalization of category theory in Coq for personal study and practical work | 759 |