Kruskal-Fan

Proof framework

A Coq proof framework for Fan theorem and König's lemma

The Fan theorem for inductive bars and a constructive variant of König's lemma

GitHub

1 stars
1 watching
0 forks
Language: Coq
last commit: almost 2 years ago

Related projects:

RepositoryDescriptionStars
dmxlarchey/coq-kruskalA comprehensive library of constructive Coq proofs for Kruskal's tree theorem and related concepts.0
dmxlarchey/kruskal-theoremsProvides theorem results for tree embeddings in inductive type theory1
dmxlarchey/kruskal-almostfullA formalization of ground results about Almost Full relations in Coq 8.14+, including closure properties and Dickson's lemma.1
dmxlarchey/kruskal-veldmanProvides a constructive account of Wim Veldman's proof of a variant of Kruskal's tree theorem for rose trees in Coq.0
dmxlarchey/kruskal-finiteTools for determining and working with finite data structures in a proof assistant.0
dmxlarchey/kruskal-higmanAn inductive proof of Higman's theorem for unary trees and lists, providing a constructive basis for Kruskal's theorem0
vafeiadis/hahnA collection of lemmas and tactics about lists and binary relations for a proof assistant30
dmxlarchey/kruskal-treesA Coq library formalizing rose trees for mathematical proof and theorem proving1
math-comp/abelFormalization of mathematical theorems about solvability and Galois theory for polynomials28
coq-community/lemma-overloadingA Coq library demonstrating design patterns for automated proof automation and canonical structures26
dmxlarchey/quasi-morphismsA Coq library providing tools and definitions for quasi-morphisms in the context of Almost Full relations1
hivert/coq-combiAn algebraic combinatorics library formalized in Coq, providing a comprehensive set of functions and theories for symmetric functions.1
dmxlarchey/relevant-decidabilityMechanization of a proof for the decidability of Implicational Relevance Logic0
dmxlarchey/friedman-treeA Coq implementation of Harvey Friedman's tree(n) function and its properties related to homeomorphic embedding.0
coq-community/tarjanFormalization of Tarjan and Kosaraju's strongly connected component algorithm in Coq for finite graphs.13