{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:31Z","timestamp":1725490231843},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424963"},{"type":"electronic","value":"9783540446835"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44683-4_33","type":"book-chapter","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T01:32:38Z","timestamp":1188351158000},"page":"375-386","source":"Crossref","is-referenced-by-count":0,"title":["Quantifier Rank for Parity of Embedded Finite Models"],"prefix":"10.1007","author":[{"given":"Herv\u00e9","family":"Fournier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,9,5]]},"reference":[{"issue":"11","key":"33_CR1","doi-asserted-by":"publisher","first-page":"4937","DOI":"10.1090\/S0002-9947-00-02672-6","volume":"352","author":"J. T. Baldwin","year":"2000","unstructured":"J. T. Baldwin and M. Benedikt. Stability theory, permutations of indiscernibles, and embedded finite models. Trans. Amer. Math. Soc., 352(11):4937\u20134969, 2000.","journal-title":"Trans. Amer. Math. Soc."},{"issue":"4","key":"33_CR2","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1145\/320211.320240","volume":"46","author":"S. Basu","year":"1999","unstructured":"S. Basu. New results on quantifier elimination over real closed fields and applications to constraint databases. Journal of the ACM, 46(4):537\u2013555, july 1999.","journal-title":"Journal of the ACM"},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"M. Benedikt, G. Dong, L. Libkin, and L. Wong. Relational expressive power of constraint query languages. Journal of the ACM, pages 1\u201334, 1998.","DOI":"10.1145\/273865.273870"},{"issue":"4","key":"33_CR4","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1145\/347476.347477","volume":"47","author":"M. Benedikt","year":"2000","unstructured":"M. Benedikt and L. Libkin. Relational queries over interpreted structures. Journal of the ACM, 47(4):644\u2013680, 2000.","journal-title":"Journal of the ACM"},{"issue":"4","key":"33_CR5","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1002\/malq.19990450411","volume":"45","author":"O. Chapuis","year":"1999","unstructured":"O. Chapuis and P. Koiran. Definability of geometric properties in algebraically closed fields. Mathematical Logic Quarterly, 45(4):533\u2013550, 1999.","journal-title":"Mathematical Logic Quarterly"},{"key":"33_CR6","doi-asserted-by":"crossref","unstructured":"H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-28788-4"},{"key":"33_CR7","doi-asserted-by":"publisher","first-page":"812","DOI":"10.2307\/2324267","volume":"98","author":"D. Flath","year":"1991","unstructured":"D. Flath and S. Wagon. How to pick out the integers in the rationals: An application of number theory to logic. American Mathematical Monthly, 98:812\u2013823, 1991.","journal-title":"American Mathematical Monthly"},{"issue":"4","key":"33_CR8","doi-asserted-by":"publisher","first-page":"1689","DOI":"10.2307\/2586806","volume":"64","author":"J. Flum","year":"1999","unstructured":"J. Flum and Ziegler M. Pseudo-finite homogeneity and saturation. Journal of Symbolic Logic, 64(4):1689\u20131699, 1999.","journal-title":"Journal of Symbolic Logic"},{"key":"33_CR9","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0304-3975(96)00194-6","volume":"173","author":"S. Grumbach","year":"1997","unstructured":"S. Grumbach and J. Su. Queries with arithmetical constraints. Theoretical Computer Science, 173:151\u2013181, 1997.","journal-title":"Theoretical Computer Science"},{"key":"33_CR10","unstructured":"W. Hodges. A Shorter Model Theory. Cambridge University Press, 1997."},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"N. Immerman. Descriptive Complexity. Graduate Texts in Computer Science. Springer, 1998.","DOI":"10.1007\/978-1-4612-0539-5"},{"key":"33_CR12","doi-asserted-by":"crossref","unstructured":"G. Kuper, L. Libkin, and J. Paredaens, editors. Constraint Databases. Springer-Verlag, 2000.","DOI":"10.1007\/978-3-662-04031-7"},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"D Marker. Model theory of differential fields. In Model theory of fields, number 5 in Lecture notes in logic. Springer, 1996.","DOI":"10.1007\/978-3-662-22174-7_2"},{"key":"33_CR14","doi-asserted-by":"publisher","first-page":"98","DOI":"10.2307\/2266510","volume":"14","author":"J. Robinson","year":"1949","unstructured":"J. Robinson. Definability and decision problems in arithmetic. Journal of Symbolic Logic, 14:98\u2013114, 1949.","journal-title":"Journal of Symbolic Logic"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44683-4_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T17:27:51Z","timestamp":1556818071000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44683-4_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424963","9783540446835"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-44683-4_33","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}