{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T17:22:29Z","timestamp":1774977749486,"version":"3.50.1"},"reference-count":9,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2010,2,26]],"date-time":"2010-02-26T00:00:00Z","timestamp":1267142400000},"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 prove that every first-order formula that is invariant under quasi-injective bisimulations is equivalent to a formula of the hybrid logic <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" mimetype=\"image\" xlink:type=\"simple\" xlink:href=\"S1755020309990426_inf1\"\/>. Our proof uses a variation of the usual unravelling technique. We also briefly survey related results, and show in a standard way that it is undecidable whether a first-order formula is invariant under quasi-injective bisimulations.<\/jats:p>","DOI":"10.1017\/s1755020309990426","type":"journal-article","created":{"date-parts":[[2010,2,26]],"date-time":"2010-02-26T10:41:00Z","timestamp":1267180860000},"page":"247-261","source":"Crossref","is-referenced-by-count":2,"title":["A BISIMULATION CHARACTERIZATION THEOREM FOR HYBRID LOGIC WITH THE CURRENT-STATE BINDER"],"prefix":"10.1017","volume":"3","author":[{"given":"IAN","family":"HODKINSON","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"HICHAM","family":"TAHIRI","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2010,2,26]]},"reference":[{"key":"S1755020309990426_ref8","volume-title":"Modal Logic and Classical Logic","author":"van Benthem","year":"1985"},{"key":"S1755020309990426_ref3","first-page":"41","volume-title":"Advances in Modal Logic","author":"Blackburn","year":"1998"},{"key":"S1755020309990426_ref1","doi-asserted-by":"publisher","DOI":"10.2307\/2695090"},{"key":"S1755020309990426_ref2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107050884"},{"key":"S1755020309990426_ref5","volume-title":"Model Theory, Volume 42 of Encyclopedia of Mathematics and Its Applications","author":"Hodges","year":"1993"},{"key":"S1755020309990426_ref6","first-page":"407","volume-title":"The Theory of Models","author":"Karp","year":"1963"},{"key":"S1755020309990426_ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.jal.2005.06.010"},{"key":"S1755020309990426_ref7","unstructured":"ten Cate B. (2005). Model theory for extended modal languages. PhD Thesis, University of Amsterdam. ILLC Dissertation Series DS-2005-01."},{"key":"S1755020309990426_ref9","volume-title":"Exploring Logical Dynamics","author":"van Benthem","year":"1996"}],"container-title":["The Review of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1755020309990426","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T15:43:08Z","timestamp":1556466188000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1755020309990426\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,26]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["S1755020309990426"],"URL":"https:\/\/doi.org\/10.1017\/s1755020309990426","relation":{},"ISSN":["1755-0203","1755-0211"],"issn-type":[{"value":"1755-0203","type":"print"},{"value":"1755-0211","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,26]]}}}