2000 character limit reached
Applying Gödel's Dialectica Interpretation to Obtain a Constructive Proof of Higman's Lemma
Published 11 Oct 2012 in cs.LO and cs.DM | (1210.3117v1)
Abstract: We use G\"odel's Dialectica interpretation to analyse Nash-Williams' elegant but non-constructive "minimal bad sequence" proof of Higman's Lemma. The result is a concise constructive proof of the lemma (for arbitrary decidable well-quasi-orders) in which Nash-Williams' combinatorial idea is clearly present, along with an explicit program for finding an embedded pair in sequences of words.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.