An Inductive Version of Nash-Williams’ Minimal-Bad-Sequence Argument for Higman’s Lemma (2001)
| Venue: | IN P. CALLAGHAN, E.AL., TYPES FOR PROOFS AND PROGRAMS, LECTURE NOTES IN COMPUTER SCIENCE 2277 |
| Citations: | 3 - 1 self |
BibTeX
@INPROCEEDINGS{Seisenberger01aninductive,
author = {Monika Seisenberger},
title = {An Inductive Version of Nash-Williams’ Minimal-Bad-Sequence Argument for Higman’s Lemma},
booktitle = {IN P. CALLAGHAN, E.AL., TYPES FOR PROOFS AND PROGRAMS, LECTURE NOTES IN COMPUTER SCIENCE 2277},
year = {2001},
pages = {233--242},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Higman’s lemma has a very elegant, non-constructive proof due to Nash-Williams [NW63] using the so-called minimal-bad-sequence argument. The objective of the present paper is to give a proof that uses the same combinatorial idea, but is constructive. For a two letter alphabet this was done by Coquand and Fridlender [CF94]. Here we present a proof in a theory of inductive definitions that works for arbitrary decidable well quasiorders.
