{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:23Z","timestamp":1761611063209},"reference-count":33,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,9,1]],"date-time":"1995-09-01T00:00:00Z","timestamp":809913600000},"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":6529,"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":[[1995,9]]},"DOI":"10.1016\/0304-3975(95)00027-t","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T09:38:06Z","timestamp":1027589886000},"page":"101-128","source":"Crossref","is-referenced-by-count":10,"title":["Computing with infinitary logic"],"prefix":"10.1016","volume":"149","author":[{"given":"Serge","family":"Abiteboul","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moshe Y.","family":"Vardi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor","family":"Vianu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00027-T_BIB1","series-title":"Foundations of Databases","author":"Abiteboul","year":"1995"},{"key":"10.1016\/0304-3975(95)00027-T_BIB2","series-title":"Proc. 9th IEEE Symp. on Logic in Comput. Sci.","first-page":"230","article-title":"The power of the reflective relational machine","author":"Abiteboul","year":"1994"},{"key":"10.1016\/0304-3975(95)00027-T_BIB3","series-title":"Proc. 7th IEEE Conf. on Structure in Complexity Theory","first-page":"156","article-title":"Fixpoint logics, relational machines, and computational complexity","author":"Abiteboul","year":"1992"},{"issue":"1","key":"10.1016\/0304-3975(95)00027-T_BIB4","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/0022-0000(91)90032-Z","article-title":"Datalog extensions for database updates and queries","volume":"43","author":"Abiteboul","year":"1991","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00027-T_BIB5","series-title":"Proc. 23rd ACM Symposium on Theory of Computing","first-page":"209","article-title":"Generic computation and its complexity","author":"Abiteboul","year":"1991"},{"key":"10.1016\/0304-3975(95)00027-T_BIB6","series-title":"Proc. 20th Internat. Colloquium on Automata, Languages and Programming (ICALP)","first-page":"606","article-title":"Computing on structures","volume":"Vol. 700","author":"Abiteboul","year":"1993"},{"key":"10.1016\/0304-3975(95)00027-T_BIB7","doi-asserted-by":"crossref","unstructured":"S. Abiteboul and V. Vianu, Computing with first-order logic, J. Comput. System Sci., to appear","DOI":"10.1006\/jcss.1995.1025"},{"key":"10.1016\/0304-3975(95)00027-T_BIB8","series-title":"Proc. 10th ACM Symp. on Principles of Database Systems","article-title":"On datalog vs. polynomial time","author":"Afrati","year":"1991"},{"key":"10.1016\/0304-3975(95)00027-T_BIB9","series-title":"Admissible Sets and Structures","author":"Barwise","year":"1975"},{"key":"10.1016\/0304-3975(95)00027-T_BIB10","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. Symbolic Logic"},{"key":"10.1016\/0304-3975(95)00027-T_BIB11","series-title":"Model-Theoretic Logics","year":"1985"},{"key":"10.1016\/0304-3975(95)00027-T_BIB12","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/0022-0000(90)90022-D","article-title":"On uniformity within NC1","volume":"41","author":"Barrington","year":"1990","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00027-T_BIB13","series-title":"Proc. ACM Symp. on Principles of Programming Languages","first-page":"50","article-title":"Programming primitives for database languages","author":"Chandra","year":"1981"},{"issue":"2","key":"10.1016\/0304-3975(95)00027-T_BIB14","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0022-0000(80)90032-X","article-title":"Computable queries for relational databases","volume":"21","author":"Chandra","year":"1980","journal-title":"J. Comput. System Sci."},{"issue":"1","key":"10.1016\/0304-3975(95)00027-T_BIB15","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0022-0000(82)90012-5","article-title":"Structure and complexity of relational queries","volume":"25","author":"Chandra","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00027-T_BIB16","article-title":"Infinitary logic and inductive definability over finite structures, Tech. Report","author":"Dawar","year":"1991"},{"key":"10.1016\/0304-3975(95)00027-T_BIB17_1","series-title":"Proc. 3rd Internat. Conf. on Database Theory","first-page":"3","article-title":"Finite-model theory \u2014 a personal perspective","volume":"Vol. 470","author":"Fagin","year":"1990"},{"key":"10.1016\/0304-3975(95)00027-T_BIB17_2","first-page":"3","volume":"116","author":"Fagin","year":"1993"},{"key":"10.1016\/0304-3975(95)00027-T_BIB18","series-title":"Logic Colloquium '69","first-page":"361","article-title":"Algorithmic procedures, generalized turing algorithms, and elementary recursion theory","author":"Friedman","year":"1971"},{"key":"10.1016\/0304-3975(95)00027-T_BIB19","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(95)00027-T_BIB20","series-title":"Proc. 26th IEEE FOCS","first-page":"346","article-title":"Fixed-point extensions of first-order logic","author":"Gurevich","year":"1985"},{"key":"10.1016\/0304-3975(95)00027-T_BIB21","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0304-3975(95)00027-T_BIB22","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/S0019-9958(86)80029-8","article-title":"Relationalqueries computable in polynomial time","volume":"68","author":"Immerman","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(95)00027-T_BIB23","article-title":"Elements of relational database theory","volume":"Vol. B","author":"Kanellakis","year":"1990"},{"key":"10.1016\/0304-3975(95)00027-T_BIB24","series-title":"Proc. 19th ACM Symp. on Theory of Computing","first-page":"425","article-title":"The decision problem for the probabilities of higher-order properties","author":"Kolaitis","year":"1987"},{"key":"10.1016\/0304-3975(95)00027-T_BIB25","series-title":"Proc. 9th ACM Symp. on Principles of Database Systems","first-page":"61","article-title":"On the expressive power of Datalog: tools and a case study","author":"Kolaitis","year":"1990"},{"key":"10.1016\/0304-3975(95)00027-T_BIB26","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/0890-5401(92)90021-7","article-title":"Infinitary logics and 0\u20131 laws","volume":"98","author":"Kolaitis","year":"1992","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(95)00027-T_BIB27","series-title":"Proc. 7th IEEE Symp. on Logic in Comput. Sci.","first-page":"46","article-title":"Fixpoint vs. infinitary logic in finite-model theory","author":"Kolaitis","year":"1992"},{"key":"10.1016\/0304-3975(95)00027-T_BIB28","article-title":"Monotonic use of space and computational complexity over abstract structures","author":"Leivant","year":"1989"},{"key":"10.1016\/0304-3975(95)00027-T_BIB29","series-title":"The Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/0304-3975(95)00027-T_BIB30","series-title":"Finite-state Datalog automata and relational languages","author":"Shemesh","year":"1988"},{"key":"10.1016\/0304-3975(95)00027-T_BIB31","series-title":"Principles of Database and Knowledge Base Systems","author":"Ullman","year":"1988"},{"key":"10.1016\/0304-3975(95)00027-T_BIB32","series-title":"Proc. 14th ACM Symp. on Theory of Computing","first-page":"137","article-title":"The complexity of relational query languages","author":"Vardi","year":"1982"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759500027T?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759500027T?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T03:23:34Z","timestamp":1556508214000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759500027T"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,9]]}},"alternative-id":["030439759500027T"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00027-t","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}