{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:31:48Z","timestamp":1742934708950,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319200279"},{"type":"electronic","value":"9783319200286"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-20028-6_36","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T10:07:37Z","timestamp":1434708457000},"page":"353-362","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["How to Compare Buchholz-Style Ordinal Notation Systems with Gordeev-Style Notation Systems"],"prefix":"10.1007","author":[{"given":"Jeroen","family":"Van der Meeren","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Weiermann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"36_CR1","doi-asserted-by":"crossref","unstructured":"Buchholz, W.: Normalfunktionen und konstruktive Systeme von Ordinalzahlen. In: $$\\models $$ ISILC Proof Theory Symposion (Proceedings of the International Summer Institute and Logic Colloquium, Kiel, 1974). Lecture Notes in Mathematics, vol. 500, pp. 4\u201325. Springer, Berlin (1975)","DOI":"10.1007\/BFb0079544"},{"issue":"3","key":"36_CR2","doi-asserted-by":"publisher","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."},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"Buchholz, W., Feferman, S., Pohlers, W., Sieg, W.: Iterated Inductive Definitions and Subsystems of Analysis: Recent Proof-theoretical Studies. Lecture Notes in Mathematics, vol. 897. Springer, Berlin (1981)","DOI":"10.1007\/BFb0091894"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Crossley, J.N., Kister, J.B.: Natural well-orderings. Arch. Math. Logik Grundlag. 26(1\u20132), 57\u201376 (1986\/1987)","DOI":"10.1007\/BF02017491"},{"issue":"1","key":"36_CR5","doi-asserted-by":"publisher","first-page":"100","DOI":"10.2307\/2275019","volume":"54","author":"L Gordeev","year":"1989","unstructured":"Gordeev, L.: Generalizations of the one-dimensional version of the Kruskal-Friedman theorems. J. Symb. Log. 54(1), 100\u2013121 (1989)","journal-title":"J. Symb. Log."},{"issue":"1","key":"36_CR6","doi-asserted-by":"publisher","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":"1","key":"36_CR7","doi-asserted-by":"publisher","first-page":"157","DOI":"10.2307\/2274960","volume":"55","author":"L Gordeev","year":"1990","unstructured":"Gordeev, L.: Generalizations of the Kruskal-Friedman theorems. J. Symb. Log. 55(1), 157\u2013181 (1990)","journal-title":"J. Symb. Log."},{"issue":"1","key":"36_CR8","doi-asserted-by":"publisher","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. of Math. (2) 130(1), 215\u2013226 (1989)","journal-title":"Ann. of Math. (2)"},{"issue":"3","key":"36_CR9","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s00153-004-0232-4","volume":"44","author":"M Rathjen","year":"2005","unstructured":"Rathjen, M.: An ordinal analysis of parameter free $$\\Pi ^1_2$$-comprehension. Arch. Math. Log. 44(3), 263\u2013362 (2005)","journal-title":"Arch. Math. Log."},{"key":"36_CR10","series-title":"Studies in Logic and the Foundations of Mathematics","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0049-237X(09)70156-9","volume-title":"Harvey Friedman\u2019s Research on the Foundations of Mathematics","author":"SG Simpson","year":"1985","unstructured":"Simpson, S.G.: Nonprovability of certain combinatorial properties of finite trees. In: Harrington, L.A., Morley, M.D., \u0160\u010dedrov, A., Simpson, S.G. (eds.) 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)"},{"issue":"1\u20132","key":"36_CR11","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s00153-014-0408-5","volume":"54","author":"J Van der Meeren","year":"2015","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)","journal-title":"Arch. Math. Log."},{"key":"36_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1007\/978-3-642-03073-4_50","volume-title":"Mathematical Theory and Computational Practice","author":"A Weiermann","year":"2009","unstructured":"Weiermann, A.: A computation of the maximal order type of the term ordering on finite multisets. In: Ambos-Spies, K., L\u00f6we, B., Merkle, W. (eds.) CiE 2009. LNCS, vol. 5635, pp. 488\u2013498. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Evolving Computability"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20028-6_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T10:33:39Z","timestamp":1676025219000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-20028-6_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319200279","9783319200286"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20028-6_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}