The extensions of the modal logic K5

1985 ◽  
Vol 50 (1) ◽  
pp. 102-109 ◽  
Author(s):  
Michael C. Nagle ◽  
S. K. Thomason

Our purpose is to delineate the extensions (normal and otherwise) of the propositional modal logic K5. We associate with each logic extending K5 a finitary index, in such a way that properties of the logics (for example, inclusion, normality, and tabularity) become effectively decidable properties of the indices. In addition we obtain explicit finite axiomatizations of all the extensions of K5 and an abstract characterization of the lattice of such extensions.This paper refines and extends the Ph.D. thesis [2] of the first-named author, who wishes to acknowledge his debt to Brian F. Chellas for his considerable efforts in directing the research culminating in [2] and [3]. We also thank W. J. Blok and Gregory Cherlin for observations which greatly simplified the proofs of Theorem 3 and Corollary 10.By a logic we mean a set of formulas in the countably infinite set Var of propositional variables and the connectives ⊥, →, and □ (other connectives being used abbreviatively) which contains all the classical tautologies and is closed under detachment and substitution. A logic is classical if it is also closed under RE (from A↔B infer □A ↔□B) and normal if it is classical and contains □ ⊤ and □ (P → q) → (□p → □q). A logic is quasi-classical if it contains a classical logic and quasi-normal if it contains a normal logic. Thus a quasi-normal logic is normal if and only if it is classical, and if and only if it is closed under RN (from A infer □A).

1992 ◽  
Vol 57 (4) ◽  
pp. 1230-1238 ◽  
Author(s):  
Xiaoping Wang

The canonicity and compactness of the KM system are problems historically important in the development of our understanding of intensional logic (as explained in Goldblatt's paper, The McKinsey axiom is not canonical). The problems, however, were unsolved for years in modal logic. In the beginning of 1990, Goldblatt showed that KM is not canonical in The McKinsey axiom is not canonical. The remaining task is to solve the problem of the compactness of KM. In this paper we present a proof showing that the KM system is not compact.The symbols of the language of propositional modal logic are as follows:1. A denumerably infinite set of sentence letters, for example, {p0, P1, p2, …};2. The Boolean connectives &, ⋁, ¬, →, ↔ and parentheses;3. The modal operators L and M where M is defined as ¬L¬.The formation rules of well-formed propositional modal formulae are the formation rules of formulae in classic propositional logic plus the following rule:If A is a well-formed formula, so is LA.A normal modal system is a set of formulae that contains all tautologies and the formulaand is closed under the following transformation rules:Uniform substitution. If A is a theorem, so is every substitution-instance of A.Modus ponens. If A and A → B are theorems, so is B.Necessitation. If A is a theorem, so is LA.Let L be a normal system. Then a set S of formulae is L-consistent if and only if for any formula B, which is the conjunction of some formulae in S, B is not included in L. A set S of formulae is maximal if and only if for every formula A, S either contains A or contains ¬A. A set S of formulae is maximal L-consistent if and only if it is both maximal and L-consistent.


ChemInform ◽  
2010 ◽  
Vol 26 (7) ◽  
pp. no-no
Author(s):  
O. AMIR ◽  
E. LIFSHITZ ◽  
C. UZAN-SAGUY ◽  
R. KALISH

Sign in / Sign up

Export Citation Format

Share Document