Kruskal-Theorems
by DmxLarchey
Kruskal and Higman type tree theorems for the Kruskal-AlmostFull library
AI summary
Tree embedding theorems
Provides theorem results for tree embeddings in inductive type theory
- stars
- 1
- forks
- 0
- watching
- 2
Similar projects
Found by comparing what the projects do, not just their names.
Kruskal proof library
A comprehensive library of constructive Coq proofs for Kruskal's tree theorem and related concepts.
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
Rose tree library
A Coq library formalizing rose trees for mathematical proof and theorem proving
Proof framework
A Coq proof framework for Fan theorem and König's lemma
Data analysis tools
Tools for determining and working with finite data structures in a proof assistant.
Tree function
A Coq implementation of Harvey Friedman's tree(n) function and its properties related to homeomorphic embedding.
Almost Full relation library
A formalization of ground results about Almost Full relations in Coq 8.14+, including closure properties and Dickson's lemma.
Relevance logic proof
Mechanization of a proof for the decidability of Implicational Relevance Logic
Traversal library
Provides an efficient way to traverse and modify nested data structures in Elixir.
Quasi morphism library
A Coq library providing tools and definitions for quasi-morphisms in the context of Almost Full relations
Petri net coverability checker
An algorithm to decide coverability in Petri nets using the Karp-Miller tree construction
Graph theorem proof
A formal proof of a fundamental result in graph theory using the Coq proof assistant
n-ary tree library
A C++ header-only library implementing an n-ary tree data structure with STL-like interfaces
KD tree library
A C library implementation of a data structure for fast searching and nearest neighbor queries in k-dimensional space
