Inspired by an interesting quotation from the literature, we propose four modalities, called ‘sane belief’, ‘insane belief’, ‘reliable belief’ and ‘unreliable belief’, and introduce logics with each operator as the modal primitive. We show that the four modalities constitute a square of opposition, which indicates some interesting relationships among them. We compare the relative expressivity of these logics and other related logics, including a logic of false beliefs from the literature. The four main logics are all less expressive than the (...) standard modal logic over various model classes, and the logics of sane and insane beliefs are, respectively, equally expressive as the logics of unreliable and reliable beliefs on any class of models. The logics of reliable and unreliable beliefs are then combined into a bimodal logic, which turns out to be equally expressive as the standard modal logic. Despite this, we cannot obtain a complete axiomatization of the minimal bimodal logic, by simply translating the axioms and rules of the minimal modal logic $\textbf{K}$ into the bimodal language. We then introduce a schematic modality which unifies reliable and unreliable beliefs and axiomatize it over the class of all frames and also the class of serial frames. This line of research is finally extended to unify sane and insane beliefs and some axiomatizations are given. (shrink)

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 this paper, a suitable notion of bisimulation is proposed for the bimodal logic with contingency and accident. We obtain several van Benthem Characterization Theorems, and axiomatize the bimodal logic over the class of Eulidean frames and over some more restricted classes, showing their strong completeness via a novel strategy, thereby answering two open questions raised in the literature. With the new bisimulation notion, we also correct an error in the expressivity results in the literature.

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)