{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:39:37Z","timestamp":1725730777566},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540639947"},{"type":"electronic","value":"9783662221082"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/978-3-662-22108-2_18","type":"book-chapter","created":{"date-parts":[[2013,6,11]],"date-time":"2013-06-11T01:03:26Z","timestamp":1370912606000},"page":"325-338","source":"Crossref","is-referenced-by-count":3,"title":["Towards Recursive Model Theory"],"prefix":"10.1007","author":[{"given":"Alexei P.","family":"Stolboushkin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","first-page":"5","volume-title":"Proc. 15th ACM Symp. on Principles of Database Systems","author":"M Benedikt","year":"1996","unstructured":"M. Benedikt, G. Dong, L. Libkin, and L. Wong. Relational expressive power of constraint query languages. In Proc. 15th ACM Symp. on Principles of Database Systems, pages 5\u201316, 1996."},{"issue":"3","key":"18_CR2","doi-asserted-by":"publisher","first-page":"817","DOI":"10.2307\/2274367","volume":"52","author":"RL Dougherty","year":"1987","unstructured":"R.L. Dougherty. Monotone but not positive subsets of the Cantor space. Journal of Symbolic Logic, 52 (3): 817\u2013818, 1987.","journal-title":"Journal of Symbolic Logic"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0168-0072(86)90055-2","volume":"32","author":"Y Gurevich","year":"1986","unstructured":"Y. Gurevich and S. Shelah. Fixed-point extensions of first-order logic. Annals of Pure and Applied Logic, 32: 265\u2013280, 1986.","journal-title":"and Applied Logic"},{"key":"18_CR4","unstructured":"D. Harel and T. Hirst. More about recursive structures: Descriptive complexity and zero-one laws. In E. Clarke, editor, Proc. 11th IEEE Symp. on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 1996. to appear."},{"key":"18_CR5","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198532132.001.0001","volume-title":"Models of Peano Arithmetic","author":"R Kaye","year":"1991","unstructured":"R. Kaye. Models of Peano Arithmetic. Clarendon Press, Oxford, England, 1991."},{"issue":"1","key":"18_CR6","doi-asserted-by":"publisher","first-page":"143","DOI":"10.2140\/pjm.1959.9.143","volume":"9","author":"R Lyndon","year":"1959","unstructured":"R. Lyndon. Properties preserved under homomorphism. Pacific J. of Mathematics, 9 (1): 143\u2013154, 1959.","journal-title":"Pacific J. of Mathematics"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"403","DOI":"10.2307\/2273150","volume":"47","author":"K Mcaloon","year":"1982","unstructured":"K. McAloon. On the complexity of models of arithmetic. Journal of Symbolic Logic, 47: 403\u2013415, 1982.","journal-title":"Journal of Symbolic Logic"},{"issue":"2","key":"18_CR8","doi-asserted-by":"publisher","first-page":"392","DOI":"10.2307\/2275838","volume":"60","author":"GL Mccolm","year":"1995","unstructured":"G.L. McColm. The dimension of the negation of transitive closure. Journal of Symbolic Logic, 60 (2): 392\u2013414, 1995.","journal-title":"Journal of Symbolic Logic"},{"key":"18_CR9","unstructured":"J. Paradaens, J. Van den Bussche, and D. Van Gucht. First-order queries on finite structures over reals. In Proc. 10th IEEE Symp. on Logic in Computer Science, pages 79\u201387. IEEE Computer Society Press, 1995."},{"key":"18_CR10","unstructured":"H. Rogers Jr. Theory of recursive functions and effective computability. McGraw-Hill, 1967."},{"key":"18_CR11","first-page":"17","volume-title":"Proc. 15th ACM Symp. on Principles of Database Systems","author":"AP Stolboushkin","year":"1996","unstructured":"A.P. Stolboushkin and M.A. Taitslin. Linear vs. order constraint queries over rational databases. In Proc. 15th ACM Symp. on Principles of Database Systems, pages 17\u201327, 1996."},{"key":"18_CR12","unstructured":"A.P. Stolboushkin. Finitely monotone properties. In Proc. 10th IEEE Symp. on Logic in Computer Science,pages 324\u2013330, Los Alamitos, CA, 1995. IEEE Computer Society Press."},{"issue":"3","key":"18_CR13","first-page":"270","volume":"6","author":"S Tennenbaum","year":"1959","unstructured":"S. Tennenbaum. Non-Archimedean models for arithmetic. Notices of the AMS, 6 (3): 270, 1959.","journal-title":"Notices of the AMS"}],"container-title":["Lecture Notes in Logic","Logic Colloquium \u201995"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-22108-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,12]],"date-time":"2024-05-12T05:16:29Z","timestamp":1715490989000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-22108-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540639947","9783662221082"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-22108-2_18","relation":{},"ISSN":["1431-5459"],"issn-type":[{"type":"print","value":"1431-5459"}],"subject":[],"published":{"date-parts":[[1998]]}}}