{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T21:01:36Z","timestamp":1648846896146},"reference-count":18,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T00:00:00Z","timestamp":1394582400000},"content-version":"unspecified","delay-in-days":6128,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[1997,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We show that no formula of first order logic using linear ordering and the logical relation<jats:italic>y<\/jats:italic>= 2<jats:italic>x<\/jats:italic>can define the property that the size of a finite model is divisible by 3. This answers a long-standing question which may be of relevance to certain open problems in circuit complexity.<\/jats:p>","DOI":"10.2307\/2275554","type":"journal-article","created":{"date-parts":[[2006,5,6]],"date-time":"2006-05-06T23:01:20Z","timestamp":1146956480000},"page":"661-672","source":"Crossref","is-referenced-by-count":1,"title":["<i>y<\/i>= 2<i>x<\/i>VS.<i>y<\/i>= 3<i>x<\/i>"],"prefix":"10.1017","volume":"62","author":[{"given":"Alexei","family":"Stolboushkin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Damian","family":"Niwi\u0144ski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200016431_ref018","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/512274.512284","article-title":"Algorithm 232: Heapsort","volume":"7","author":"Williams","year":"1964","journal-title":"Comm. ACM"},{"key":"S0022481200016431_ref015","article-title":"Counting modulo quantifiers on finite linearly ordered trees","author":"Nurmonen","year":"1996","journal-title":"Proceedings of the 11th LICS"},{"key":"S0022481200016431_ref014","volume-title":"Counter-free automata","author":"McNaughton","year":"1971"},{"key":"S0022481200016431_ref013","doi-asserted-by":"publisher","DOI":"10.1090\/psapm\/038\/1020810"},{"key":"S0022481200016431_ref012","doi-asserted-by":"publisher","DOI":"10.1137\/0216051"},{"key":"S0022481200016431_ref010","doi-asserted-by":"publisher","DOI":"10.1007\/BF01744431"},{"key":"S0022481200016431_ref009","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. Ser. A"},{"key":"S0022481200016431_ref007","doi-asserted-by":"publisher","DOI":"10.4064\/fm-49-2-129-141"},{"key":"S0022481200016431_ref006","first-page":"134","volume-title":"Bulletin of the EATCS","author":"Compton","year":"1992"},{"key":"S0022481200016431_ref005","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19600060105"},{"key":"S0022481200016431_ref011","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(84)80062-5"},{"key":"S0022481200016431_ref002","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(89)90037-8"},{"key":"S0022481200016431_ref001","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(83)90038-6"},{"key":"S0022481200016431_ref003","first-page":"47","article-title":"On uniformity within NC1","author":"Barrington","year":"1988","journal-title":"Structure in complexity theory: Third annual conference"},{"key":"S0022481200016431_ref017","first-page":"561","volume-title":"Proceedings of the 15th ICALP","author":"Straubing","year":"1989"},{"key":"S0022481200016431_ref008","first-page":"43","volume-title":"Complexity of computation","volume":"7","author":"Fagin","year":"1974"},{"key":"S0022481200016431_ref004","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(92)90014-A"},{"key":"S0022481200016431_ref016","first-page":"397","volume-title":"Proceedings of the MFCS","volume":"379","author":"P\u00e9ladeau","year":"1989"}],"container-title":["Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200016431","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,26]],"date-time":"2021-07-26T20:32:03Z","timestamp":1627331523000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200016431\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["S0022481200016431"],"URL":"https:\/\/doi.org\/10.2307\/2275554","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}