Kruskal-Fan
Fan theorem library
A Coq implementation of the Fan theorem and König's lemma for proving properties about monotone relations on lists and finite fans.
The Fan theorem for inductive bars and a constructive variant of König's lemma
1 stars
1 watching
0 forks
Language: Coq
last commit: 3 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/kruskal-theorems | A library that provides formal proofs of tree theorems using inductive type theory. | 1 |
| dmxlarchey/kruskal-almostfull | A Coq library that formalizes ground results about Almost Full relations in constructive mathematics | 1 |
| dmxlarchey/kruskal-veldman | A detailed proof of Wim Veldman's tree theorem adaptation in Coq | 0 |
| dmxlarchey/kruskal-finite | Tools for proving properties about finite types and predicates using proof assistants | 0 |
| dmxlarchey/kruskal-higman | Provides detailed proofs and tools for Higman's theorem on unary trees | 0 |
 vafeiadis/hahn | A collection of lemmas and tactics about lists and binary relations for a proof assistant | 30 |
| dmxlarchey/kruskal-trees | Formalizes rose trees in Coq with implementations of induction principles and manipulation tools | 1 |
 math-comp/abel | Formalization of mathematical theorems about solvability and Galois theory for polynomials | 28 |
 coq-community/lemma-overloading | A Coq library demonstrating design patterns for automated proof automation and canonical structures | 26 |
| dmxlarchey/quasi-morphisms | A Coq library providing tools and definitions for quasi-morphisms in the context of Almost Full relations | 1 |
 hivert/coq-combi | Formalizes algebraic combinatorics in Coq with an emphasis on symmetric functions and their properties. | 1 |
| dmxlarchey/relevant-decidability | Mechanization of a proof for the decidability of Implicational Relevance Logic | 0 |
| dmxlarchey/friedman-tree | A Coq implementation of Harvey Friedman's tree(n) function and its properties related to homeomorphic embedding. | 0 |
| coq-community/tarjan | Formalization of Tarjan and Kosaraju's strongly connected component algorithm in Coq for finite graphs. | 13 |