Friedman-TREE
by DmxLarchey
Construction of Friedman's tree(n) and TREE(n) in Coq
AI summary
Tree function
A Coq implementation of Harvey Friedman's tree(n) function and its properties related to homeomorphic embedding.
- stars
- 0
- forks
- 0
- watching
- 1
Similar projects
Found by comparing what the projects do, not just their names.
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.
Tree embedding library
An inductive proof of Higman's theorem for unary trees and lists, providing a constructive basis for Kruskal's theorem
Kruskal proof library
A comprehensive library of constructive Coq proofs for Kruskal's tree theorem and related concepts.
Rose tree library
A Coq library formalizing rose trees for mathematical proof and theorem proving
Tree embedding theorems
Provides theorem results for tree embeddings in inductive type theory
Data structure library
A comprehensive library of verified data structures and algorithms in Coq
Symmetric functions library
An algebraic combinatorics library formalized in Coq, providing a comprehensive set of functions and theories for symmetric functions.
Quasi morphism library
A Coq library providing tools and definitions for quasi-morphisms in the context of Almost Full relations
Almost Full relation library
A formalization of ground results about Almost Full relations in Coq 8.14+, including closure properties and Dickson's lemma.
Traversal library
Provides an efficient way to traverse and modify nested data structures in Elixir.
Real number theory
A formalization of Dedekind reals numbers in the Coq programming language
Proof framework
A Coq proof framework for Fan theorem and König's lemma
Math investigations
Investigating various aspects of discrete mathematics and formal proofs in Coq, including ordinal numbers and computability theory.
Category theory library
An axiomatic formalization of category theory in Coq for personal study and practical work
