{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T14:45:15Z","timestamp":1648910715285},"reference-count":8,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2010,3,22]],"date-time":"2010-03-22T00:00:00Z","timestamp":1269216000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Review of Symbolic Logic"],"published-print":{"date-parts":[[2010,6]]},"abstract":"<jats:p>We show that the bounded fragment of first-order logic and the hybrid language with \u2018downarrow\u2019 and \u2018at\u2019 operators are equally expressive even with polyadic modalities, but that their \u2018positive\u2019 fragments are equally expressive only for unary modalities.<\/jats:p>","DOI":"10.1017\/s1755020309990402","type":"journal-article","created":{"date-parts":[[2010,3,22]],"date-time":"2010-03-22T11:28:07Z","timestamp":1269257287000},"page":"279-286","source":"Crossref","is-referenced-by-count":0,"title":["THE BOUNDED FRAGMENT AND HYBRID LOGIC WITH POLYADIC MODALITIES"],"prefix":"10.1017","volume":"3","author":[{"given":"IAN","family":"HODKINSON","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2010,3,22]]},"reference":[{"key":"S1755020309990402_ref6","unstructured":"ten Cate B. (2005). Model theory for extended modal languages. PhD Thesis, University of Amsterdam."},{"key":"S1755020309990402_ref1","doi-asserted-by":"publisher","DOI":"10.2307\/2695090"},{"key":"S1755020309990402_ref2","first-page":"29","article-title":"Persistent and invariant formulas for outer extensions","volume":"20","author":"Feferman","year":"1968","journal-title":"Compositio Mathematica"},{"key":"S1755020309990402_ref3","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1966-11507-0"},{"key":"S1755020309990402_ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01181878"},{"key":"S1755020309990402_ref5","doi-asserted-by":"publisher","DOI":"10.1305\/ndjfl\/1168352661"},{"key":"S1755020309990402_ref8","volume-title":"Modal Logic and Classical Logic","author":"van Benthem","year":"1985"},{"key":"S1755020309990402_ref7","first-page":"339","volume-title":"Proceedings of Computer Science Logic 2005, Volume 3634 of Lecture Notes in Computer Science","author":"ten Cate","year":"2005"}],"container-title":["The Review of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1755020309990402","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T19:43:06Z","timestamp":1556480586000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1755020309990402\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,22]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["S1755020309990402"],"URL":"https:\/\/doi.org\/10.1017\/s1755020309990402","relation":{},"ISSN":["1755-0203","1755-0211"],"issn-type":[{"value":"1755-0203","type":"print"},{"value":"1755-0211","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3,22]]}}}