{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T10:45:44Z","timestamp":1772448344573,"version":"3.50.1"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2015,12,23]],"date-time":"2015-12-23T00:00:00Z","timestamp":1450828800000},"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":[[2016,2]]},"DOI":"10.1007\/s00153-015-0457-4","type":"journal-article","created":{"date-parts":[[2015,12,23]],"date-time":"2015-12-23T05:21:32Z","timestamp":1450848092000},"page":"37-48","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Generalizing Kruskal\u2019s theorem to pairs of cohabitating trees"],"prefix":"10.1007","volume":"55","author":[{"given":"Timothy","family":"Carlson","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,23]]},"reference":[{"key":"457_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-11035-5","volume-title":"Admissible Sets and Structures","author":"J. Barwise","year":"1975","unstructured":"Barwise J.: Admissible Sets and Structures. Springer, Berlin (1975)"},{"key":"457_CR2","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/s001530050150","volume":"38","author":"T. Carlson","year":"1999","unstructured":"Carlson T.: Ordinal arithmetic and $${\\Sigma_{1}}$$ \u03a3 1 -elementarity. Arch. Math. Log. 38, 449\u2013460 (1999)","journal-title":"Arch. Math. Log."},{"key":"457_CR3","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/S0168-0072(00)00040-3","volume":"108","author":"T. Carlson","year":"2001","unstructured":"Carlson T.: Elementary patterns of resemblance. Ann. Pure Appl. Log. 108, 19\u201377 (2001)","journal-title":"Ann. Pure Appl. Log."},{"key":"457_CR4","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/j.apal.2008.10.006","volume":"158","author":"T. Carlson","year":"2009","unstructured":"Carlson T.: Patterns of resemblance of order 2. Ann. Pure Appl. Log. 158, 90\u2013124 (2009)","journal-title":"Ann. Pure Appl. Log."},{"key":"457_CR5","doi-asserted-by":"crossref","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. Proc. Lond. Math. Soc. (Third Series).2, 326\u2013336 (1952)","journal-title":"Proc. Lond. Math. Soc. (Third Series)."},{"key":"457_CR6","first-page":"210","volume":"95","author":"J.B. Kruskal","year":"1960","unstructured":"Kruskal J.B.: Well-quasi-ordering, the tree theorem, and Vazsonyi\u2019s conjecture. Trans. Am. Math. Soc. 95, 210\u2013225 (1960)","journal-title":"Trans. Am. Math. Soc."},{"key":"457_CR7","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-orderings: a frequently discovered concept. J. Comb. Theory (A) 13, 297\u2013305 (1972)","journal-title":"J. Comb. Theory (A)"},{"key":"457_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S030500410005204X","volume":"79","author":"R. Laver","year":"1976","unstructured":"Laver R.: Well-quasi-orderings and sets of finite sequences. Math. Proc. Camb. Philos. Soc. 79, 1\u201310 (1976)","journal-title":"Math. Proc. Camb. Philos. Soc."},{"key":"457_CR9","doi-asserted-by":"crossref","unstructured":"Marcone, A: On the logical strength of Nash-Williams\u2019 theorem on transfinite sequences. In: Hodges, W., Hyland, M., Steinhorn, C., Truss, J. Logic: From Foundations to Applications, pp. 327-351. The Clarendon Press, New York (1996)","DOI":"10.1093\/oso\/9780198538622.003.0014"},{"key":"457_CR10","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1017\/S0305004100003844","volume":"59","author":"C.St.J.A. Nash-Williams","year":"1963","unstructured":"Nash-Williams C.St.J.A.: On well-quasi-ordering finite trees. Proc. Camb. Philos. Soc. 59, 833\u2013835 (1963)","journal-title":"Proc. Camb. Philos. Soc."},{"key":"457_CR11","unstructured":"Simpson S.G.: Subsystems of Second Order Arithmetic, 2nd edn. Perspectives in Logic. Cambridge University Press, Cambridge (2010)"}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-015-0457-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00153-015-0457-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-015-0457-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,13]],"date-time":"2024-06-13T09:41:11Z","timestamp":1718271671000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00153-015-0457-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,23]]},"references-count":11,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2016,2]]}},"alternative-id":["457"],"URL":"https:\/\/doi.org\/10.1007\/s00153-015-0457-4","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,23]]}}}