{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T09:03:48Z","timestamp":1773392628987,"version":"3.50.1"},"reference-count":4,"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":4119,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[2002,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>If <jats:italic>M<\/jats:italic> is a countable transitive model of <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S0022481200009105_inline1\"\/>, then for every real <jats:italic>x<\/jats:italic> there is a unique shortest iteration <jats:italic>j<\/jats:italic>: <jats:italic>M<\/jats:italic> \u2192 <jats:italic>N<\/jats:italic> with <jats:italic>x<\/jats:italic> \u2208 <jats:italic>N<\/jats:italic>, or none at all.<\/jats:p>","DOI":"10.2178\/jsl\/1190150288","type":"journal-article","created":{"date-parts":[[2007,12,13]],"date-time":"2007-12-13T14:16:54Z","timestamp":1197555414000},"page":"1344-1350","source":"Crossref","is-referenced-by-count":6,"title":["A uniqueness theorem for iterations"],"prefix":"10.1017","volume":"67","author":[{"given":"Paul","family":"Larson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200009105_ref001","first-page":"84","volume-title":"Mathematical logic and foundations of set theory (Proceedings of the international colloquium, Jerusalem, 1968)","author":"Jensen","year":"1970"},{"key":"S0022481200009105_ref003","doi-asserted-by":"publisher","DOI":"10.4064\/fm168-1-3"},{"key":"S0022481200009105_ref002","unstructured":"Larson P. , \u2119max with generic iterations, in preparation."},{"key":"S0022481200009105_ref004","doi-asserted-by":"publisher","DOI":"10.1515\/9783110804737"}],"container-title":["Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200009105","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,6]],"date-time":"2019-05-06T20:17:55Z","timestamp":1557173875000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200009105\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12]]},"references-count":4,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,12]]}},"alternative-id":["S0022481200009105"],"URL":"https:\/\/doi.org\/10.2178\/jsl\/1190150288","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,12]]}}}