Skip Navigation



Journal of Logic and Computation Advance Access published online on January 8, 2008
Journal of Logic and Computation, doi:10.1093/logcom/exm078
This Article
Right arrow Full Text (PDF)
Right arrow References
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 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 Rybakov, V
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author, 2007. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Original papers

Multi-modal and Temporal Logics with Universal Formula---Reduction of Admissibility to Validity and Unification*

V Rybakov

Department of Computing and Mathematics, Manchester Metropolitan University, Manchester M1 5GD, UK.

E-mail: v.rybakov{at}mmu.ac.uk


  Abstract

The article studies multi-modal (in particular temporal, tense, logics) possessing universal formulas. We prove (Theorems 11 and 12) that the admissibility problem for inference rules (inference rules with parameters) is decidable for all decidable multi-modal (in particular, temporal) logics possessing an universal formula and decidable w.r.t. unification (unification with parameters). These theorems use characterizations of admissible rules in terms of valid rules and unifiable formulas. Results are applied to wide range of multi-modal logics, including all linear transitive temporal logics, all temporal logics with bounded zigzag, all multi-modal logics with explicit universal modality. As consequence, we show that the admissibility problem for all such logics is decidable (e.g. for all logics of the series S4nU, nisin N).

Keywords: Decidability; algorithms; logical consecutions; inference rules; temporal logic; linear temporal logic; admissible rules

*This research is supported by Engineering and Physical Sciences Research Council (EPSRC), U.K., grant EP/F014406/1


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.