{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T06:57:41Z","timestamp":1720335461330},"reference-count":28,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001459","name":"Ministry of Education - Singapore","doi-asserted-by":"publisher","award":["MOE2016-T2-1-019 \/ R146-000-234-112"],"id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010665","name":"H2020 Marie Sk\u0142odowska-Curie Actions","doi-asserted-by":"publisher","award":["794020"],"id":[{"id":"10.13039\/100010665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001352","name":"National University of Singapore","doi-asserted-by":"publisher","award":["C252-000-087-001"],"id":[{"id":"10.13039\/501100001352","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1016\/j.ipl.2019.05.004","type":"journal-article","created":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T15:11:19Z","timestamp":1559142679000},"page":"19-24","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["The isomorphism problem for tree-automatic ordinals with addition"],"prefix":"10.1016","volume":"149","author":[{"given":"Sanjay","family":"Jain","sequence":"first","affiliation":[]},{"given":"Bakhadyr","family":"Khoussainov","sequence":"additional","affiliation":[]},{"given":"Philipp","family":"Schlicht","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Stephan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ipl.2019.05.004_br0010","series-title":"Finite and Algorithmic Model Theory","first-page":"1","article-title":"Automata-based presentations of infinite structures","volume":"vol. 379","author":"B\u00e1r\u00e1ny","year":"2011"},{"key":"10.1016\/j.ipl.2019.05.004_br0020","series-title":"Proceedings Logic in Computer Science","first-page":"51","article-title":"Automatic structures","author":"Blumensath","year":"2000"},{"issue":"6","key":"10.1016\/j.ipl.2019.05.004_br0030","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1007\/s00224-004-1133-y","article-title":"Finite presentations of infinite structures: automata and interpretations","volume":"37","author":"Blumensath","year":"2004","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/j.ipl.2019.05.004_br0040","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/BF02124929","article-title":"Beitr\u00e4ge zur Begr\u00fcndung der transfiniten Mengenlehre","volume":"46","author":"Cantor","year":"1895","journal-title":"Math. Ann."},{"key":"10.1016\/j.ipl.2019.05.004_br0050","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF01444205","article-title":"Beitr\u00e4ge zur Begr\u00fcndung der transfiniten Mengenlehre","volume":"49","author":"Cantor","year":"1897","journal-title":"Math. Ann."},{"issue":"1","key":"10.1016\/j.ipl.2019.05.004_br0060","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/j.crma.2004.03.035","article-title":"Automaticit\u00e9 des ordinaux et des graphes homog\u00e8nes","volume":"339","author":"Delhomm\u00e9","year":"2004","journal-title":"C. R. Math."},{"issue":"1","key":"10.1016\/j.ipl.2019.05.004_br0070","doi-asserted-by":"crossref","first-page":"350","DOI":"10.2178\/jsl\/1327068708","article-title":"A hierarchy of tree-automatic structures","volume":"77","author":"Finkel","year":"2012","journal-title":"J. Symb. Log."},{"issue":"1\u20132","key":"10.1016\/j.ipl.2019.05.004_br0080","first-page":"61","article-title":"Automatic ordinals","volume":"9","author":"Finkel","year":"2013","journal-title":"Int. J. Unconv. Comput."},{"key":"10.1016\/j.ipl.2019.05.004_br0090","series-title":"Th\u00e9ories d\u00e9cidables par automate fini","author":"Hodgson","year":"1976"},{"issue":"1","key":"10.1016\/j.ipl.2019.05.004_br0100","first-page":"39","article-title":"D\u00e9cidabilit\u00e9 par automate fini","volume":"7","author":"Hodgson","year":"1983","journal-title":"Ann. Sci. Math. Qu\u00e9."},{"key":"10.1016\/j.ipl.2019.05.004_br0110","series-title":"Proceedings of Logic in Computer Science","first-page":"235","article-title":"On isomorphism invariants of some automatic structures","author":"Ishihara","year":"2002"},{"key":"10.1016\/j.ipl.2019.05.004_br0120","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.tcs.2016.02.008","article-title":"Tree-automatic scattered linear orders","volume":"626","author":"Jain","year":"2016","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ipl.2019.05.004_br0130","article-title":"Set Theory: Third Millennium Edition","author":"Jech","year":"2003"},{"key":"10.1016\/j.ipl.2019.05.004_br0140","series-title":"Proceedings of the ASL Logic Colloquium 2007","first-page":"132","article-title":"Three lectures on automatic structures","volume":"vol. 35","author":"Khoussainov","year":"2010"},{"key":"10.1016\/j.ipl.2019.05.004_br0150","series-title":"Proceedings, Conference on Logic and Computational Complexity","first-page":"367","article-title":"Automatic presentations of structures","author":"Khoussainov","year":"1994"},{"key":"10.1016\/j.ipl.2019.05.004_br0160","series-title":"Bulletin of the European Association of Theoretical Computer Science (EATCS), vol. 94","first-page":"181","article-title":"Open questions in the theory of automatic structures","author":"Khoussainov","year":"2008"},{"issue":"4","key":"10.1016\/j.ipl.2019.05.004_br0170","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1145\/1094622.1094625","article-title":"Automatic linear orders and trees","volume":"6","author":"Khoussainov","year":"2005","journal-title":"ACM Trans. Comput. Log."},{"key":"10.1016\/j.ipl.2019.05.004_br0180","series-title":"International Conference on Logic for Programming Artificial Intelligence and Reasoning","first-page":"332","article-title":"Is Cantor's theorem automatic?","author":"Kuske","year":"2003"},{"key":"10.1016\/j.ipl.2019.05.004_br0190","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.tcs.2014.03.022","article-title":"Isomorphisms of scattered automatic linear orders","volume":"533","author":"Kuske","year":"2014","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ipl.2019.05.004_br0200","series-title":"Proceedings of Logic in Computer Science","first-page":"160","article-title":"The isomorphism problem on classes of automatic structures","author":"Kuske","year":"2010"},{"issue":"1","key":"10.1016\/j.ipl.2019.05.004_br0210","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.apal.2012.09.001","article-title":"The isomorphism problem for \u03c9-automatic trees","volume":"164","author":"Kuske","year":"2013","journal-title":"Ann. Pure Appl. Logic"},{"issue":"3","key":"10.1016\/j.ipl.2019.05.004_br0220","doi-asserted-by":"crossref","first-page":"305","DOI":"10.2178\/bsl\/1186666149","article-title":"Describing groups","volume":"13","author":"Nies","year":"2007","journal-title":"Bull. Symb. Log."},{"issue":"2","key":"10.1016\/j.ipl.2019.05.004_br0230","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1016\/j.jalgebra.2007.04.015","article-title":"FA-presentable groups and rings","volume":"320","author":"Nies","year":"2008","journal-title":"J. Algebra"},{"issue":"2","key":"10.1016\/j.ipl.2019.05.004_br0240","doi-asserted-by":"crossref","first-page":"169","DOI":"10.2178\/bsl\/1208442827","article-title":"Automata presenting structures: a survey of the finite string case","volume":"14","author":"Rubin","year":"2008","journal-title":"Bull. Symb. Log."},{"key":"10.1016\/j.ipl.2019.05.004_br0250","series-title":"Handbook of Automata Theory","article-title":"Automatic structures","author":"Rubin","year":"2019"},{"issue":"5","key":"10.1016\/j.ipl.2019.05.004_br0260","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1016\/j.apal.2012.11.007","article-title":"Automata on ordinals and automaticy of linear orders","volume":"164","author":"Schlicht","year":"2013","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/j.ipl.2019.05.004_br0270","series-title":"Polska Akademia Nauk, Monografie Matematyczne, Tom 34","article-title":"Cardinal and ordinal numbers","author":"Sierpi\u0144ski","year":"1958"},{"issue":"1","key":"10.1016\/j.ipl.2019.05.004_br0280","article-title":"Automatic structures \u2013 recent results and open questions","volume":"622","author":"Stephan","year":"2015","journal-title":"J. Phys. Conf. Ser."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019019300924?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019019300924?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,6,23]],"date-time":"2022-06-23T07:17:16Z","timestamp":1655968636000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019019300924"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":28,"alternative-id":["S0020019019300924"],"URL":"https:\/\/doi.org\/10.1016\/j.ipl.2019.05.004","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2019,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The isomorphism problem for tree-automatic ordinals with addition","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ipl.2019.05.004","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}