{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T03:35:57Z","timestamp":1777692957856,"version":"3.51.4"},"reference-count":3,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T00:00:00Z","timestamp":1394582400000},"content-version":"unspecified","delay-in-days":6401,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[1996,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A countable, atomically stable structure <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S0022481200017230_inline1\"\/> in a finite, relational language has fewer than 2<jats:sup><jats:italic>\u03c9<\/jats:italic><\/jats:sup> non-isomorphic substructures if and only if <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S0022481200017230_inline1\"\/> is cellular. An example shows that the finiteness of the language is necessary.<\/jats:p>","DOI":"10.2307\/2275796","type":"journal-article","created":{"date-parts":[[2006,5,6]],"date-time":"2006-05-06T22:59:03Z","timestamp":1146956343000},"page":"985-1005","source":"Crossref","is-referenced-by-count":3,"title":["Stable structures with few substructures"],"prefix":"10.1017","volume":"61","author":[{"given":"Michael C.","family":"Laskowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laura L.","family":"Mayer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200017230_ref003","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1965-0175782-0"},{"key":"S0022481200017230_ref002","first-page":"876","volume":"51","author":"MacPherson","year":"1991","journal-title":"Binary relational structures having only countably many non-isomorphic substructures"},{"key":"S0022481200017230_ref001","doi-asserted-by":"publisher","DOI":"10.1007\/BF02760639"}],"container-title":["Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200017230","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T20:33:15Z","timestamp":1557693195000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200017230\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":3,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,9]]}},"alternative-id":["S0022481200017230"],"URL":"https:\/\/doi.org\/10.2307\/2275796","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,9]]}}}