{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T15:06:40Z","timestamp":1698073600650},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,8,1]],"date-time":"1991-08-01T00:00:00Z","timestamp":681004800000},"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":8021,"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":[[1991,8]]},"DOI":"10.1016\/0304-3975(91)90048-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:17:21Z","timestamp":1027657041000},"page":"75-95","source":"Crossref","is-referenced-by-count":15,"title":["An analysis of fixed-point queries on binary trees"],"prefix":"10.1016","volume":"85","author":[{"given":"Steven","family":"Lindell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(91)90048-7_BIB1","first-page":"110","article-title":"Universality of data retrieval languages","author":"Aho","year":"1979","journal-title":"Proc. 6th Symp. on the Principles of Programming Languages"},{"key":"10.1016\/0304-3975(91)90048-7_BIB2","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1109\/SFCS.1989.63543","article-title":"An optimal lower bound on the number of variables for graph identification","author":"Cai","year":"1989","journal-title":"Proc. 30th Ann. Symp. on the Foundations of Computer Science"},{"issue":"1","key":"10.1016\/0304-3975(91)90048-7_BIB3","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(91)90048-7_BIB4","series-title":"A Mathematical Introduction to Logic","author":"Enderton","year":"1972"},{"key":"10.1016\/0304-3975(91)90048-7_BIB5","first-page":"43","article-title":"Generalized first-order spectra and polynomial time recognizable sets","volume":"#7","author":"Fagin","year":"1974","journal-title":"Complexity of Computation, Proc. SIAM-AMS"},{"key":"10.1016\/0304-3975(91)90048-7_BIB6","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-010-2529-4","author":"Fraisse","year":"1973","journal-title":"Course in Mathematical Logic, Vol. 1: Relation and Logical Formula"},{"key":"10.1016\/0304-3975(91)90048-7_BIB7","unstructured":"Y. Gurevich, Logic and the challenge of computer science, in: E. Borger, ed., Current Trends in Theoretical Computer Science (Computer Science Press, Rockville, MD)."},{"key":"10.1016\/0304-3975(91)90048-7_BIB8","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0168-0072(86)90055-2","article-title":"Fixed-point extensions of first-order logic","volume":"32","author":"Gurevich","year":"1986","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0304-3975(91)90048-7_BIB9","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1090\/S0002-9947-1965-0170805-7","article-title":"On the computational complexity of algorithms","volume":"117","author":"Hartmanis","year":"1965","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(91)90048-7_BIB10","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0304-3975(91)90048-7_BIB11","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/S0019-9958(86)80029-8","article-title":"Relational queries computable in polynomial time","volume":"68","author":"Immerman","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(91)90048-7_BIB12","series-title":"Ph.D. Dissertation","article-title":"The logical complexity of queries on unordered graphs","author":"Lindell","year":"1987"},{"key":"10.1016\/0304-3975(91)90048-7_BIB13","series-title":"Elementary Induction on Abstract Structures","author":"Moschovakis","year":"1974"},{"key":"10.1016\/0304-3975(91)90048-7_BIB14","series-title":"Ph.D. Dissertation","article-title":"Second-order and inductive definability on finite structures","author":"De Rougemont","year":"1983"},{"key":"10.1016\/0304-3975(91)90048-7_BIB15","first-page":"137","article-title":"Complexity of relational query languages","author":"Vardi","year":"1982","journal-title":"Proc. 14th ACM Symp. on the Theory of Computing"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397591900487?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397591900487?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:56:53Z","timestamp":1555077413000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397591900487"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,8]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,8]]}},"alternative-id":["0304397591900487"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90048-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,8]]}}}