{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T13:50:32Z","timestamp":1778766632365,"version":"3.51.4"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2014,11,13]],"date-time":"2014-11-13T00:00:00Z","timestamp":1415836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Arch. Math. Logic"],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1007\/s00153-014-0408-5","type":"journal-article","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T12:59:48Z","timestamp":1415969988000},"page":"193-230","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Well-partial-orderings and the big Veblen number"],"prefix":"10.1007","volume":"54","author":[{"given":"Jeroen","family":"Van der Meeren","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Rathjen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Weiermann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,11,13]]},"reference":[{"key":"408_CR1","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0097-3165(72)90063-5","volume":"13","author":"J.B. Kruskal","year":"1972","unstructured":"Kruskal, J.B.: The theory of well-quasi-ordering: a frequently discovered concept. J. Combin. Theory Ser. A 13, 297\u2013305 (1972)","journal-title":"J. Combin. Theory Ser. A"},{"key":"408_CR2","volume-title":"Well-Partial Orderings and Their Maximal Order Types","author":"D. Schmidt","year":"1979","unstructured":"Schmidt, D.: Well-Partial Orderings and Their Maximal Order Types. Habilitationsschrift, Heidelberg (1979)"},{"key":"408_CR3","doi-asserted-by":"crossref","unstructured":"Simpson, S.G.: Nonprovability of certain combinatorial properties of finite trees. In: Harvey Friedman\u2019s research on the foundations of mathematics, Stud. Logic Found. Math., vol. 117, pp. 87\u2013117. North-Holland, Amsterdam (1985)","DOI":"10.1016\/S0049-237X(09)70156-9"},{"issue":"1","key":"408_CR4","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0168-0072(93)90192-G","volume":"60","author":"M. Rathjen","year":"1993","unstructured":"Rathjen, M., Weiermann, A.: Proof-theoretic investigations on Kruskal\u2019s theorem. Ann. Pure Appl. Logic 60(1), 49\u201388 (1993)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"3","key":"408_CR5","doi-asserted-by":"crossref","first-page":"305","DOI":"10.2307\/2272156","volume":"40","author":"D. Schmidt","year":"1975","unstructured":"Schmidt, D.: Bounds for the closure ordinals of replete monotonic increasing functions. J. Symb. Logic 40(3), 305\u2013316 (1975)","journal-title":"J. Symb. Logic"},{"issue":"3","key":"408_CR6","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1002\/malq.19930390141","volume":"39","author":"A. Weiermann","year":"1993","unstructured":"Weiermann, A.: An order-theoretic characterization of the Sch\u00fctte\u2013Veblen-hierarchy. Math. Logic Q. 39(3), 367\u2013383 (1993)","journal-title":"Math. Logic Q."},{"key":"408_CR7","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF01361109","volume":"127","author":"K. Sch\u00fctte","year":"1954","unstructured":"Sch\u00fctte, K.: Kennzeichnung von Ordnungszahlen durch rekursiv erkl\u00e4rte Funktionen. Math. Ann. 127, 15\u201332 (1954)","journal-title":"Math. Ann."},{"issue":"3","key":"408_CR8","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1090\/S0002-9947-1908-1500814-9","volume":"9","author":"O. Veblen","year":"1908","unstructured":"Veblen, O.: Continuous increasing functions of finite and transfinite ordinals. Trans. Am. Math. Soc. 9(3), 280\u2013292 (1908)","journal-title":"Trans. Am. Math. Soc."},{"issue":"1","key":"408_CR9","doi-asserted-by":"crossref","first-page":"215","DOI":"10.2307\/1971481","volume":"130","author":"I. K\u0159\u00ed\u017e","year":"1989","unstructured":"K\u0159\u00ed\u017e, I.: Well-quasiordering finite trees with gap-condition. Proof of Harvey Friedman\u2019s conjecture. Ann. Math. (2) 130(1), 215\u2013226 (1989)","journal-title":"Ann. Math. (2)"},{"issue":"1","key":"408_CR10","doi-asserted-by":"crossref","first-page":"157","DOI":"10.2307\/2274960","volume":"55","author":"L. Gordeev","year":"1990","unstructured":"Gordeev, L.: Generalizations of the Kruskal\u2013Friedman theorems. J. Symb. Logic 55(1), 157\u2013181 (1990)","journal-title":"J. Symb. Logic"},{"issue":"3","key":"408_CR11","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/1385-7258(77)90067-1","volume":"39","author":"D.H.J. Jongh de","year":"1977","unstructured":"de Jongh, D.H.J., Parikh, R.: Well-partial orderings and hierarchies. Nederl. Akad. Wetensch. Proc. Ser. A 80 = Indag. Math. 39(3), 195\u2013207 (1977)","journal-title":"Nederl. Akad. Wetensch. Proc. Ser. A 80 = Indag. Math."},{"issue":"1","key":"408_CR12","doi-asserted-by":"crossref","first-page":"27","DOI":"10.4064\/fm181-1-2","volume":"181","author":"M. Aschenbrenner","year":"2004","unstructured":"Aschenbrenner, M., Pong, W.Y.: Orderings of monomial ideals. Fund. Math. 181(1), 27\u201374 (2004)","journal-title":"Fund. Math."},{"key":"408_CR13","doi-asserted-by":"crossref","unstructured":"Weiermann, A.: Proving termination for term rewriting systems. In: Computer Science Logic (Berne, 1991), Lecture Notes in Computer Science, vol. 626, pp. 419\u2013428. Springer, Berlin (1992)","DOI":"10.1007\/BFb0023786"},{"key":"408_CR14","doi-asserted-by":"crossref","unstructured":"Weiermann, A.: A computation of the maximal order type of the term ordering on finite multisets. In: Mathematical Theory and Computational Practice, Lecture Notes in Computer Science, vol. 5635, pp. 488\u2013498. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-03073-4_50"},{"key":"408_CR15","unstructured":"Buchholz, W., Sch\u00fctte, K.: Proof Theory of Impredicative Subsystems of Analysis, Studies in Proof Theory. Monographs, vol. 2. Bibliopolis, Naples (1988)"},{"issue":"5","key":"408_CR16","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1006\/jsco.1994.1059","volume":"18","author":"A. Weiermann","year":"1994","unstructured":"Weiermann, A.: Complexity bounds for some finite forms of Kruskal\u2019s theorem. J. Symb. Comput. 18(5), 463\u2013488 (1994)","journal-title":"J. Symb. Comput."}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-014-0408-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00153-014-0408-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-014-0408-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T11:54:43Z","timestamp":1558612483000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00153-014-0408-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,13]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["408"],"URL":"https:\/\/doi.org\/10.1007\/s00153-014-0408-5","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,13]]}}}