Axiomatizing hybrid logic using modal logic
نویسندگان
چکیده
We study hybrid logics with nominals and ‘actuality’ operators @i. We recall the method of ten Cate, Marx, and Viana to simulate hybrid logic using modalities and ‘nice’ frames, and we show that the hybrid logic of a class of frames is the modal logic of the class of its corresponding nice frames. Using these results, we show how to axiomatize the hybrid logic of any elementary class of frames. Then we study quasimodal logics, which are hybrid logics axiomatized by modal axioms together with basic hybrid axioms common to any hybrid logic, using only orthodox inference rules. We show that the hybrid logic of any elementary modally definable class of frames, or of any elementary class of frames closed under disjoint unions, bounded morphic images, ultraproducts and generated subframes, is quasimodal. We also show that the hybrid analogues of modal logics studied by McKinsey–Lemmon and Hughes are quasimodal.
منابع مشابه
Axiomatizing Modal Theories of Subset Spaces (An Example of the Power of Hybrid Logic)
This paper is about a synthesis of two quite different modal reasoning formalisms: the logic of subset spaces, and hybrid logic. Going beyond commonly considered languages we introduce names of objects involving sets and corresponding satisfaction operators. In this way we are able to completely axiomatize the theory of certain classes of subset spaces which are difficult to deal with purely mo...
متن کاملAxiomatizing Epistemic Logic of Friendship via Tree Sequent Calculus
This paper positively solves an open problem if it is possible to provide a Hilbert system to Epistemic Logic of Friendship (EFL) by Seligman, Girard and Liu. To find a Hilbert system, we first introduce a sound, complete and cut-free tree (or nested) sequent calculus for EFL, which is an integrated combination of Seligman’s sequent calculus for basic hybrid logic and a tree sequent calculus fo...
متن کاملAxiomatizing a Real-Valued Modal Logic
A many-valued modal logic is introduced that combines the standard (crisp) Kripke frame semantics of the modal logic K with connectives interpreted locally as abelian group operations over the real numbers. A labelled tableau system and a sequent calculus admitting cut elimination are then defined for this logic and used to establish completeness of an axiomatic extension of the multiplicative ...
متن کاملAxiomatizing Propositional Dependence Logics
We give sound and complete Hilbert-style axiomatizations for propositional dependence logic (PD), modal dependence logic (MDL), and extended modal dependence logic (EMDL) by extending existing axiomatizations for propositional logic and modal logic. In addition, we give novel labeled tableau calculi for PD, MDL, and EMDL. We prove soundness, completeness and termination for each of the labeled ...
متن کاملParaconsistent Modal Logics
We introduce a modal expansion of paraconsistent Nelson logic that is also as a generalization of the Belnapian modal logic recently introduced by Odintsov and Wansing. We prove algebraic completeness theorems for both logics, defining and axiomatizing the corresponding algebraic semantics. We provide a representation for these algebras in terms of twist-structures, generalizing a known result ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Applied Logic
دوره 8 شماره
صفحات -
تاریخ انتشار 2010