{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T08:20:31Z","timestamp":1775809231674,"version":"3.50.1"},"reference-count":32,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2014,1,15]],"date-time":"2014-01-15T00:00:00Z","timestamp":1389744000000},"content-version":"unspecified","delay-in-days":6254,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Bull. symb. log."],"published-print":{"date-parts":[[1996,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We introduce a new framework for classifying logics on finite structures and studying their expressive power. This framework is based on the concept of<jats:italic>almost everywhere equivalence of logics<\/jats:italic>, that is to say, two logics having the same expressive power on a class of asymptotic measure 1. More precisely, if<jats:italic>L, L\u2032<\/jats:italic>are two logics and<jats:italic>\u03bc<\/jats:italic>is an asymptotic measure on finite structures, then<jats:italic>L<\/jats:italic>\u2261<jats:sub>a.e.<\/jats:sub><jats:italic>L\u2032<\/jats:italic>(\u03bc) means that there is a class<jats:italic>C<\/jats:italic>of finite structures with<jats:italic>\u03bc(C)<\/jats:italic>= 1 and such that<jats:italic>L<\/jats:italic>and<jats:italic>L\u2032<\/jats:italic>define the same queries on<jats:italic>C<\/jats:italic>. We carry out a systematic investigation of \u2261<jats:sub>a.e.<\/jats:sub>with respect to the uniform measure and analyze the \u2261<jats:sub>a.e.<\/jats:sub>-equivalence classes of several logics that have been studied extensively in finite model theory. Moreover, we explore connections with descriptive complexity theory and examine the status of certain classical results of model theory in the context of this new framework.<\/jats:p>","DOI":"10.2307\/421173","type":"journal-article","created":{"date-parts":[[2006,5,7]],"date-time":"2006-05-07T07:09:31Z","timestamp":1146985771000},"page":"422-443","source":"Crossref","is-referenced-by-count":38,"title":["Almost Everywhere Equivalence of Logics in Finite Model Theory"],"prefix":"10.1017","volume":"2","author":[{"given":"Lauri","family":"Hella","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Phokion G.","family":"Kolaitis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kerkko","family":"Luosto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,1,15]]},"reference":[{"key":"S1079898600007745_ref019","doi-asserted-by":"publisher","DOI":"10.1137\/0216051"},{"key":"S1079898600007745_ref006","first-page":"160","article-title":"Infinitary logic and inductive definability over finite structures","volume":"119","author":"Dawar","year":"1995","journal-title":"Information and Control"},{"key":"S1079898600007745_ref024","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(94)00025-X"},{"key":"S1079898600007745_ref015","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(86)90055-2"},{"key":"S1079898600007745_ref028","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1995.523243"},{"key":"S1079898600007745_ref005","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(82)90012-5"},{"key":"S1079898600007745_ref029","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0022259"},{"key":"S1079898600007745_ref020","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(89)90055-2"},{"key":"S1079898600007745_ref009","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19750210112"},{"key":"S1079898600007745_ref007","first-page":"17","article-title":"On the evolution of random graphs","volume":"7","author":"Erd\u0151s","year":"1960","journal-title":"Publications of the Mathematical Institute of the Hungarian Academy of Sciences"},{"key":"S1079898600007745_ref026","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":"S1079898600007745_ref016","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1994.316088"},{"key":"S1079898600007745_ref025","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(92)90021-7"},{"key":"S1079898600007745_ref032","first-page":"137","volume-title":"Proceedings of the 14th ACM symposium on theory of computing","author":"Vardi","year":"1982"},{"key":"S1079898600007745_ref014","first-page":"1","volume-title":"Current trends in theoretical computer science","author":"Gurevich","year":"1988"},{"key":"S1079898600007745_ref003","doi-asserted-by":"publisher","DOI":"10.1137\/0209047"},{"key":"S1079898600007745_ref023","first-page":"168","volume-title":"Proceedings of the 5th IEEE symposium on logic in computer science","author":"Kolaitis","year":"1990"},{"key":"S1079898600007745_ref001","volume-title":"Foundations of databases","author":"Abiteboul","year":"1995"},{"key":"S1079898600007745_ref027","first-page":"191","volume-title":"Proceedings of the 8th IEEE symposium on logic in computer science","author":"Lynch","year":"1993"},{"key":"S1079898600007745_ref010","doi-asserted-by":"publisher","DOI":"10.1017\/S0022481200051756"},{"key":"S1079898600007745_ref012","first-page":"130","volume-title":"3rd ERCIM database research group workshop on updates and constraints handling in advanced database systems, ERCIM-94-W004 CNR","author":"Grumbach","year":"1992"},{"key":"S1079898600007745_ref031","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-1988-0924703-8"},{"key":"S1079898600007745_ref004","doi-asserted-by":"publisher","DOI":"10.1007\/BF01305232"},{"key":"S1079898600007745_ref030","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":"Fundamenda Mathematicae"},{"key":"S1079898600007745_ref002","first-page":"71","volume-title":"Proceedings of the 4th IEEE symposium on logic in computer science","author":"Abiteboul","year":"1989"},{"key":"S1079898600007745_ref021","doi-asserted-by":"publisher","DOI":"10.1090\/pspum\/034\/525336"},{"key":"S1079898600007745_ref022","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(85)90112-8"},{"key":"S1079898600007745_ref011","doi-asserted-by":"publisher","DOI":"10.1007\/BF01071084"},{"key":"S1079898600007745_ref008","first-page":"43","volume-title":"Complexity of computation","volume":"7","author":"Fagin","year":"1974"},{"key":"S1079898600007745_ref013","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0099486"},{"key":"S1079898600007745_ref017","article-title":"The hierarchy theorem for generalized quantifiers","author":"Hella","year":"1995","journal-title":"The Journal of Symbolic Logic"},{"key":"S1079898600007745_ref018","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(86)80029-8"}],"container-title":["Bulletin of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1079898600007745","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,4]],"date-time":"2024-02-04T07:35:51Z","timestamp":1707032151000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1079898600007745\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,12]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1996,12]]}},"alternative-id":["S1079898600007745"],"URL":"https:\/\/doi.org\/10.2307\/421173","relation":{},"ISSN":["1079-8986","1943-5894"],"issn-type":[{"value":"1079-8986","type":"print"},{"value":"1943-5894","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,12]]}}}