package coq-higman-s
Higman's lemma on an unrestricted alphabet
Install
Dune Dependency
Authors
Maintainers
Sources
v8.10.0.tar.gz
md5=44d7e25236ce8c3780391c0de4aef75f
Description
This proof is more or less the proof given by Monika Seisenberger in "An Inductive Version of Nash-Williams' Minimal-Bad-Sequence Argument for Higman's Lemma".
Tags
keyword: Higman's lemma keyword: well quasi-ordering category: Mathematics/Combinatorics and Graph Theory date: 2007-09-14Published: 07 Dec 2019
On This Page