iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.48550/arXiv.1210.3117
[1210.3117] Applying Gödel's Dialectica Interpretation to Obtain a Constructive Proof of Higman's Lemma
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Logic in Computer Science

arXiv:1210.3117 (cs)
[Submitted on 11 Oct 2012]

Title:Applying Gödel's Dialectica Interpretation to Obtain a Constructive Proof of Higman's Lemma

Authors:Thomas Powell (Queen Mary, University of London, United Kingdom)
View PDF
Abstract:We use Gödel'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.
Comments: In Proceedings CL&C 2012, arXiv:1210.2890
Subjects: Logic in Computer Science (cs.LO); Discrete Mathematics (cs.DM)
Cite as: arXiv:1210.3117 [cs.LO]
  (or arXiv:1210.3117v1 [cs.LO] for this version)
  https://doi.org/10.48550/arXiv.1210.3117
Journal reference: EPTCS 97, 2012, pp. 49-62
Related DOI: https://doi.org/10.4204/EPTCS.97.4

Submission history

From: EPTCS [view email] [via EPTCS proxy]
[v1] Thu, 11 Oct 2012 03:52:29 UTC (22 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.LO
< prev   |   next >
new | recent | 2012-10
Change to browse by:
cs
cs.DM

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)