{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T10:51:03Z","timestamp":1753354263303},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662540688"},{"type":"electronic","value":"9783662540695"}],"license":[{"start":{"date-parts":[[2016,12,3]],"date-time":"2016-12-03T00:00:00Z","timestamp":1480723200000},"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":[[2017]]},"DOI":"10.1007\/978-3-662-54069-5_16","type":"book-chapter","created":{"date-parts":[[2016,12,2]],"date-time":"2016-12-02T08:43:15Z","timestamp":1480668195000},"page":"211-223","source":"Crossref","is-referenced-by-count":4,"title":["Definability of Recursive Predicates in the Induced Subgraph Order"],"prefix":"10.1007","author":[{"given":"Ramanathan S.","family":"Thinniyam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,3]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511676277","volume-title":"Logical Foundations of Proof Complexity","author":"S Cook","year":"2010","unstructured":"Cook, S., Nguyen, P.: Logical Foundations of Proof Complexity. Cambridge University Press, Cambridge (2010)"},{"key":"16_CR2","volume-title":"A Mathematical Introduction to logic","author":"H Enderton","year":"2001","unstructured":"Enderton, H.: A Mathematical Introduction to logic. Academic Press, Burlington (2001)"},{"key":"16_CR3","volume-title":"Fundamentals of Generalized Recursion Theory","author":"M Fitting","year":"2011","unstructured":"Fitting, M.: Fundamentals of Generalized Recursion Theory. Elsevier, Amsterdam (2011)"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Grohe, M.: The quest for a logic capturing PTIME. In: 23rd Annual IEEE Symposium on Logic in Computer Science, LICS 2008, pp. 267\u2013271. IEEE (2008)","DOI":"10.1109\/LICS.2008.11"},{"issue":"3\u20134","key":"16_CR5","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":"16_CR6","doi-asserted-by":"crossref","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":"16_CR7","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":"16_CR8","doi-asserted-by":"crossref","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"},{"key":"16_CR9","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, Oxford (1991)"},{"key":"16_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511529948","volume-title":"Bounded Arithmetic, Propositional Logic and Complexity Theory","author":"J Krajicek","year":"1995","unstructured":"Krajicek, J.: Bounded Arithmetic, Propositional Logic and Complexity Theory. Cambridge University Press, Cambridge (1995)"},{"issue":"1","key":"16_CR11","doi-asserted-by":"crossref","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":"16_CR12","doi-asserted-by":"crossref","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."},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-319-27683-0_23","volume-title":"Logical Foundations of Computer Science","author":"R Ramanujam","year":"2016","unstructured":"Ramanujam, R., Thinniyam, R.S.: Definability in first order theories of graph orderings. In: Artemov, S., Nerode, A. (eds.) LFCS 2016. LNCS, vol. 9537, pp. 331\u2013348. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-27683-0_23"},{"issue":"1","key":"16_CR14","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/s00026-015-0295-4","volume":"20","author":"A Wires","year":"2016","unstructured":"Wires, A.: Definability in the substructure ordering of simple graphs. Ann. Comb. 20(1), 139\u2013176 (2016)","journal-title":"Ann. Comb."}],"container-title":["Lecture Notes in Computer Science","Logic and Its Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-54069-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T23:33:34Z","timestamp":1718926414000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-54069-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,3]]},"ISBN":["9783662540688","9783662540695"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-54069-5_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016,12,3]]}}}