{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T00:12:01Z","timestamp":1704154321618},"reference-count":39,"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)00026-s","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:48:18Z","timestamp":1027644498000},"page":"67-99","source":"Crossref","is-referenced-by-count":10,"title":["On the expressive power of counting"],"prefix":"10.1016","volume":"149","author":[{"given":"St\u00e9phane","family":"Grumbach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christophe","family":"Tollu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00026-S_BIB1","series-title":"Proc. ACM Symp. on Theory of Computing","article-title":"Generic computation and its complexity","author":"Abiteboul","year":"1991"},{"key":"10.1016\/0304-3975(95)00026-S_BIB2","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)00026-S_BIB3","series-title":"Model Theoretic Logics","author":"Barwise","year":"1985"},{"key":"10.1016\/0304-3975(95)00026-S_BIB4","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\/0304-3975(95)00026-S_BIB5","series-title":"Proc. IEEE Foundations of Computer Science","first-page":"612","article-title":"An optimal lower bound on the number of variables for graph identification","author":"Cai","year":"1989"},{"key":"10.1016\/0304-3975(95)00026-S_BIB6","series-title":"Proc. IEEE Symp. of Logic in Computer Science","first-page":"20","article-title":"The expressive power of finitely many generalized quantifiers","author":"Dawar","year":"1994"},{"key":"10.1016\/0304-3975(95)00026-S_BIB7","article-title":"Infinitary logic and inductive definability over finite structures","author":"Dawar","year":"1994","journal-title":"Inform. Comput."},{"key":"10.1016\/0304-3975(95)00026-S_BIB8","series-title":"Proc. 8th ACM Symp. on Principles of Database Systems","first-page":"324","article-title":"Expressibility of bounded-arity fixed-point query hierarchies","author":"Dublish","year":"1989"},{"key":"10.1016\/0304-3975(95)00026-S_BIB9","doi-asserted-by":"crossref","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."},{"issue":"1","key":"10.1016\/0304-3975(95)00026-S_BIB10","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. Symbolic Logic"},{"key":"10.1016\/0304-3975(95)00026-S_BIB11","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(93)90218-I","article-title":"Finite model theory \u2014 a personal perspective","volume":"116","author":"Fagin","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00026-S_BIB12","series-title":"Proc. IEEE Symp. of Logic in Computer Science","first-page":"199","article-title":"Asymptotic probabilities of languages with generalized quantifiers","author":"Fayolle","year":"1993"},{"key":"10.1016\/0304-3975(95)00026-S_BIB13","first-page":"1","article-title":"Sur les classifications des syst\u00e8mes de relations","volume":"I","author":"Fra\u00efss\u00e9","year":"1954","journal-title":"Publ. Sci. Univ. Alger"},{"key":"10.1016\/0304-3975(95)00026-S_BIB14","series-title":"Proc. Herbrand Symposium Logic Colloquium","first-page":"105","article-title":"On local and non local properties","author":"Gaifman","year":"1981"},{"key":"10.1016\/0304-3975(95)00026-S_BIB15","article-title":"Range and degree of realizability of formulas in the restricted predicate calculus","author":"Glebskii","year":"1969","journal-title":"Kibernetica"},{"key":"10.1016\/0304-3975(95)00026-S_BIB16","series-title":"Proc. of Computer Science Logic 92","first-page":"207","article-title":"Inductive definability with counting on finite structures","volume":"Vol. 702","author":"Gr\u00e4del","year":"1993"},{"key":"10.1016\/0304-3975(95)00026-S_BIB17","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/S0019-9958(83)80043-6","article-title":"Complexity of the first order theory of almost all structures","volume":"52","author":"Grandjean","year":"1983","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(95)00026-S_BIB18","series-title":"Proc. IEEE Foundations of Computer Science","article-title":"Fixed-point extensions of first order logic","author":"Gurevich","year":"1985"},{"key":"10.1016\/0304-3975(95)00026-S_BIB19","series-title":"Proc. Int. Conf. on Database Theory","first-page":"124","article-title":"Query languages with counters","volume":"Vol 646","author":"Grumbach","year":"1992"},{"key":"10.1016\/0304-3975(95)00026-S_BIB20","series-title":"Proc. IEEE Foundations of Computer Science","first-page":"210","article-title":"Algebras of feasible functions","author":"Gurevich","year":"1983"},{"key":"10.1016\/0304-3975(95)00026-S_BIB21","series-title":"Current Trends in Theoretical Computer Science","first-page":"1","article-title":"Logic and the challenge of computer science","author":"Gurevich","year":"1988"},{"key":"10.1016\/0304-3975(95)00026-S_BIB22","series-title":"Colloquium on Foundations of Mathematics, Mathematical Machines and their Applications","first-page":"31","article-title":"\u00dcber einen Quantifikator mit zwei Wirkungsbereichen","author":"Hartig","year":"1965"},{"key":"10.1016\/0304-3975(95)00026-S_BIB23","series-title":"Proc. 7th Symp. of Logic in Computer Science","article-title":"Logical hierarchies in PTIME","author":"Hella","year":"1992"},{"key":"10.1016\/0304-3975(95)00026-S_BIB24","series-title":"Complexity Theory Retrospective","first-page":"59","article-title":"Describing graphs: A first-order approach to graph canonization","author":"Immerman","year":"1990"},{"key":"10.1016\/0304-3975(95)00026-S_BIB25","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(95)00026-S_BIB26_1","first-page":"110","article-title":"Zero-one law for an extension of first-order predicate language","volume":"2","author":"Knyazev","year":"1990","journal-title":"Kybernetika"},{"key":"10.1016\/0304-3975(95)00026-S_BIB26_2","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/BF01068621","volume":"26","author":"Knyazev","year":"1990","journal-title":"Cybernetics"},{"key":"10.1016\/0304-3975(95)00026-S_BIB27","series-title":"Proc. 19th ACM Symp. on Theory of Computing","first-page":"425","article-title":"The decision problem for the probabilities of higher properties","author":"Kolaitis","year":"1987"},{"key":"10.1016\/0304-3975(95)00026-S_BIB28","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/0890-5401(90)90065-P","article-title":"0\u20131 laws and decision problems for fragments of second order logic","volume":"87","author":"Kolaitis","year":"1990","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(95)00026-S_BIB29","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)00026-S_BIB30","series-title":"Proc. 7th Symp. of Logic in Computer Science","first-page":"46","article-title":"Fixpoint logic vs. infinitary logic in finite model theory","author":"Kolaitis","year":"1992"},{"issue":"2","key":"10.1016\/0304-3975(95)00026-S_BIB31","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\/0304-3975(95)00026-S_BIB32","series-title":"Proc. 7th Symp. of Logic in Computer Science","article-title":"Generalized quantifiers and pebble games on finite structures","author":"Kolaitis","year":"1992"},{"key":"10.1016\/0304-3975(95)00026-S_BIB33","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1111\/j.1755-2567.1966.tb00600.x","article-title":"First order predicate logic with generalized quantifiers","volume":"32","author":"Lindstr\u00f6m","year":"1966","journal-title":"Theoria"},{"key":"10.1016\/0304-3975(95)00026-S_BIB34","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0003-4843(80)90014-5","article-title":"Almost sure theories","volume":"18","author":"Lynch","year":"1980","journal-title":"Ann. Math. Logic"},{"key":"10.1016\/0304-3975(95)00026-S_BIB35","doi-asserted-by":"crossref","first-page":"12","DOI":"10.4064\/fm-44-1-12-36","article-title":"On a generalization of quantifiers","volume":"44","author":"Mostowski","year":"1957","journal-title":"Fund. Math."},{"key":"10.1016\/0304-3975(95)00026-S_BIB36","series-title":"The expressive power of fixed-point logic with counting","author":"Otto","year":"1992"},{"key":"10.1016\/0304-3975(95)00026-S_BIB37","first-page":"373","article-title":"Plurality quantification","volume":"27","author":"Rescher","year":"1962","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(95)00026-S_BIB38","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:030439759500026S?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759500026S?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T23:44:26Z","timestamp":1704152666000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759500026S"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,9]]}},"alternative-id":["030439759500026S"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00026-s","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}