A proof of Higman's lemma by structural induction (1993)

Cached

Download Links

by Thierry Coquand , Daniel Fridlender
Citations:9 - 1 self

Documents Related by Co-Citation

67 On well-quasi-ordering finite trees – C Nash-Williams - 1963
19 A constructive proof of Higman’s lemma – C R Murthy, J R Russell - 1990
280 Ordering by divisibility in abstract algebras – G Higman
65 Extracting constructive content from classical proofs – C R Murthy - 1990
5 Higman's Lemma in Type Theory – Daniel Fridlender - 1997
13 Eine in der reinen Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen Zahlen – K Schütte, S Simpson - 1985
24 Ordinal numbers and the Hilbert basis theorem – S G Simpson - 1988
8 An intuitionistic proof of Kruskal's Theorem – Wim Veldman, Wim Veldman, Subfaculteit Wiskunde - 2000
7 A constructive proof of Higman’s lemma in Isabelle – S Berghofer - 2004
23 The Warshall Algorithm and Dickson’s Lemma: Two Examples of Realistic Program Extraction – Ulrich Berger, Helmut Schwichtenberg, Monika Seisenberger
944 Term Rewriting and All That – Franz Baader, Tobias Nipkow - 1998
2 Well–orderings and their maximal order types – D Schmidt - 1979
9 On the logical strength of Nash-Williams’ theorem on transfinite sequences – Alberto Marcone - 1996
38 Nonprovability of certain combinatorial properties of finite trees – S G Simpson - 1985
3 Kruskal’s tree theorem in a constructive theory of inductive definitions – M Seisenberger - 2001
3 An Inductive Version of Nash-Williams’ Minimal-BadSequence Argument for Higman’s Lemma – Monika Seisenberger - 2001
200 Proving Termination with Multiset Orderings – N Dershowitz, Z Manna - 1979
6 On the Constructive Content of Proofs – M Seisenberger - 2003
27 Proof Theory At Work: Program Development In The Minlog System – ? Benl, Berger, Schwichtenberg, Seisenberger, Zuber - 1998