Skip Navigation

Journal of Logic and Computation 2006 16(2):177-197; doi:10.1093/logcom/exi056
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Bezhanishvili, N.
Right arrow Articles by Cate, B. T.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Vol. 16 No. 2, © The Author, 2006. Published by Oxford University Press. All rights reserved.

Original Articles

Transfer Results for Hybrid Logic. Part I: The Case Without Satisfaction Operators

Nick Bezhanishvili1 and Balder Ten Cate2

1 ILLC, Universiteit van Amsterdam, Plantage, Muidergracht 24, 1018TV Amsterdam, The Netherlands. Email: nbezhani{at}science.uva.nl, 2 ISLA, Universiteit van Amsterdam, Kruislaan 403, 1098SJ, Amsterdam, The Netherlands. Email: balder.tencate{at}uva.nl

We define for every Kripke complete modal logic L its hybrid companion LH and investigate which properties transfer from L to LH. For a specific class of logics, we present a satisfiability-preserving translation from LH to L. We prove that for this class of logics, complexity, (uniform) interpolation, and finite axiomatization transfer from L to LH. We also provide examples showing that, in general, none of complexity, decidability, the finite model property or the Beth property transfer.

Keywords: Hybrid logic, modal logic, nominals, transfer


Received 23 December 2004.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.