The paper aims at developing the idea that the standard operator of noncontingency, usually symbolized by Δ, is a special case of a more general operator of dyadic noncontingency Δ(−, −). Such a notion may be modally defined in different ways. The one examined in the paper is __Δ__(B, A) = df ◊B ∧ (A ⥽ B ∨ A ⥽ ¬B), where ⥽ stands for strict implication. The operator of dyadic contingency __∇__(B, A) is defined as the negation of __Δ__(B, (...) A). Possibility (◊A) may be then defined as __Δ__(A, A), necessity (□A) as __∇__(¬A, ¬A) and standard monadic noncontingency (__Δ__A) as __Δ__( \({\textsf{T}}\), A). In the second section it is proved that the deontic system KD is translationally equivalent to an axiomatic system of dyadic noncontingency named KDΔ 2, and that the minimal system KΔ of monadic contingency is a fragment of KDΔ 2. The last section suggests lines for further inquiries. (shrink)

This work concerns the use of operators for past and future contingency in Priorean temporal logic. We will develop a system named C_t, whose language includes a propositional constant and prove that (I) C_t is complete with respect to a certain class of general frames and (II) the usual operators for past and future necessity are definable in such system. Furthermore, we will introduce the extension C_t(lin) that can be interpreted on linear and transitive general frames. The theoretical result of (...) the current work is that contingency can be treated as a primitive notion in reasoning about temporal modalities. (shrink)

The deontic status of tautologies and contradictions is one of the major puzzles for authors of early works on deontic logic. It is well-known that von Wright addresses this problem by adopting a Principle of Deontic Contingency, which says that tautologies are not necessarily obligatory and contradictions are not necessarily forbidden. A more radical solution is proposed by Anderson within a reductionist approach to deontic logic and consists in restricting the range of application of deontic modalities to contingent propositions. Anderson’s (...) solution has not received much attention in the literature, despite reflecting a typical feature of ordinary deontic reasoning, where non-contingent propositions are rarely, if ever, taken into account. In the present article we explore some of its formal consequences, providing a taxonomy of the properties of the Andersonian operators of obligation and permission for contingent propositions, O′ and P′, in the class of normal alethic systems. (shrink)

This article concerns the metatheory of a class of modal logics whose language includes propositional constants of various kinds. The main novelties are the use of general frames with specific restrictions and the definition of the strict range of a formula. Many examples from the literature are treated within the framework provided and some traditional model-theoretic issues such as preservation results concerning the validity of formulas and definability results concerning frame properties are addressed.

The point of the present paper is to draw attention to some interesting similarities, as well as differences, between the approaches to the logic of noncontingency of Evgeni Zolin and of Claudio Pizzi. Though neither of them refers to the work of the other, each is concerned with the definability of a (normally behaving, though not in general truth-implying) notion of necessity in terms of noncontingency, standard boolean connectives and additional but non-modal expressive resources. The notion of definability involved is (...) different in the two cases (‘external’ for Zolin, ‘internal’ for Pizzi), as are the additional resources: infinitary conjunction in the case of Zolin, and for Pizzi, first, propositional quantification, and then, later, most ingeniously, the use of a propositional constant. As well as surveying and comparing of the work of these authors, the discussion includes some some novelties, such as the confirmation of a conjecture of Zolin’s (Theorem 2.7). (shrink)

This discussion explores the possibility of distinguishing a tighter notion of contrariety evident in the Square of Opposition, especially in its modal incarnations, than as that binary relation holding statements that cannot both be true, with or without the added rider ‘though can both be false’. More than one theorist has voiced the intuition that the paradigmatic contraries of the traditional Square are related in some such tighter way—involving the specific role played by negation in contrasting them—that distinguishes them from (...) other pairs of incompatible statements constructed from the same conceptual materials. Prominent among examples, these other nonstandard pairs are the ‘new contraries’ presented by Robert Blanché’s hexagon(s) of opposition. With special, though not exclusive, attention to these cases, we investigate whether contrariety in the distinguished sense can be captured by adding to the incompatibility condition the further demand that the pair of statements concerned can be represented as the results of applying some sentence operator to the content in its scope, for one of the pair, and, for the other, the application of that same operator to the negation of that content. For one of the two cases, a Blanché case, of nonstandard contrariety singled out for attention, the question of whether such a representation is available is settled at the end of Section 4, and then in a more satisfying way in Section 5, though for the other case, noticed by Peter Simons, the question remains open, after some tentative discussion in one subsection, 6.2, of an Appendix (Section 6). (shrink)

This paper investigates formal logics for reasoning about determinacy and independence. Propositional Dependence Logic D and Propositional Independence Logic I are recently developed logical systems, based on team semantics, that provide a framework for such reasoning tasks. We introduce two new logics L_D and L_I, based on Kripke semantics, and propose them as alternatives for D and I, respectively. We analyse the relative expressive powers of these four logics and discuss the way these systems relate to natural language. We argue (...) that L_D and L_I naturally resolve a range of interpretational problems that arise in D and I.We also obtain sound and complete axiomatizations for L_D and L_I . (shrink)

It is well known that no consistent normal modal logic contains (as theorems) both ♦A and ♦¬A (for any formula A). Here we observe that this claim can be strengthened to the following: for any formula A, either no consistent normal modal logic contains ♦A, or else no consistent normal modal logic contains ♦¬A.

As shown in Fan, there are some similarities/resemblances between contingency and accident. Given this, one may naturally ask if we can unify the two operators to manifest all of their similarities/resemblances. In this article, instead of looking at the interactions between the two operators like in Fan, we turn our attention to the resemblances between the two operators. We extend the unification method in Fan to the current setting. The main results include some model-theoretical ones, such as expressivity, frame definability, (...) bisimulation, and some axiomatization ones. (shrink)

In Fan's 2019 article, “Symmetric Contingency Logic with Unlimitedly Many Modalities”, it is left as an open question in Fan (2019b) how to (completely) axiomatize contingency logic over the class of symmetric and transitive frames, and conjectured that is the desired axiomatization. In the current article, we show that the conjecture is false, and then propose a desired axiomatization, thereby answering the open question. Beyond these results, we also present a family of axiomatizations of contingency logic over Kripke frames.

In this paper, we introduce a notion of ‘disjunctive ignorance’, which is a weak combination of two forms of ignorance in the literature. We propose a logical language with ‘disjunctive ignorance’ as a sole modality, explore the logical properties of this notion and its related notions, and axiomatize it over various frame classes. By finding suitable reduction axioms, we extend the results to the case of public announcements and apply it to Moore-like sentences.

We propose a logic of temporal contingency, which has operators of past and future contingency as primitive modalities. This logic is less expressive than standard temporal logic over the class of bidirectional frames, and cannot define some basic frame properties such as bidirectionality and transitivity. We present a minimal system based on two key ‘bridge axioms’ and a bimodal version of a so-called ‘almost definability’ schema in the literature. The completeness proof is highly nontrivial due to the requirement that the (...) canonical model be bidirectional. We then extend the results to the simplest dynamic case: public announcements. (shrink)