{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T00:52:21Z","timestamp":1649033541783},"reference-count":1,"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":15533,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[1971,9]]},"abstract":"<jats:p>In his paper [1] Chang provides among other things answers to questions of the following type: Given two models <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S002248120008227X_inline1\" \/> and <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S002248120008227X_inline2\" \/> of powers <jats:italic>\u03b1<\/jats:italic> and <jats:italic>\u03b2<\/jats:italic>, respectively, what is the least <jats:italic>\u03bb<\/jats:italic> such that <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S002248120008227X_inline3\" \/> implies <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S002248120008227X_inline4\" \/> His proofs are by induction on the quantifier rank of formulas and they use an idea which in the case of ordinary first-order language goes back to Ehrenfeucht and Fra\u00efss\u00e9. But, as we show, one can easily prove that if <jats:italic>\u03bb<\/jats:italic> is big compared with <jats:italic>\u03ba<\/jats:italic> and with the cardinality of the universe of the structure <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S002248120008227X_inline1\" \/>, then every <jats:italic>L<jats:sub>\u221e\u03ba<\/jats:sub><\/jats:italic>-formula is equivalent modulo the set of all <jats:italic>L<jats:sub>\u03bb\u03ba<\/jats:sub><\/jats:italic>-sentences which hold in <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" xlink:type=\"simple\" xlink:href=\"S002248120008227X_inline1\" \/> to a <jats:italic>L<jats:sub>\u03bb\u03ba<\/jats:sub><\/jats:italic>-formula. From this, Chang's results follow immediately. The same method can be applied to similar problems concerning generalized languages.<\/jats:p>","DOI":"10.2307\/2269955","type":"journal-article","created":{"date-parts":[[2006,5,6]],"date-time":"2006-05-06T17:09:50Z","timestamp":1146935390000},"page":"461-462","source":"Crossref","is-referenced-by-count":1,"title":["A remark on infinitary languages"],"prefix":"10.1017","volume":"36","author":[{"given":"J\u00f6rg","family":"Flum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S002248120008227X_ref001","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0079681"}],"container-title":["Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S002248120008227X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T15:53:42Z","timestamp":1559318022000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S002248120008227X\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1971,9]]},"references-count":1,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1971,9]]}},"alternative-id":["S002248120008227X"],"URL":"https:\/\/doi.org\/10.2307\/2269955","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[1971,9]]}}}