Kruskal-AlmostFull
by DmxLarchey
Library of basic results about Almost Full relations in Coq
AI summary
Almost Full relation library
A formalization of ground results about Almost Full relations in Coq 8.14+, including closure properties and Dickson's lemma.
- 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.
Quasi morphism library
A Coq library providing tools and definitions for quasi-morphisms in the context of Almost Full relations
Proof framework
A Coq proof framework for Fan theorem and König's lemma
Rose tree library
A Coq library formalizing rose trees for mathematical proof and theorem proving
Data analysis tools
Tools for determining and working with finite data structures in a proof assistant.
Relation Algebra Library
A Coq library providing algebraic tools and tactics for working with binary relations
Relation algebra library
A collection of lemmas and tactics about lists and binary relations for a proof assistant
Tree embedding theorems
Provides theorem results for tree embeddings in inductive type theory
Logical relation library
A Coq-based library for establishing logical relations in formal verification and proof assistance
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.
Relevance logic proof
Mechanization of a proof for the decidability of Implicational Relevance Logic
Symmetric functions library
An algebraic combinatorics library formalized in Coq, providing a comprehensive set of functions and theories for symmetric functions.
Tree function
A Coq implementation of Harvey Friedman's tree(n) function and its properties related to homeomorphic embedding.
Math Library
A collection of reusable mathematical components and algorithms implemented 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
