An incomplete nonnormal extension of S3

1978 ◽  
Vol 43 (2) ◽  
pp. 211-212
Author(s):  
George F. Schumm

Fine [1] and Thomason [4] have recently shown that the familiar relational semantics of Kripke [2] is inadequate for certain normal extensions of T and S4. It is here shown that the more general semantics developed by Kripke in [3] to handle nonnormal modal logics is likewise inadequate for certain of those logics.The interest of incompleteness results, such as those of Fine and Thomason, is of course a function of one's expectations. Define a “normal” logic too broadly and it is not surprising that a given semantics is not adequate for all normal logics. In the case of relational semantics, for example, one would want to require at least that a normal logic contain T, the logic determined by the class of all normal frames, and that it be closed under certain (though perhaps not all) rules of inference which are validity preserving in such frames. The adequacy of that semantics will otherwise be ruled out at the outset.For Kripke a logic is normal if it contains all tautologies, □p→p and □ (p → q)→(□p → □q), and is closed under the rules of substitution, modus ponens and necessitation (from A infer □A). T is the smallest normal logic, and this fact, together with the “naturalness” of the definition and the enormous number of normal logics which have been shown to be complete, made it plausible to suppose that Kripke's original semantics was adequate for all normal logics. That it is not is indeed surprising and would seem to reveal a genuine shortcoming.

2017 ◽  
Vol 46 (3/4) ◽  
Author(s):  
Krystyna Mruczek-Nasieniewska ◽  
Marek Nasieniewski

In [1] J.-Y. Bèziau formulated a logic called Z. Bèziau’s idea was generalized independently in [6] and [7]. A family of logics to which Z belongs is denoted in [7] by K. In particular; it has been shown in [6] and [7] that there is a correspondence between normal modal logics and logics from the class K. Similar; but only partial results has been obtained also for regular logics (see [8] and [9]). In (Došen; [2]) a logic N has been investigated in the language with negation; implication; conjunction and disjunction by axioms of positive intuitionistic logic; the right-to-left part of the second de Morgan law; and the rules of modus ponens and contraposition. From the semantical point of view the negation used by Došen is the modal operator of impossibility. It is known this operator is a characteristic of the modal interpretation of intuitionistic negation (see [3; p. 300]). In the present paper we consider an extension of N denoted by N+. We will prove that every extension of N+ that is closed under the same rules as N+; corresponds to a regular logic being an extension of the regular deontic logic D21 (see [4] and [13]). The proved correspondence allows to obtain from soundnesscompleteness result for any given regular logic containing D2, similar adequacy theorem for the respective extension of the logic N+.


Author(s):  
Frederik Van De Putte ◽  
Dominik Klein

AbstractWe study classical modal logics with pooling modalities, i.e. unary modal operators that allow one to express properties of sets obtained by the pointwise intersection of neighbourhoods. We discuss salient properties of these modalities, situate the logics in the broader area of modal logics (with a particular focus on relational semantics), establish key properties concerning their expressive power, discuss dynamic extensions of these logics and provide reduction axioms for the latter.


1984 ◽  
Vol 49 (1) ◽  
pp. 174-183 ◽  
Author(s):  
Raymond D. Gumb

In this paper, we establish an extended joint consistency theorem for an infinite family of free modal logics with equality. The extended joint consistency theorem incorporates the Craig and Lyndon interpolation lemmas and the Robinson joint consistency theorem. In part, the theorem states that two theories which are jointly unsatisfiable are separated by a sentence in the vocabulary common to both theories.Our family of free modal logics includes the free versions of I, M, and S4 studied by Leblanc [5, Chapters 8 and 9], supplemented with equality as in [3]. In the relational semantics for these logics, there is no restriction on the accessibility relation in I, while in M(S4) the restriction is reflexivity (refiexivity and transitivity). We say that a restriction on the accessibility relation countenances backward-looping if it implies a sentence of the form ∀x1 …xn(x1Rx2 &…&xn ⊃ xkRxj) (1 ≤ j < k ≤ n ≥ 2), where the xi (1 ≤ i ≤ n) are distinct individual variables. Just as reflexivity and transitivity do not countenance backward-looping, neither do any of the restrictions in our family of free modal logics. (The above terminology is derived from the effect of such restrictions on Kripke tableaux constructions.) The Barcan formula, its converse, the Fitch formula, and the formula T ≠ T′ ⊃ □T ≠ T′ do not hold in our logics.


Axioms ◽  
2021 ◽  
Vol 10 (3) ◽  
pp. 128
Author(s):  
Lorenz Demey

Aristotelian diagrams, such as the square of opposition, are well-known in the context of normal modal logics (i.e., systems of modal logic which can be given a relational semantics in terms of Kripke models). This paper studies Aristotelian diagrams for non-normal systems of modal logic (based on neighborhood semantics, a topologically inspired generalization of relational semantics). In particular, we investigate the phenomenon of logic-sensitivity of Aristotelian diagrams. We distinguish between four different types of logic-sensitivity, viz. with respect to (i) Aristotelian families, (ii) logical equivalence of formulas, (iii) contingency of formulas, and (iv) Boolean subfamilies of a given Aristotelian family. We provide concrete examples of Aristotelian diagrams that illustrate these four types of logic-sensitivity in the realm of normal modal logic. Next, we discuss more subtle examples of Aristotelian diagrams, which are not sensitive with respect to normal modal logics, but which nevertheless turn out to be highly logic-sensitive once we turn to non-normal systems of modal logic.


1983 ◽  
Vol 48 (4) ◽  
pp. 941-964 ◽  
Author(s):  
W.J. Blok ◽  
P. Köhler

A well-known result, going back to the twenties, states that, under some reasonable assumptions, any logic can be characterized as the set of formulas satisfied by a matrix 〈, F〉, where is an algebra of the appropriate type, and F a subset of the domain of , called the set of designated elements. In particular, every quasi-classical modal logic—a set of modal formulas, containing the smallest classical modal logic E, which is closed under the inference rules of substitution and modus ponens—is characterized by such a matrix, where now is a modal algebra, and F is a filter of . If the modal logic is in fact normal, then we can do away with the filter; we can study normal modal logics in the setting of varieties of modal algebras. This point of view was adopted already quite explicitly in McKinsey and Tarski [8]. The observation that the lattice of normal modal logics is dually isomorphic to the lattice of subvarieties of a variety of modal algebras paved the road for an algebraic study of normal modal logics. The algebraic approach made available some general results from Universal Algebra, notably those obtained by Jónsson [6], and thereby was able to contribute new insights in the realm of normal modal logics [2], [3], [4], [10].The requirement that a modal logic be normal is rather a severe one, however, and many of the systems which have been considered in the literature do not meet it. For instance, of the five celebrated modal systems, S1–S5, introduced by Lewis, S4 and S5 are the only normal ones, while only SI fails to be quasi-classical. The purpose of this paper is to generalize the algebraic approach so as to be applicable not just to normal modal logics, but to quasi-classical modal logics in general.


Author(s):  
Eugenio Orlandelli ◽  
Guido Gherardi

This paper introduces the logics of super-strict implications, where  a super-strict implication is  a strengthening of  C.I. Lewis' strict implication that avoids not only the paradoxes of material implication but also those of strict implication. The semantics of super-strict implications is obtained by strengthening the (normal) relational semantics for strict implication. We consider all logics of super-strict implications that are based on relational frames for modal logics in the  modal cube. it is shown that all  logics of super-strict implications are connexive logics in that they validate Aristotle's Theses and (weak) Boethius's Theses. A proof-theoretic characterisation of logics of super-strict implications is given by means of G3-style labelled calculi, and it is proved that the structural rules of inference are admissible in these calculi. It  is also shown that validity in the $$\mathsf{S5}$$-based logic of super-strict implications is equivalent to validity in  G. Priest's negation-as-cancellation-based  logic. Hence, we also   give a cut-free calculus for Priest's logic.


2019 ◽  
pp. 22-27
Author(s):  
Cenk Yavuz ◽  
Ceyda Aksoy Tırmıkç ◽  
Burcu Çarklı Yavuz

Today the number of office workers has reached to an enormous number due to the fast-growing technology. Most of these office workers spend long hours in enclosed spaces with little/no daylight penetration. The lack of daylight causes physiological and psychological problems with the workers. At this point lighting systems become prominent as the source and the solution of the problem. Photometric flicker event which arises in the lighting systems can sometimes become visible and brings a lot of issues with it. In this paper, an experimental work has been done to investigate the effect of flicker. For this purpose, the flicker values of 3 different experiment rooms for different lighting conditions and scenarios have been measured and a questionnaire study has been carried out in the experiment rooms with 30 participants. In conclusion, the effect of the flicker event on the volunteers have been classified and some methods have been proposed not to experience flicker effects.


Sign in / Sign up

Export Citation Format

Share Document