{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T00:39:16Z","timestamp":1725842356250},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319276823"},{"type":"electronic","value":"9783319276830"}],"license":[{"start":{"date-parts":[[2015,12,10]],"date-time":"2015-12-10T00:00:00Z","timestamp":1449705600000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-27683-0_23","type":"book-chapter","created":{"date-parts":[[2015,12,9]],"date-time":"2015-12-09T21:16:29Z","timestamp":1449695789000},"page":"331-348","source":"Crossref","is-referenced-by-count":5,"title":["Definability in First Order Theories of Graph Orderings"],"prefix":"10.1007","author":[{"given":"R.","family":"Ramanujam","sequence":"first","affiliation":[]},{"given":"R. S.","family":"Thinniyam","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,10]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1016\/S0927-0507(05)80125-2","volume":"7","author":"D Bienstock","year":"1995","unstructured":"Bienstock, D., Langston, M.A.: Algorithmic implications of the graph minor theorem. Handb. Oper. Res. Manag. Sci. 7, 481\u2013502 (1995)","journal-title":"Handb. Oper. Res. Manag. Sci."},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BFb0029946","volume-title":"Mathematical Foundations of Computer Science 1997","author":"HL Bodlaender","year":"2003","unstructured":"Bodlaender, H.L.: Treewidth: algorithmic techniques and results. In: Privara, I., Ruzicka, P. (eds.) MFCS \u201997. LNCS, vol. 1295, pp. 19\u201336. Springer, Berlin (2003)"},{"key":"23_CR3","volume-title":"Graph Theory","author":"R Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory. Springer, Berlin (2005)"},{"key":"23_CR4","volume-title":"A Mathematical Introduction to Logic","author":"H Enderton","year":"2001","unstructured":"Enderton, H.: A Mathematical Introduction to Logic. Academic press, Waltham (2001)"},{"issue":"4","key":"23_CR5","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1070\/RM1965v020n04ABEH001188","volume":"20","author":"YL Ershov","year":"1965","unstructured":"Ershov, Y.L., Lavrov, I.A., Taimanov, A.D., Taitslin, M.A.: Elementary theories. Russ. Math. Surv. 20(4), 35\u2013105 (1965)","journal-title":"Russ. Math. Surv."},{"issue":"2","key":"23_CR6","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1090\/S0894-0347-2010-00687-X","volume":"24","author":"H Hatami","year":"2011","unstructured":"Hatami, H., Norine, S.: Undecidability of linear inequalities in graph homomorphism densities. J. Am. Math. Soc. 24(2), 547\u2013565 (2011)","journal-title":"J. Am. Math. Soc."},{"key":"23_CR7","volume-title":"Descriptive Complexity","author":"N Immerman","year":"2012","unstructured":"Immerman, N.: Descriptive Complexity. Springer Science & Business Media, Berlin (2012)"},{"issue":"3\u20134","key":"23_CR8","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/s00012-009-0019-x","volume":"61","author":"J Je\u017eek","year":"2009","unstructured":"Je\u017eek, J., McKenzie, R.: Definability in substructure orderings, iv: finite lattices. Algebra Univers. 61(3\u20134), 301\u2013312 (2009)","journal-title":"Algebra Univers."},{"issue":"1","key":"23_CR9","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s00012-009-0002-6","volume":"61","author":"J Je\u017eek","year":"2009","unstructured":"Je\u017eek, J., McKenzie, R.: Definability in substructure orderings, i: finite semilattices. Algebra Univers. 61(1), 59\u201375 (2009)","journal-title":"Algebra Univers."},{"issue":"3\u20134","key":"23_CR10","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/s00012-009-0021-3","volume":"61","author":"J Je\u017eek","year":"2009","unstructured":"Je\u017eek, J., McKenzie, R.: Definability in substructure orderings, iii: finite distributive lattices. Algebra Univers. 61(3\u20134), 283\u2013300 (2009)","journal-title":"Algebra Univers."},{"issue":"2","key":"23_CR11","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s11083-010-9141-9","volume":"27","author":"J Je\u017eek","year":"2010","unstructured":"Je\u017eek, J., McKenzie, R.: Definability in substructure orderings, ii: finite ordered sets. Order 27(2), 115\u2013145 (2010)","journal-title":"Order"},{"issue":"04","key":"23_CR12","doi-asserted-by":"publisher","first-page":"1001","DOI":"10.1017\/jsl.2014.54","volume":"79","author":"AM Kach","year":"2014","unstructured":"Kach, A.M., Montalban, A.: Undecidability of the theories of classes of structures. J. Symbolic Logic 79(04), 1001\u20131019 (2014)","journal-title":"J. Symbolic Logic"},{"key":"23_CR13","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198532132.001.0001","volume-title":"Models of Peano Arithmetic","author":"R Kaye","year":"1991","unstructured":"Kaye, R.: Models of Peano Arithmetic. Oxford University Press, USA (1991)"},{"key":"23_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/978-3-642-02737-6_37","volume-title":"Developments in Language Theory","author":"OV Kudinov","year":"2009","unstructured":"Kudinov, O.V., Selivanov, V.L.: Definability in the infix order on words. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol. 5583, pp. 454\u2013465. Springer, Heidelberg (2009)"},{"key":"23_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-642-13962-8_28","volume-title":"Programs, Proofs, Processes","author":"OV Kudinov","year":"2010","unstructured":"Kudinov, O.V., Selivanov, V.L., Yartseva, L.V.: Definability in the subword order. In: Ferreira, F., L\u00f6we, B., Mayordomo, E., Mendes Gomes, L. (eds.) CiE 2010. LNCS, vol. 6158, pp. 246\u2013255. Springer, Heidelberg (2010)"},{"issue":"1","key":"23_CR16","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s11083-014-9319-7","volume":"32","author":"\u00c1 Kunos","year":"2015","unstructured":"Kunos, \u00c1.: Definability in the embeddability ordering of finite directed graphs. Order 32(1), 117\u2013133 (2015)","journal-title":"Order"},{"issue":"01","key":"23_CR17","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1051\/ita:2005039","volume":"40","author":"D Kuske","year":"2006","unstructured":"Kuske, D.: Theories of orders on the set of words. RAIRO-Theor. Inform. Appl. 40(01), 53\u201374 (2006)","journal-title":"RAIRO-Theor. Inform. Appl."},{"issue":"2","key":"23_CR18","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.jctb.2004.08.001","volume":"92","author":"N Robertson","year":"2004","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. xx. wagner\u2019s conjecture. J. Comb. Theor. B 92(2), 325\u2013357 (2004)","journal-title":"J. Comb. Theor. B"},{"key":"23_CR19","unstructured":"Wires, A.: Definability in the substructure ordering of simple graphs (2012). http:\/\/www.math.uwaterloo.ca\/awires\/SimpleGraphs.pdf"}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27683-0_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,12]],"date-time":"2024-06-12T23:16:31Z","timestamp":1718234191000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27683-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,10]]},"ISBN":["9783319276823","9783319276830"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27683-0_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015,12,10]]}}}