{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:38:36Z","timestamp":1787503116931,"version":"build-2736575974"},"reference-count":5,"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":6493,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[1996,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    The main result of this paper is a probabilistic construction of finite rigid structures. It yields a finitely axiomatizable class of finite rigid structures where no\n                    <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S0022481200017424_inline1\"\/>\n                    formula with counting quantifiers defines a linear order.\n                  <\/jats:p>","DOI":"10.2307\/2275675","type":"journal-article","created":{"date-parts":[[2006,5,6]],"date-time":"2006-05-06T18:58:29Z","timestamp":1146941909000},"page":"549-562","source":"Crossref","is-referenced-by-count":32,"title":["On finite rigid structures"],"prefix":"10.1017","volume":"61","author":[{"given":"Yuri","family":"Gurevich","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Saharon","family":"Shelah","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200017424_ref001","unstructured":"Dawar Anuj , Feasible computation through model theory, Ph.D. thesis , Institute for Research in Cognitive Science University of Pennsylvania, Philadelphia, 1993."},{"key":"S0022481200017424_ref003","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4478-3_5"},{"key":"S0022481200017424_ref005","doi-asserted-by":"crossref","unstructured":"Weinstein Scott , private correspondence, 10 1993.","DOI":"10.1177\/108056999305600203"},{"key":"S0022481200017424_ref002","first-page":"1","volume-title":"Current trends in theoretical computer science","author":"Gurevich","year":"1988"},{"key":"S0022481200017424_ref004","first-page":"64","volume-title":"Proceedings of the 7th IEEE Annual Symposium on Logic in Computer Science","author":"Stolboushkin","year":"1992"}],"container-title":["Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200017424","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T17:28:39Z","timestamp":1557682119000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200017424\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,6]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,6]]}},"alternative-id":["S0022481200017424"],"URL":"https:\/\/doi.org\/10.2307\/2275675","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,6]]}}}