Andrzej Pietruszczak THE WEAKEST REGULAR MODAL LOGIC DEFINING JAŚKOWSKI ’ S LOGIC
نویسندگان
چکیده
Jaśkowski’s logic D2 was formulated with the help of the modal logic S5, [8]–[10]. It was shown (see [12], [16]) that to define D2 one could use normal modal logics weaker than S5. In the present paper we indicate a certain regular modal logic which also defines D2. This logic is the weakest regular modal logic defining D2.
منابع مشابه
Semantical Investigations on Some Weak Modal
In this paper we examine weak logics similar to S0.5[ Φ], where Φ ⊆ S0.5. We also examine their versions (one of which is S0.5rte[ Φ]) that are closed under replacement of tautological equivalents (rte). We have that: S0.5rte[ (K), (T)] ( S0.9, S0.5rte[ (X), (T)] ( S1, and in general, if Φ ⊆ E1, then S0.5rte[ Φ] ( S2. In the second part we shall give simplified semantics for these logics, formu...
متن کاملGeneralised Sequent Calculus for Propositional Modal Logics
The paper contains an exposition of some non standard approach to gentzenization of modal logics. The first section is devoted to short discussion of desirable properties of Gentzen systems and the short review of various sequential systems for modal logics. Two non standard, cut-free sequent systems are then presented, both based on the idea of using special modal sequents, in addition to usua...
متن کاملLabelled Tableau Calculi for Weak Modal Logics
Many normal and regular modal logics have simple formalizations in terms of labelled tableaux (cf. [3], [4]). But these modal logics have direct characterisation in terms of Kripke frames, and labels are naturally modelled on this kind of semantics. It is an interesting question whether this well known method can be extended to some congruent and monotonic modal logics, which are not characteri...
متن کاملSuhrawardi's Modal Syllogisms
Suhrawardi’s logic of the Hikmat al-Ishraq is basically modal. So to understand his modal logic one first has to know the non-modal part upon which his modal logic is built. In my previous paper ‘Suhrawardi on Syllogisms’(3) I discussed the former in detail. The present paper is an exposition of his treatment of modal syllogisms. On the basis of some reasonable existential presuppositi...
متن کاملSymbolic Model Checking of Non-regular Properties
This paper presents a symbolic model checking algorithm for Fixpoint Logic with Chop, an extension of the modal μ-calculus capable of defining non-regular properties. Some empirical data about running times of a naive implementation of this algorithm are given as well.
متن کامل