{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T17:29:42Z","timestamp":1772386182302,"version":"3.50.1"},"reference-count":11,"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":3023,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[2005,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We study the sets of the infinite sentences constructible with a dictionary over a finite alphabet, from the viewpoint of descriptive set theory. Among others, this gives some true co-analytic sets. The case where the dictionary is finite is studied and gives a natural example of a set at level \u03c9 of the Wadge hierarchy.<\/jats:p>","DOI":"10.2178\/jsl\/1129642123","type":"journal-article","created":{"date-parts":[[2007,12,19]],"date-time":"2007-12-19T16:22:06Z","timestamp":1198081326000},"page":"1210-1232","source":"Crossref","is-referenced-by-count":7,"title":["\u03c9-powers and descriptive set theory"],"prefix":"10.1017","volume":"70","author":[{"given":"Dominique","family":"Lecomte","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200006642_ref011","first-page":"377","volume-title":"New trends in formal languages, control, cooperation and combinatorics","volume":"1218","author":"Staiger","year":"1997"},{"key":"S0022481200006642_ref010","volume-title":"Handbook of formal languages","volume":"3","author":"Staiger","year":"1997"},{"key":"S0022481200006642_ref009","unstructured":"Simonnet P. , Automates et th\u00e9orie descriptive, Ph.D. thesis, Universit\u00e9 Paris 7, 03 1992."},{"key":"S0022481200006642_ref008","volume-title":"Descriptive set theory","author":"Moschovakis","year":"1980"},{"key":"S0022481200006642_ref007","first-page":"363","article-title":"A separation theorem for \u03a311 sets","volume":"260","author":"Louveau","year":"1980","journal-title":"Transactions of the American Mathematical Society"},{"key":"S0022481200006642_ref006","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107326019"},{"key":"S0022481200006642_ref005","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02308-2"},{"key":"S0022481200006642_ref004","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-97-03770-2"},{"key":"S0022481200006642_ref002","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00042-7"},{"key":"S0022481200006642_ref001","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00405-9"},{"key":"S0022481200006642_ref003","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4190-4"}],"container-title":["Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200006642","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T19:31:04Z","timestamp":1556911864000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200006642\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,12]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,12]]}},"alternative-id":["S0022481200006642"],"URL":"https:\/\/doi.org\/10.2178\/jsl\/1129642123","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,12]]}}}