{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T19:52:47Z","timestamp":1768679567485,"version":"3.49.0"},"reference-count":22,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"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":5982,"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":[[1997,3]]},"DOI":"10.1016\/s0304-3975(96)00015-1","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T19:53:40Z","timestamp":1051127620000},"page":"97-121","source":"Crossref","is-referenced-by-count":17,"title":["On winning strategies in Ehrenfeucht-Fra\u00efss\u00e9 games"],"prefix":"10.1016","volume":"174","author":[{"given":"Sanjeev","family":"Arora","sequence":"first","affiliation":[]},{"given":"Ronald","family":"Fagin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00015-1_BIB1","doi-asserted-by":"crossref","first-page":"113","DOI":"10.2307\/2274958","article-title":"Reachability is harder for directed than for undirected finite graphs","volume":"55","author":"Ajtai","year":"1990","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0304-3975(96)00015-1_BIB2","series-title":"Proc. 6th ACM Symp. on Principles of Database Systems","first-page":"214","article-title":"Bounds on the propagation of selection into logic programs","author":"Beeri","year":"1987"},{"key":"10.1016\/S0304-3975(96)00015-1_BIB3","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1976"},{"key":"10.1016\/S0304-3975(96)00015-1_BIB4","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\/S0304-3975(96)00015-1_BIB5","series-title":"Proc. 34th IEEE Symp. on Foundations of Computer Science","first-page":"52","article-title":"Logical reducibility and monadic NP","author":"Cosmadakis","year":"1993"},{"key":"10.1016\/S0304-3975(96)00015-1_BIB6","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1002\/malq.19870330107","article-title":"Second-order and inductive definability on finite structures","volume":"33","author":"de Rougemont","year":"1987","journal-title":"Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik"},{"key":"10.1016\/S0304-3975(96)00015-1_BIB7","doi-asserted-by":"crossref","first-page":"129","DOI":"10.4064\/fm-49-2-129-141","article-title":"An application of games to the completeness problem for formalized theories","volume":"49","author":"Ehrenfeucht","year":"1961","journal-title":"Fund. Math."},{"key":"10.1016\/S0304-3975(96)00015-1_BIB8","series-title":"A Mathematical Introduction to Logic","author":"Enderton","year":"1972"},{"key":"10.1016\/S0304-3975(96)00015-1_BIB9","first-page":"43","article-title":"Generalized first-order spectra and polynomial-time recognizable sets","volume":"Vol. 7","author":"Fagin","year":"1974"},{"key":"10.1016\/S0304-3975(96)00015-1_BIB10","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1002\/malq.19750210112","article-title":"Monadic generalized spectra","volume":"21","author":"Fagin","year":"1975","journal-title":"Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik"},{"key":"10.1016\/S0304-3975(96)00015-1_BIB11","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/2402.322390","article-title":"Degrees of acyclicity for hypergraphs and relational detabase schemes","volume":"30","author":"Fagin","year":"1983","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/S0304-3975(96)00015-1_BIB12","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1006\/inco.1995.1100","article-title":"On monadic NP vs. monadic co-NP","volume":"120","author":"Fagin","year":"1995","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(96)00015-1_BIB13","first-page":"35","article-title":"Sur quelques classifications des syst\u00e8mes de relations","volume":"1","author":"Fra\u00efss\u00e9","year":"1954","journal-title":"Publ. Sci. Univ. Alger. S\u00e9r. A"},{"key":"10.1016\/S0304-3975(96)00015-1_BIB14","series-title":"Logic Colloquium'81","first-page":"105","article-title":"On local and nonlocal properties","author":"Gaifman","year":"1982"},{"key":"10.1016\/S0304-3975(96)00015-1_BIB15","author":"Garey","year":"1979"},{"key":"10.1016\/S0304-3975(96)00015-1_BIB16","series-title":"The Theory of Models","first-page":"132","article-title":"Model-theoretic methods in the study of elementary logic","author":"Hanf","year":"1965"},{"key":"10.1016\/S0304-3975(96)00015-1_BIB17","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\/S0304-3975(96)00015-1_BIB18","first-page":"75","article-title":"Descriptive and computational complexity","volume":"Vol 38","author":"Immerman","year":"1989"},{"key":"10.1016\/S0304-3975(96)00015-1_BIB19","series-title":"Proc. 35th IEEE Symp. on Foundations of Computer Science","first-page":"614","article-title":"Graph connjectivity and monadic NP","author":"Schwentick","year":"1994"},{"key":"10.1016\/S0304-3975(96)00015-1_BIB20","series-title":"Mathematical Logic","author":"Shoenfield","year":"1967"},{"key":"10.1016\/S0304-3975(96)00015-1_BIB21","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0012-365X(84)90166-3","article-title":"On the definability of properties of finite graphs","volume":"49","author":"Tura\u0144","year":"1984","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(96)00015-1_BIB22","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:S0304397596000151?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596000151?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T08:57:16Z","timestamp":1555405036000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596000151"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":22,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["S0304397596000151"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00015-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}