{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T08:05:45Z","timestamp":1772438745528,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642308697","type":"print"},{"value":"9783642308703","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30870-3_37","type":"book-chapter","created":{"date-parts":[[2012,5,28]],"date-time":"2012-05-28T02:56:12Z","timestamp":1338173772000},"page":"363-373","source":"Crossref","is-referenced-by-count":6,"title":["Tree-Automatic Well-Founded Trees"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Kartzow","sequence":"first","affiliation":[]},{"given":"Jiamou","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Markus","family":"Lohrey","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Computable structures and the hyperarithmetical hierarchy","author":"C.J. Ash","year":"2000","unstructured":"Ash, C.J., Knight, J.F.: Computable structures and the hyperarithmetical hierarchy. Studies in Logic and the Foundations of Mathematics, vol.\u00a0144. North-Holland Publishing Co., Amsterdam (2000)"},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"B\u00e1r\u00e1ny, V., Gr\u00e4del, E., Rubin, S.: Automata-based presentations of infinite structures. In: Finite and Algorithmic Model Theory. London Mathematical Society Lecture Notes Series, vol.\u00a0379, pp. 1\u201376. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511974960.002"},{"key":"37_CR3","unstructured":"Blumensath, A.: Automatic structures. Diploma thesis, RWTH Aachen (1999)"},{"key":"37_CR4","first-page":"642","volume":"37","author":"A. Blumensath","year":"2004","unstructured":"Blumensath, A., Gr\u00e4del, E.: Finite presentations of infinite structures: Automata and interpretations. Theory Comput. Syst.\u00a037, 642\u2013674 (2004)","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"37_CR5","doi-asserted-by":"publisher","first-page":"191","DOI":"10.2178\/bsl\/1146620059","volume":"12","author":"W. Calvert","year":"2006","unstructured":"Calvert, W., Knight, J.F.: Classification from a computable viewpoint. Bull. Symbolic Logic\u00a012(2), 191\u2013218 (2006)","journal-title":"Bull. Symbolic Logic"},{"key":"37_CR6","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.crma.2004.03.035","volume":"339","author":"C. Delhomm\u00e9","year":"2004","unstructured":"Delhomm\u00e9, C.: Automaticit\u00e9 des ordinaux et des graphes homog\u00e8nes. C.R. Acad. Sci. Paris Ser. I\u00a0339, 5\u201310 (2004)","journal-title":"C.R. Acad. Sci. Paris Ser. I"},{"issue":"6","key":"37_CR7","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1023\/A:1021758312697","volume":"41","author":"S.S. Goncharov","year":"2002","unstructured":"Goncharov, S.S., Knight, J.F.: Computable structure and antistructure theorems. Algebra Logika\u00a041(6), 639\u2013681 (2002)","journal-title":"Algebra Logika"},{"issue":"1","key":"37_CR8","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1305\/ndjfl\/1071505769","volume":"43","author":"D.R. Hirschfeldt","year":"2002","unstructured":"Hirschfeldt, D.R., White, W.M.: Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures. Notre Dame J. Form. Log.\u00a043(1), 51\u201364 (2002)","journal-title":"Notre Dame J. Form. Log."},{"key":"37_CR9","doi-asserted-by":"crossref","unstructured":"Huschenbett, M.: Word automaticity of tree automatic scattered linear orderings is decidable. Technical report, arXiv.org (2012), \n                    http:\/\/arxiv.org\/abs\/1201.5070","DOI":"10.1007\/978-3-642-30870-3_32"},{"key":"37_CR10","unstructured":"Kartzow, A.: First-Order Model Checking On Generalisations of Pushdown Graphs. PhD thesis, TU Darmstadt (2011)"},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"Kartzow, A., Lohrey, M., Liu, J.: Tree-automatic well-founded trees. Technical report, arXiv.org (2012), \n                    http:\/\/arxiv.org\/abs\/1201.5495","DOI":"10.1007\/978-3-642-30870-3_37"},{"issue":"3","key":"37_CR12","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1016\/j.apal.2009.07.012","volume":"161","author":"B. Khoussainov","year":"2009","unstructured":"Khoussainov, B., Minnes, M.: Model theoretic complexity of automatic structures. Ann. Pure Appl. Logic\u00a0161(3), 416\u2013426 (2009)","journal-title":"Ann. Pure Appl. Logic"},{"key":"37_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/3-540-60178-3_93","volume-title":"Logic and Computational Complexity","author":"B. Khoussainov","year":"1995","unstructured":"Khoussainov, B., Nerode, A.: Automatic Presentations of Structures. In: Leivant, D. (ed.) LCC 1994. LNCS, vol.\u00a0960, pp. 367\u2013392. Springer, Heidelberg (1995)"},{"issue":"2","key":"37_CR14","doi-asserted-by":"crossref","first-page":"18","DOI":"10.2168\/LMCS-3(2:2)2007","volume":"3","author":"B. Khoussainov","year":"2007","unstructured":"Khoussainov, B., Nies, A., Rubin, S., Stephan, F.: Automatic structures: richness and limitations. Log. Methods Comput. Sci.\u00a03(2):2:2, 18 (2007)","journal-title":"Log. Methods Comput. Sci."},{"issue":"4","key":"37_CR15","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1145\/1094622.1094625","volume":"6","author":"B. Khoussainov","year":"2005","unstructured":"Khoussainov, B., Rubin, S., Stephan, F.: Automatic linear orders and trees. ACM Trans. Comput. Log.\u00a06(4), 675\u2013700 (2005)","journal-title":"ACM Trans. Comput. Log."},{"key":"37_CR16","doi-asserted-by":"crossref","unstructured":"Kuske, D., Liu, J., Lohrey, M.: The isomorphism problem on classes of automatic structures with transitive relations. To appear in Trans. Amer. Math. Soc. (2012)","DOI":"10.1090\/S0002-9947-2013-05766-2"},{"issue":"4","key":"37_CR17","doi-asserted-by":"publisher","first-page":"1352","DOI":"10.2178\/jsl\/1318338854","volume":"76","author":"D. Kuske","year":"2011","unstructured":"Kuske, D., Lohrey, M.: Automatic structures of bounded degree revisited. J. Symbolic Logic\u00a076(4), 1352\u20131380 (2011)","journal-title":"J. Symbolic Logic"},{"key":"37_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/978-3-540-31856-9_57","volume-title":"STACS 2005","author":"G.P. Oliver","year":"2005","unstructured":"Oliver, G.P., Thomas, R.M.: Automatic Presentations for Finitely Generated Groups. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 693\u2013704. Springer, Heidelberg (2005)"},{"key":"37_CR19","unstructured":"Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill (1968)"},{"key":"37_CR20","unstructured":"Rosenstein, J.: Linear Ordering. Academic Press (1982)"},{"key":"37_CR21","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-540-89439-1_15","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"A.W. To","year":"2008","unstructured":"To, A.W., Libkin, L.: Recurrent Reachability Analysis in Regular Model Checking. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol.\u00a05330, pp. 198\u2013213. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","How the World Computes"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30870-3_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T07:57:51Z","timestamp":1675929471000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-30870-3_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642308697","9783642308703"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30870-3_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}