Logic Journal of IGPL Advance Access published online on September 3, 2009
Logic Journal of IGPL, doi:10.1093/jigpal/jzp047
Logics of Kripke meta-models
Department of Computing and Mathematics, Manchester Metropolitan University, John Dalton Building, Chester Street, Manchester M1 5GD, U.K.
E-mail: S.Babenyshev{at}mmu.ac.uk
Department of Computing and Mathematics, Manchester Metropolitan University, John Dalton Building, Chester Street, Manchester M1 5GD, U.K.
E-mail: V.Rybakov{at}mmu.ac.uk
This paper introduces and studies a new type of logical construction, which allows to combine various non-classical propositional logics with the temporal or modal background. The possible candidates include (but are not restricted to) a number of epistemic, multi-agent, deontological and other well-studied logics. In this construction, that we call refinement, the Kripke structure of a chosen Kripke complete logic is imposed on clusters of the background transitive frame. Refinements fit in a wider framework of fibred logics, while having some unique features. First of all, when applied to classes of frames of Kripke complete logics, refinement preserves good meta-logical properties of constituent logics, in contrast with the well-known products of logics. Another advantage of refinements is that they allow for augmented languages of considerable expressive power, while preserving good meta-logical and semantical properties. In particular we show that refinement of logics preserves the effective finite model property and decidability for a wide class of constituent logics.
Key Words: fibred logics • multi-modal logics • decision algorithms • satisfiability • Kripke semantics
Received for publication 29 July 2009.
References
-
[1] Caleiro C, Carnielli WA, Rasga J, Sernadas C. Fibring of logics as a univrersal construction. In: Combination of Logics—Gabbay DM, Guenther F, eds. (2005) Kluwer. volume 13 of Handbook of Philosopical Logic.
[2] Coniglio M, Gabbay DM, Gouveia P, Sernadas C, Carnielli W. Analysis and Synthesis of Logics. How to Cut and Paste Reasoning Systems (2008) Springer. volume 35 of Applied Logic Series.
[3] Chagrov A, Zakharyaschev M. Modal Logic (1997) Oxford: Clarendon Press. volume 35 of Oxford Logic Guides.
[4] Fagin R, Halpern J, Moses Y, Vardi M. Reasoning About Knowledge (1995) The MIT Press.
[5] Gabbay DM. Selective filtration in modal logic. Theoria (1970) 36:323–330.[Web of Science]
[6] Gabbay DM. Fibred semantics and the weaving of logics, part 1: Modal and intuitionistic logics. The Journal of Symbolic Logic (1996) 61(4):1057–1120.[CrossRef]
[7] Gabbay DM, Kurucz Agi, Wolter Frank, Zakharyaschev Michael. Manydimensional modal logics: theory and applications (2003) 148. Elsevier Science. Studies in Logic.
[8] Lemmon EJ, Scott DS. An Introduction to Modal Logic (1977) Oxford: Blackwell.
[9] Rybakov VV. A criterion for admissibility of rules in the modal system S4 and the intuitionistic logic. Algebra and Logica (1984) 23(5):369–384.[CrossRef]
[10] Rybakov VV. Admissible Logical Inference Rules, volume 136 of Studies in Logic and the Foundations of Mathematics (1997) North-Holland: Elsevier Sci. Publ.
[11] Rybakov VV. Logical consecutions in discrete linear temporal logic. Journal of Symbolic Logic (2005) 70(4):1137–1149.[CrossRef][Web of Science]
[12] Rybakov VV. Logic of discovery in uncertain situations — deciding algorithms. In: Knowledge Based Intelligent Systems: KES2007 (2007) Springer. 950–958. volume 4693 of LNAI, Verti sul Mare.
[13] Segerberg K. Decidability of S4.1. Theoria (1968) 34:7–20.[Web of Science]
CiteULike 
Connotea 
Del.icio.us What's this?
| ||||||||||||||||||||||||||||||||||||||||||||||||