{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T13:50:33Z","timestamp":1778766633326,"version":"3.51.4"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"5-6","license":[{"start":{"date-parts":[[2017,6,2]],"date-time":"2017-06-02T00:00:00Z","timestamp":1496361600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"FWO - Flanders"},{"DOI":"10.13039\/100000925","name":"John Templeton Foundation","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100000925","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Arch. Math. Logic"],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s00153-017-0559-2","type":"journal-article","created":{"date-parts":[[2017,6,2]],"date-time":"2017-06-02T06:37:35Z","timestamp":1496385455000},"page":"607-638","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Ordinal notation systems corresponding to Friedman\u2019s linearized well-partial-orders with gap-condition"],"prefix":"10.1007","volume":"56","author":[{"given":"Michael","family":"Rathjen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4869-9001","authenticated-orcid":false,"given":"Jeroen","family":"Van\u00a0der Meeren","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Weiermann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,2]]},"reference":[{"key":"559_CR1","unstructured":"Buchholz, W., Sch\u00fctte, K.: Proof theory of impredicative subsystems of analysis, Studies in Proof Theory. Monographs, vol.\u00a02. Bibliopolis, Naples (1988)"},{"issue":"3","key":"559_CR2","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0168-0072(86)90052-7","volume":"32","author":"W Buchholz","year":"1986","unstructured":"Buchholz, W.: A new system of proof-theoretic ordinal functions. Ann. Pure Appl. Log. 32(3), 195\u2013207 (1986)","journal-title":"Ann. Pure Appl. Log."},{"issue":"2","key":"559_CR3","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0168-0072(87)90078-9","volume":"33","author":"W Buchholz","year":"1987","unstructured":"Buchholz, W.: An independence result for ( $$\\text{ II }_1^1 -\\text{ CA }+\\text{ BI }$$ II 1 1 - CA + BI ). Ann. Pure Appl. Log. 33(2), 131\u2013155 (1987)","journal-title":"Ann. Pure Appl. Log."},{"key":"559_CR4","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)"},{"key":"559_CR5","unstructured":"Van der Meeren, J.: Connecting the two worlds: Well-partial-orders and ordinal notation systems. Ph.D. thesis, Ghent University (2015)"},{"key":"559_CR6","volume-title":"Graph Theory, Graduate Texts in Mathematics","author":"R Diestel","year":"2010","unstructured":"Diestel, R.: Graph Theory, Graduate Texts in Mathematics, vol. 173, 4th edn. Springer, Heidelberg (2010)","edition":"4"},{"issue":"1","key":"559_CR7","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF01630809","volume":"29","author":"L Gordeev","year":"1989","unstructured":"Gordeev, L.: Systems of iterated projective ordinal notations and combinatorial statements about binary labeled trees. Arch. Math. Log. 29(1), 29\u201346 (1989)","journal-title":"Arch. Math. Log."},{"issue":"2","key":"559_CR8","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"3","author":"G Higman","year":"1952","unstructured":"Higman, G.: Ordering by divisibility in abstract algebras. Proc. Lond. Math. Soc. 3(2), 326\u2013336 (1952)","journal-title":"Proc. Lond. Math. Soc."},{"key":"559_CR9","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0097-3165(72)90063-5","volume":"13","author":"JB Kruskal","year":"1972","unstructured":"Kruskal, J.B.: The theory of well-quasi-ordering: a frequently discovered concept. J. Comb. Theory Ser. A 13, 297\u2013305 (1972)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"93","key":"559_CR10","doi-asserted-by":"crossref","first-page":"89","DOI":"10.2307\/1970754","volume":"2","author":"R Laver","year":"1971","unstructured":"Laver, R.: On Fra\u00efss\u00e9\u2019s order type conjecture. Ann. Math. 2(93), 89\u2013111 (1971)","journal-title":"Ann. Math."},{"key":"559_CR11","doi-asserted-by":"crossref","unstructured":"Lee, G.: Binary trees and (maximal) order types. In: Computation and logic in the real world, Lecture Notes in Computer Science, vol. 4497, pp. 465\u2013473. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-73001-9_48"},{"key":"559_CR12","doi-asserted-by":"crossref","unstructured":"Pohlers, W.: A short course in ordinal analysis. In: Proof theory (Leeds, 1990), pp. 27\u201378. Cambridge University Press, Cambridge (1992)","DOI":"10.1017\/CBO9780511896262.004"},{"issue":"1","key":"559_CR13","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. Log. 60(1), 49\u201388 (1993)","journal-title":"Ann. Pure Appl. Log."},{"key":"559_CR14","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)"},{"issue":"1\u20132","key":"559_CR15","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF02007558","volume":"25","author":"K Sch\u00fctte","year":"1985","unstructured":"Sch\u00fctte, K., Simpson, S.G.: Ein in der reinen Zahlentheorie unbeweisbarer Satz \u00fcber endliche Folgen von nat\u00fcrlichen Zahlen. Arch. Math. Log. Grundl. 25(1\u20132), 75\u201389 (1985)","journal-title":"Arch. Math. Log. Grundl."},{"key":"559_CR16","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, Studies in Logic and the Foundations of Mathematics, vol. 117, pp. 87\u2013117. North-Holland, Amsterdam (1985)","DOI":"10.1016\/S0049-237X(09)70156-9"},{"key":"559_CR17","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511581007","volume-title":"Subsystems of Second Order Arithmetic","author":"SG Simpson","year":"2009","unstructured":"Simpson, S.G.: Subsystems of Second Order Arithmetic, 2nd edn. Cambridge University Press, Cambridge (2009)","edition":"2"},{"key":"559_CR18","unstructured":"Takeuti, G.: Proof theory, Studies in Logic and the Foundations of Mathematics, vol. 81, second edn. North-Holland Publishing Co., Amsterdam (1987) With an appendix containing contributions by Georg Kreisel, Wolfram Pohlers. Stephen G, Simpson and Solomon Feferman"},{"key":"559_CR19","doi-asserted-by":"crossref","unstructured":"Van der Meeren, J., Rathjen, M., Weiermann, A.: Well-partial-orderings and the big Veblen number. Arch. Math. Log. 54(1\u20132), 193\u2013230 (2015)","DOI":"10.1007\/s00153-014-0408-5"},{"key":"559_CR20","unstructured":"Van\u00a0der Meeren, J., Rathjen, M., Weiermann, A.: An order-theoretic characterization of the Howard\u2013Bachmann-hierachy. Available on arXiv (2014, Submitted to Journal)"},{"key":"559_CR21","unstructured":"Weiermann, A.: Well partial orderings and their strength measured in terms of their maximal order types. Summary of a talk given at the conference on computability, reverse mathematics and combinatorics in Banff 2008"},{"issue":"2","key":"559_CR22","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1002\/malq.200910125","volume":"57","author":"A Weiermann","year":"2011","unstructured":"Weiermann, A., Wilken, G.: Ordinal arithmetic with simultaneously defined theta-functions. Math. Log. Q. 57(2), 116\u2013132 (2011)","journal-title":"Math. Log. Q."}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00153-017-0559-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-017-0559-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-017-0559-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,25]],"date-time":"2019-09-25T08:48:06Z","timestamp":1569401286000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00153-017-0559-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,2]]},"references-count":22,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["559"],"URL":"https:\/\/doi.org\/10.1007\/s00153-017-0559-2","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,6,2]]}}}