Josef Berger ; Helmut Schwichtenberg - A bound for Dickson's lemma

lmcs:3954 - Logical Methods in Computer Science, September 26, 2017, Volume 13, Issue 3 - https://doi.org/10.23638/LMCS-13(3:30)2017
A bound for Dickson's lemmaArticle

Authors: Josef Berger ; Helmut Schwichtenberg

    We consider a special case of Dickson's lemma: for any two functions $f,g$ on the natural numbers there are two numbers $i Keywords: Dickson's lemma, finite pigeon hole principle, program extraction from proofs, non-computational quantifiers.

    https://doi.org/10.23638/LMCS-13(3:30)2017
    Source: arXiv.org:1503.03325
    Volume: Volume 13, Issue 3
    Published on: September 26, 2017
    Imported on: September 26, 2017
    Keywords: Mathematics - Logic, 03F60
    Licence: arXiv.org - Non-exclusive license to distribute

    Classifications

    Mathematics Subject Classification 20201
    Sources:
    • [1] zbMATH Open.

    Share and export

    Consultation statistics

    This page has been seen 2393 times.
    This article's PDF has been downloaded 535 times.