Kruskal-AlmostFull
Almost Full relation library
A formalization of ground results about Almost Full relations in Coq 8.14+, including closure properties and Dickson's lemma.
Library of basic results about Almost Full relations in Coq
1 stars
2 watching
0 forks
Language: Coq
last commit: 11 months ago Related projects:
| Repository | Description | Stars |
|---|---|---|
| dmxlarchey/coq-kruskal | A comprehensive library of constructive Coq proofs for Kruskal's tree theorem and related concepts. | 0 |
| dmxlarchey/quasi-morphisms | A Coq library providing tools and definitions for quasi-morphisms in the context of Almost Full relations | 1 |
| dmxlarchey/kruskal-fan | A Coq proof framework for Fan theorem and König's lemma | 1 |
| dmxlarchey/kruskal-trees | A Coq library formalizing rose trees for mathematical proof and theorem proving | 1 |
| dmxlarchey/kruskal-finite | Tools for determining and working with finite data structures in a proof assistant. | 0 |
 coq-community/atbr | A Coq library providing algebraic tools and tactics for working with binary relations | 23 |
 vafeiadis/hahn | A collection of lemmas and tactics about lists and binary relations for a proof assistant | 30 |
| dmxlarchey/kruskal-theorems | Provides theorem results for tree embeddings in inductive type theory | 1 |
 certikos/coqrel | A Coq-based library for establishing logical relations in formal verification and proof assistance | 20 |
| dmxlarchey/kruskal-veldman | Provides a constructive account of Wim Veldman's proof of a variant of Kruskal's tree theorem for rose trees in Coq. | 0 |
| dmxlarchey/relevant-decidability | Mechanization of a proof for the decidability of Implicational Relevance Logic | 0 |
 hivert/coq-combi | An algebraic combinatorics library formalized in Coq, providing a comprehensive set of functions and theories for symmetric functions. | 1 |
| dmxlarchey/friedman-tree | A Coq implementation of Harvey Friedman's tree(n) function and its properties related to homeomorphic embedding. | 0 |
 thery/mathcomp-extra | A collection of reusable mathematical components and algorithms implemented in Coq | 5 |
| dmxlarchey/kruskal-higman | An inductive proof of Higman's theorem for unary trees and lists, providing a constructive basis for Kruskal's theorem | 0 |