{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:13:31Z","timestamp":1726409611795},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540730002"},{"type":"electronic","value":"9783540730019"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73001-9_48","type":"book-chapter","created":{"date-parts":[[2007,7,24]],"date-time":"2007-07-24T15:16:31Z","timestamp":1185290191000},"page":"465-473","source":"Crossref","is-referenced-by-count":0,"title":["Binary Trees and (Maximal) Order Types"],"prefix":"10.1007","author":[{"given":"Gyesik","family":"Lee","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"48_CR1","doi-asserted-by":"publisher","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\u00a039(3), 195\u2013207 (1977)","journal-title":"Nederl. Akad. Wetensch. Proc. Ser. A 80=Indag. Math"},{"key":"48_CR2","unstructured":"Schmidt, D.: Well-Partial Orderings and Their Maximal order Types. Habilitationsschrift, Heidelberg (1979)"},{"issue":"3","key":"48_CR3","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"2","author":"G. Higman","year":"1952","unstructured":"Higman, G.: Ordering by divisibility in abstract algebras. In: Proc. London Math. Soc 2(3), 326\u2013336 (1952)","journal-title":"Proc. London Math. Soc"},{"key":"48_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BFb0032399","volume-title":"Logic, Language and Computation","author":"R. Hasegawa","year":"1994","unstructured":"Hasegawa, R.: Well-ordering of algebras and Kruskal\u2019s theorem. In: Sato, M., Hagiya, M., Jones, N.D. (eds.) Logic, Language and Computation. LNCS, vol.\u00a0792, pp. 133\u2013172. Springer, Heidelberg (1994)"},{"key":"48_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2269764","volume":"29","author":"S. Feferman","year":"1964","unstructured":"Feferman, S.: Systems of predicative analysis. J. Symbolic Logic\u00a029, 1\u201330 (1964)","journal-title":"J. Symbolic Logic"},{"key":"48_CR6","doi-asserted-by":"publisher","first-page":"193","DOI":"10.2307\/2269866","volume":"33","author":"S. Feferman","year":"1968","unstructured":"Feferman, S.: Systems of predicative analysis. II. Representations of ordinals. J. Symbolic Logic\u00a033, 193\u2013220 (1968)","journal-title":"J. Symbolic Logic"},{"key":"48_CR7","unstructured":"Sch\u00fctte, K.: Predicative well-orderings. In: Formal Systems and Recursive Functions. In: Proc. Eighth Logic Colloq, Oxford, 1963. North-Holland pp. 280\u2013303 (1965)"},{"key":"48_CR8","volume-title":"Translated from the revised German edition by Crossley, J. N. Grundlehren der Mathematischen Wissenschaften, Band","author":"K. Sch\u00fctte","year":"1977","unstructured":"Sch\u00fctte, K.: Proof theory. In: Translated from the revised German edition by Crossley, J. N. Grundlehren der Mathematischen Wissenschaften, Band, Springer, Heidelberg (1977)"},{"key":"48_CR9","unstructured":"Weiermann, A.: Phase transition thresholds for some Friedman-style independence results (to appear)"},{"key":"48_CR10","unstructured":"Lee, G.: Slowly-well-orderedness of binary trees in Peano arithmetic and its fragments. (Preprint)"},{"issue":"1","key":"48_CR11","doi-asserted-by":"publisher","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\u00a060(1), 49\u201388 (1993)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"3","key":"48_CR12","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","volume":"17","author":"N. Dershowitz","year":"1982","unstructured":"Dershowitz, N.: Orderings for term-rewriting systems. Theoret. Comput. Sci.\u00a017(3), 279\u2013301 (1982)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"48_CR13","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1006\/inco.2002.3160","volume":"178","author":"H. Touzet","year":"2002","unstructured":"Touzet, H.: A characterisation of multiply recursive functions with Higman\u2019s lemma. Inform. and Comput, RTA \u201999 (Trento)\u00a0178(2), 534\u2013544 (2002)","journal-title":"Inform. and Comput, RTA \u201999 (Trento)"}],"container-title":["Lecture Notes in Computer Science","Computation and Logic in the Real World"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73001-9_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,18]],"date-time":"2019-02-18T10:51:02Z","timestamp":1550487062000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73001-9_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540730002","9783540730019"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73001-9_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}