The Method of Socratic Proofs for Modal Propositional Logics: K5, S4.2, S4.3, S4F,S4R,S4M and G

The aim of this paper is to present the method of Socratic proofs for seven modal propositional logics: K5, S4.2, S4.3, S4M, S4F, S4R and G. This work is an extension of [10] where the method was presented for the most common modal propositional logics: K, D, T, KB, K4, S4 and S5. Presented by Jacek Malinowski     

A1 is not a conservative extension of S4 but of S5

In [1], D. W. Hart and C. Mcginn considered two logics A1 and A2. These logics embody part of a tradition about a priori knowledge and necessity. They proved that A2 is a conservative extension of a well-known modal logic S5 but left the problem whether A1 is a conservative extension of S4 open. In this note, we shall show that A1 is not a conservative extension of S4 but of S5, and also correct an inadequate proof.     

Multimo dal Logics of Products of Topologies

We introduce the horizontal and vertical topologies on the product of topological spaces, and study their relationship with the standard product topology. We show that the modal logic of products of topological spaces with horizontal and vertical topologies is the fusion S4 ⊕ S4. We axiomatize the modal logic of products of spaces with horizontal, vertical, and standard product topologies.We prove that both of these logics are complete for the product of rational numbers ℚ × ℚ with the appropriate topologies. AMS subject classification : 03B45, 54B10 The last author’s research was supported by a Social Sciences and Humanities Research Council of Canada grant number: 725-2000-2237. Presented by Melvin Fitting     

On Logics with Coimplication

This paper investigates (modal) extensions of Heyting–Brouwer logic, i.e., the logic which results when the dual of implication (alias coimplication) is added to the language of intuitionistic logic. We first develop matrix as well as Kripke style semantics for those logics. Then, by extending the Gödel-embedding of intuitionistic logic into S4 , it is shown that all (modal) extensions of Heyting–Brouwer logic can be embedded into tense logics (with additional modal operators). An extension of the Blok–Esakia-Theorem is proved for this embedding.     

Constructing a continuum of predicate extensions of each intermediate propositional logic

Wajsberg and Jankov provided us with methods of constructing a continuum of logics. However, their methods are not suitable for super-intuitionistic and modal predicate logics. The aim of this paper is to present simple ways of modification of their methods appropriate for such logics. We give some concrete applications as generic examples. Among others, we show that there is a continuum of logics (1) between the intuitionistic predicate logic and the logic of constant domains, (2) between a predicate extension ofS4 andS4 with the Barcan formula. Furthermore, we prove that (3) there is a continuum of predicate logics with equality whose equality-free fragment is just the intuitionistic predicate logic.Dedicated to the memory of the late Professor S. MaeharaThis research was supported in part by Grant-in Aid for Encouragement of Young Scientists No. 06740140, Ministry of Education, Science and Culture, Japan.Presented byHiroakira Ono     

On S

The sentential logic S extends classical logic by an implication-like connective. The logic was first presented by Chellas as the smallest system modelled by contraining the Stalnaker-Lewis semantics for counterfactual conditionals such that the conditional is effectively evaluated as in the ternary relations semantics for relevant logics. The resulting logic occupies a key position among modal and substructural logics. We prove completeness results and study conditions for proceeding from one family of logics to another.We are grateful to Peter Apostoli, Kosta Doen, and anonymous referees for their comments on an earlier version of this paper. A.F.'s work has been supported by a grant from the Volkswagen-Stiftung.Presented byJan Zygmunt     

Analytic Tableau Systems and Interpolation for the Modal Logics KB, KDB, K5, KD5

We give complete sequent-like tableau systems for the modal logics KB, KDB, K5, and KD5. Analytic cut rules are used to obtain the completeness. Our systems have the analytic superformula property and can thus give a decision procedure. Using the systems, we prove the Craig interpolation lemma for the mentioned logics.     

Pretabular varieties of modal algebras

We study modal logics in the setting of varieties of modal algebras. Any variety of modal algebras generated by a finite algebra — such, a variety is called tabular — has only finitely many subvarieties, i.e. is of finite height. The converse does not hold in general. It is shown that the converse does hold in the lattice of varieties of K4-algebras. Hence the lower part of this lattice consists of tabular varieties only. We proceed to show that there is a continuum of pretabular varieties of K4-algebras — those are the non-tabular varieties all of whose proper subvarieties are tabular — in contrast with Maksimova's result that there are only five pretabular varieties of S4-algebras.     

Refutations,Proofs, and Models in the Modal Logic K4

In this paper we study the method of refutation rules in the modal logic K4. We introduce refutation rules with certain normal forms that provide a new syntactic decision procedure for this logic. As corollaries we obtain such results for the following important extensions: S4, the provability logic G, and Grzegorczyk's logic. We also show that tree-type models can be constructed from syntactic refutations of this kind.     

Criteria for admissibility of inference rules. Modal and intermediate logics with the branching property

The main result of this paper is the following theorem: each modal logic extendingK4 having the branching property belowm and the effective m-drop point property is decidable with respect to admissibility. A similar result is obtained for intermediate intuitionistic logics with the branching property belowm and the strong effective m-drop point property. Thus, general algorithmic criteria which allow to recognize the admissibility of inference rules for modal and intermediate logics of the above kind are found. These criteria are applicable to most modal logics for which decidability with respect to admissibility is known and to many others, for instance, to the modal logicsK4,K4.1,K4.2,K4.3,S4.1,S4.2,GL.2; to all smallest and greatest counterparts of intermediate Gabbay-De-Jong logicsD _n; to all intermediate Gabbay-De-Jong logicsD _n; to all finitely axiomatizable modal and intermediate logics of finite depth etc. Semantic criteria for recognizing admissibility for these logics are offered as well.The results of this paper were obtained by the author during a stay at the Free University of Berlin with support of the Alexander von Humboldt Foundation in 1992 – 1993.Presented byWolfgang Rauntenberg     

Models for stronger normal intuitionistic modal logics

This paper, a sequel to Models for normal intuitionistic modal logics by M. Boi and the author, which dealt with intuitionistic analogues of the modal system K, deals similarly with intuitionistic analogues of systems stronger than K, and, in particular, analogues of S4 and S5. For these prepositional logics Kripke-style models with two accessibility relations, one intuitionistic and the other modal, are given, and soundness and completeness are proved with respect to these models. It is shown how the holding of formulae characteristic for particular logics is equivalent to conditions for the relations of the models. Modalities in these logics are also investigated.This paper presents results of an investigation of intuitionistic modal logic conducted in collaboration with Dr Milan Boi.     

Vagueness-Adaptive Logic: A Pragmatical Approach to Sorites Paradoxes

Kripke-completeness of every classical modal logic with Sahlqvist formulas is one of the basic general results on completeness of classical modal logics. This paper shows a Sahlqvist theorem for modal logic over the relevant logic Bin terms of Routley-Meyer semantics. It is shown that usual Sahlqvist theorem for classical modal logics can be obtained as a special case of our theorem.     

The <Emphasis Type="Italic">γ</Emphasis>-admissibility of Relevant Modal Logics I — The Method of Normal Models

The admissibility of Ackermann’s rule γ is one of the most important problems in relevant logic. While the γ-admissibility of normal modal logics based on the relevant logic R has been previously discussed, the case for weaker relevant modal logics has not yet been considered. The method of normal models has often been used to prove the γ-admissibility. This paper discusses which relevant modal logics admit γ from the viewpoint of the method of normal models.     

A uniform tableau method for intuitionistic modal logics I

We present tableau systems and sequent calculi for the intuitionistic analoguesIK, ID, IT, IKB, IKDB, IB, IK4, IKD4, IS4, IKB4, IK5, IKD5, IK45, IKD45 andIS5 of the normal classical modal logics. We provide soundness and completeness theorems with respect to the models of intuitionistic logic enriched by a modal accessibility relation, as proposed by G. Fischer Servi. We then show the disjunction property forIK, ID, IT, IKB, IKDB, IB, IK4, IKD4, IS4, IKB4, IK5, IK45 andIS5. We also investigate the relationship of these logics with some other intuitionistic modal logics proposed in the literature.Work carried out in the framework of the agreement between the Italian PT Administration and the Fondazione Ugo Bordoni.Presented byDov Gabbay     

Glivenko Type Theorems for Intuitionistic Modal Logics

In this article we deal with Glivenko type theorems for intuitionistic modal logics over Prior's MIPC. We examine the problems which appear in proving Glivenko type theorems when passing from the intuitionistic propositional logic Intto MIPC. As a result we obtain two different versions of Glivenko's theorem for logics over MIPC. Since MIPCcan be thought of as a one-variable fragment of the intuitionistic predicate logic Q-Int, one of the versions of Glivenko's theorem for logics over MIPCis closely related to that for intermediate predicate logics obtained by Umezawa [27] and Gabbay [15]. Another one is rather surprising.     

A Method of Generating Modal Logics Defining Jaśkowski’s Discussive Logic D<Subscript>2</Subscript>

Ja?kowski’s discussive logic D₂ was formulated with the help of the modal logic S5 as follows (see [7, 8]): \({A \in {D_{2}}}\) iff \({\ulcorner\diamond{{A}^{\bullet}}\urcorner \in {\rm S}5}\), where (–)^? is a translation of discussive formulae from For^d into the modal language. We say that a modal logic L defines D₂ iff \({{\rm D}_{2} = \{A \in {\rm For^{\rm d}} : \ulcorner\diamond{{A}^{\bullet}}\urcorner \in {\it L}\}}\). In [14] and [10] were respectively presented the weakest normal and the weakest regular logic which (?): have the same theses beginning with ‘\({\diamond}\)’ as S5. Of course, all logics fulfilling the above condition, define D₂. In [10] it was prowed that in the cases of logics closed under congruence the following holds: defining D₂ is equivalent to having the property (?). In this paper we show that this equivalence holds also for all modal logics which are closed under replacement of tautological equivalents (rte-logics).We give a general method which, for any class of modal logics determined by a set of joint axioms and rules, generates in the given class the weakest logic having the property (?). Thus, for the class of all modal logics we obtain the weakest modal logic which owns this property. On the other hand, applying the method to various classes of modal logics: rte-logics, congruential, monotonic, regular and normal, we obtain the weakest in a given class logic defining D₂.     

A Theory of Hypermodal Logics: Mode Shifting in Modal Logic

A hypermodality is a connective whose meaning depends on where in the formula it occurs. The paper motivates the notion and shows that hypermodal logics are much more expressive than traditional modal logics. In fact we show that logics with very simple K hypermodalities are not complete for any neighbourhood frames.     

Abstract modal logics

In this paper we develop a general framework to deal with abstract logics associated with a given modal logic. In particular we study the abstract logics associated with the weak and strong deductive systems of the normal modal logicK and its intuitionistic version. We also study the abstract logics that satisfy the conditionC ⁺(X)=C( _in I ⁿ X) and find the modal deductive systems whose abstract logics, in addition to being classical or intuitionistic, satisfy that condition. Finally we study the deductive systems whose abstract logics satisfy, in addition to the already mentioned properties, the property that the operatorC ⁺ is classical relative to some new defined operations.Work partially supported by Spanish DGICYT grant PB90-0465-C02-01.Presented byJan Zygmunt     

Model Existence in Non-Compact Modal Logic

Predicate modal logics based on Kwith non-compact extra axioms are discussed and a sufficient condition for the model existence theorem is presented. We deal with various axioms in a general way by an algebraic method, instead of discussing concrete non-compact axioms one by one.