Algorithmic Theory of WQOs

Weiermann, 1994

Summary

Andreas Weiermann (1994) Complexity bounds for some finite forms of Kruskal's Theorem Journal of Symbolic Computation, 18(5):463–488 (URL)

BibTeX entry

@ARTICLE { weiermann94,
    AUTHOR = { Andreas Weiermann },
    TITLE = { Complexity bounds for some finite forms of {K}ruskal's {T}heorem },
    JOURNAL = { Journal of Symbolic Computation },
    VOLUME = { 18 },
    NUMBER = { 5 },
    PAGES = { 463--488 },
    YEAR = { 1994 },
    DOI = { 10.1006/jsco.1994.1059 },
}