{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T10:04:34Z","timestamp":1751882674207},"reference-count":8,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T00:00:00Z","timestamp":1394582400000},"content-version":"unspecified","delay-in-days":6645,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[1996,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We prove:<\/jats:p><jats:p>Theorem. <jats:italic>A complete first order theory in a countable language which is strictly stable, trivial and which admits finite coding has<\/jats:italic><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S0022481200016893_inline1\" \/><jats:italic>nonisomorphic countable models<\/jats:italic>.<\/jats:p><jats:p>Combined with the corresponding result or superstable theories from [4] our result confirms the Vaught conjecture for trivial theories which admit finite coding.<\/jats:p>","DOI":"10.2307\/2275816","type":"journal-article","created":{"date-parts":[[2006,5,6]],"date-time":"2006-05-06T22:59:54Z","timestamp":1146956394000},"page":"1279-1286","source":"Crossref","is-referenced-by-count":3,"title":["Countable models of trivial theories which admit finite coding"],"prefix":"10.1017","volume":"61","author":[{"given":"James","family":"Loveys","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Predrag","family":"Tanovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200016893_ref007","volume-title":"Classification theory and the number of nonisomorphic models","author":"Shelah","year":"1978"},{"key":"S0022481200016893_ref006","doi-asserted-by":"publisher","DOI":"10.1007\/BF01269944"},{"key":"S0022481200016893_ref003","volume":"54","author":"Hrushovski","year":"1989","journal-title":"Finitely based theories"},{"key":"S0022481200016893_ref002","doi-asserted-by":"publisher","DOI":"10.1007\/BF01627503"},{"key":"S0022481200016893_ref008","doi-asserted-by":"publisher","DOI":"10.1007\/BF02760651"},{"key":"S0022481200016893_ref005","doi-asserted-by":"publisher","DOI":"10.1007\/BF02760649"},{"key":"S0022481200016893_ref001","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07330-8"},{"key":"S0022481200016893_ref004","doi-asserted-by":"publisher","DOI":"10.1007\/BF01277487"}],"container-title":["Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200016893","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T19:59:29Z","timestamp":1557691169000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200016893\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,1]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1996,12]]}},"alternative-id":["S0022481200016893"],"URL":"https:\/\/doi.org\/10.2307\/2275816","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,1]]}}}