{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T01:10:14Z","timestamp":1704157814878},"reference-count":24,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5676,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1998,1]]},"DOI":"10.1016\/s0304-3975(97)00094-7","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T19:40:02Z","timestamp":1049744402000},"page":"317-361","source":"Crossref","is-referenced-by-count":0,"title":["The Kolmogorov expressive power of Boolean query languages"],"prefix":"10.1016","volume":"190","author":[{"given":"Jerzy","family":"Tyszkiewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00094-7_BIB1","series-title":"Proc. ACM Symp. on Principles of Database Systems","article-title":"Queries are easier than you thought (probably)","author":"Abiteboul","year":"1992"},{"key":"10.1016\/S0304-3975(97)00094-7_BIB2","series-title":"Foundations of Databases","author":"Abiteboul","year":"1995"},{"key":"10.1016\/S0304-3975(97)00094-7_BIB3","series-title":"Proc. ICDT'92","article-title":"Optimizing active databases using the split technique","volume":"vol. 646","author":"Abiteboul","year":"1992"},{"key":"10.1016\/S0304-3975(97)00094-7_BIB4","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/0022-0000(91)90032-Z","article-title":"Datalog extensions for database queries and updates","volume":"43","author":"Abiteboul","year":"1991","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(97)00094-7_BIB5","series-title":"Proc. ACM SIGACT Symp. on the Theory of Computing","first-page":"209","article-title":"Generic computation and its complexity","author":"Abiteboul","year":"1991"},{"key":"10.1016\/S0304-3975(97)00094-7_BIB6","doi-asserted-by":"crossref","first-page":"292","DOI":"10.2307\/2272133","article-title":"On Moschovakis closure ordinals","volume":"42","author":"Barwise","year":"1977","journal-title":"J. Symbol. Logic"},{"key":"10.1016\/S0304-3975(97)00094-7_BIB7","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/S0019-9958(85)80027-9","article-title":"A zero-one law for logic with a fixed-point operator","volume":"67","author":"Blass","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(97)00094-7_BIB8","series-title":"Proc. ACM Symp. on Principles of Programming Languages","first-page":"50","article-title":"Programming primitives for database languages","author":"Chandra","year":"1982"},{"key":"10.1016\/S0304-3975(97)00094-7_BIB9","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0022-0000(80)90032-X","article-title":"Computable queries for relational data bases","volume":"21","author":"Chandra","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(97)00094-7_BIB10","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1006\/inco.1995.1084","article-title":"Infinitary logic and inductive definability over finite structures","volume":"119","author":"Dawar","year":"1995","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(97)00094-7_BIB11","doi-asserted-by":"crossref","first-page":"50","DOI":"10.2307\/2272945","article-title":"Probabilities on finite models","volume":"41","author":"Fagin","year":"1976","journal-title":"J. Symbol. Logic"},{"key":"10.1016\/S0304-3975(97)00094-7_BIB12","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/0022-0000(82)90011-3","article-title":"Upper and lower bounds for first-order expressibility","volume":"25","author":"Immerman","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(97)00094-7_BIB13","doi-asserted-by":"crossref","DOI":"10.1109\/PSCT.1987.10319271","article-title":"Expressibility as a complexity measure: results and directions","author":"Immerman","year":"1987"},{"key":"10.1016\/S0304-3975(97)00094-7_BIB14","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1137\/0216051","article-title":"Languages that capture complexity classes","volume":"16","author":"Immerman","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(97)00094-7_BIB15","article-title":"A counterexample to the 0\u20131 law for existential monadic second-order logic","author":"Kaufmann","year":"1987"},{"issue":"3","key":"10.1016\/S0304-3975(97)00094-7_BIB16","first-page":"97","article-title":"Zakon nulya i edinicy dlya mnogosortno\u012d logiki predikatov pervogo poryadka","volume":"2","author":"Knyazev","year":"1990","journal-title":"Diskretnaya Matematika"},{"key":"10.1016\/S0304-3975(97)00094-7_BIB17","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/0890-5401(92)90021-7","article-title":"Infinitary logic and 0\u20131 laws","volume":"98","author":"Kolaitis","year":"1992","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(97)00094-7_BIB18","doi-asserted-by":"crossref","DOI":"10.1016\/B978-0-444-88071-0.50009-6","article-title":"Kolmogorov complexity and its applications","author":"Li","year":"1990"},{"key":"10.1016\/S0304-3975(97)00094-7_BIB19","series-title":"An Introduction to Kolmogorov Complexity and its Applications","author":"Li","year":"1993"},{"key":"10.1016\/S0304-3975(97)00094-7_BIB20","doi-asserted-by":"crossref","first-page":"641","DOI":"10.2307\/2273594","article-title":"Deux ou trois choses que je sais de Ln","volume":"47","author":"Poizat","year":"1982","journal-title":"J. Symbol. Logic"},{"key":"10.1016\/S0304-3975(97)00094-7_BIB21","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF02546665","article-title":"Kombinatorische Anzahlbestimmungen f\u00fcr Gruppen, Graphen und chemische Verbindungen","volume":"68","author":"P\u00f3lya","year":"1937","journal-title":"Acta Math."},{"key":"10.1016\/S0304-3975(97)00094-7_BIB22","series-title":"Proc. ICDT'95","first-page":"97","article-title":"On the Kolmogorov expressive power of Boolean query languages","volume":"vol. 893","author":"Tyszkiewicz","year":"1995"},{"key":"10.1016\/S0304-3975(97)00094-7_BIB23","series-title":"Proc. 14th Symp. on Theory of Computation","first-page":"137","article-title":"Complexity of relational query languages","author":"Vardi","year":"1982"},{"key":"10.1016\/S0304-3975(97)00094-7_BIB24","unstructured":"P. Vit\u00e1nyi, E-mail of March 29, 1995."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597000947?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597000947?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T00:47:30Z","timestamp":1704156450000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597000947"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S0304397597000947"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00094-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}