A proposition is noncontingent, if it is necessarily true or it is necessarily false. In an epistemic context, ‘a proposition is noncontingent’ means that you know whether the proposition is true. In this paper, we study contingency logic with the noncontingency operator? but without the necessity operator 2. This logic is not a normal modal logic, because?→ is not valid. Contingency logic cannot define many usual frame properties, and its expressive power is weaker than that of basic modal logic over (...) classes of models without reflexivity. These features make axiomatizing contingency logics nontrivial, especially for the axiomatization over symmetric frames. In this paper, we axiomatize contingency logics over various frame classes using a novel method other than the methods provided in the literature, based on the ‘almost-definability’ schema AD proposed in our previous work. We also present extensions of contingency logic with dynamic operators. Finally, we compare our work to the related work in the fields of contingency logic and ignorance logic, where the two research communities have similar results but are apparently unaware of each other’s work. One goal of our paper is to bridge this gap. (shrink)

Contingency and accident are two important notions in philosophy and philosophical logic. Their meanings are so close that they are mixed up sometimes, in both daily life and academic research. This indicates that it is necessary to study them in a unified framework. However, there has been no logical research on them together. In this paper, we propose a language of a bimodal logic with these two concepts, investigate its model-theoretical properties such as expressivity and frame definability. We axiomatize this (...) logic over various classes of frames, whose completeness proofs are shown with the help of a crucial schema. The interactions between contingency and accident can sharpen our understanding of both notions. Then we extend the logic to a dynamic case: public announcements. By finding the required reduction axioms, we obtain a complete axiomatization, which gives us a good application to Moore sentences. (shrink)

The completeness of the axiomatization of contingency logic over symmetric frames has been thought of as a nontrivial job, the unimodal case of which cannot be generalized to the finitely multimodal case, which in turn cannot be generalized to the infinitely multimodal case. This paper deals with the completeness of symmetric contingency logic with unlimitedly many modalities, no matter whether the set of modalities is finite or infinite.

Operators can be compared in at least two respects: expressive strength and deductive strength. Inspired by Hintikka’s treatment of question embedding verbs, the variations of noncontingency operator, and also the various combinations of modal operators and Boolean connectives, we propose a logic with strong noncontingency operator as the only primitive modality. The novel operator is deductively but not expressively stronger than both noncontingency operator and essence operator, and expressively but not deductively weaker than the necessity operator. The frame-definability power of (...) this new logic is in between standard modal logic and noncontingency logic. A notion of bisimulation is proposed to characterize this logic within standard modal logic and first-order logic. Axiomatizations over various frame classes are presented, among which the minimal logic is related to the treatment of an alternative semantics of the agreement operator proposed by Lloyd Humberstone. (shrink)

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.

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)

This article proposes the axiomatizations of contingency logics of various natural classes of neighborhood frames. In particular, by defining a suitable canonical neighborhood function, we give sound and complete axiomatizations of monotone contingency logic and regular contingency logic, thereby answering two open questions raised by Bakhtiari, van Ditmarsch, and Hansen. The canonical function is inspired by a function proposed by Kuhn in 1995. We show that Kuhn’s function is actually equal to a related function originally given by Humberstone.

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.

Inspired by the supervenience-determined consequence relation and the semantics of agreement operator, we introduce a modal logic of supervenience, which has a dyadic operator of supervenience as a sole modality. The semantics of supervenience modality very naturally correspond to the supervenience-determined consequence relation, in a quite similar way that the strict implication corresponds to the inference-determined consequence relation. We show that this new logic is more expressive than the modal logic of agreement, by proposing a notion of bisimulation for the (...) latter. We provide a sound proof system for the new logic. We lift onto more general logics of supervenience. Related to this, we address an interesting open research direction listed in the literature, by comparing propositional logic of determinacy and noncontingency logic in expressive powers and axiomatizing propositional logic of determinacy over various classes of frames. We also obtain an alternative axiomatization for propositional logic of determinacy over universal models. (shrink)

The Temporal Experience of Pleasure Scale (TEPS) is a self-report instrument assessing pleasure experience. The present study aimed to confirm the factor model of the Chinese version of TEPS and test measurement invariance of the scale across gender in Chinese university students. Participants were 2977 (51% female) undergraduates aged from 16 to 27 years (Mean age = 18.9 years). Results indicated that the revised four-factor structure of the TEPS had acceptable fit in the total sample and in gender groups. Furthermore, (...) configural, metric and partial scalar invariance across gender were established. Two of the items (item 4 and 8) demonstrated different intercepts and women scored higher than men on both items. With partial scalar invariance demonstrated, test of differences in latent means indicated that men had lower levels of pleasure when compared with women. To our knowledge, this study is the first attempt to test the measurement invariance of the TEPS across gender, which provides support for future research that involves examining hedonic capacity in Chinese men and women. (shrink)

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)

In this work we define contingency logic with arbitrary announcement. In contingency logic, the primitive modality contingency formalises that a proposition may be true but also may be false, so that if it is non-contingent then it is necessarily true or necessarily false. To this logic one can add dynamic operators to describe change of contingency. Our logic has operators for public announcement and operators for arbitrary public announcement, as in the dynamic epistemic logic called arbitrary public announcement logic. However, (...) our language primitive is the more suitable notion of public announcement whether, instead of the public announcement that. We compare the expressive power of our logic and its various fragments to related dynamic epistemic logics. We further present an axiomatisation and show its completeness by adapting a method to demonstrate completeness of arbitrary public announcement logic. Various extensions are also shown to be complete with respect to the corresponding frame classes. (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 this article, we study logics of unknown truths and false beliefs under neighborhood semantics. We compare the relative expressivity of the two logics. It turns out that they are incomparable over various classes of neighborhood models, and the combination of the two logics are equally expressive as standard modal logic over any class of neighborhood models. We propose morphisms for each logic, which can help us explore the frame definability problem, show a general soundness and completeness result, and generalize (...) some results in the literature. We axiomatize the two logics over various classes of neighborhood frames. Most importantly, by adopting the intersection semantics and the subset semantics in the literature, we extend the results to the case of public announcements, which gives us the desired reduction axioms and has good applications related to Moore sentences, successful formulas and self-refuting formulas. Also, we can say something about the comparative merits of the intersection semantics and the subset semantics. (shrink)

In a recent paper, Kit Fine presents some striking results concerning the logical properties of (first-order) ignorance, second-order ignorance and Rumsfeld ignorance. However, Rumsfeld ignorance is definable in terms of ignorance, which makes some existing results and the axiomatization problem trivial. A main reason is that the accessibility relations for the implicit knowledge operator contained in the packaged operators of ignorance and Rumsfeld ignorance are the same. In this work, we assume the two accessibility relations to be different so that (...) one of them is an arbitrary subset of the other. This will avoid the definability issue and retain most of the previous validities. The main results are axiomatizations over various proper bi-frame classes. Finally we apply our framework to analyze Fine’s results. (shrink)

In a recent work, Pizzi proposes a notion of dyadic non-contingency, and then gives an axiomatic system of dyadic non-contingency named \(\text {KD}\Delta ^2\), which is shown to be translationally equivalent to the deontic system KD and has the minimal system \(\text {K}\Delta \) of monadic contingency as a fragment. However, the reason why he defines dyadic non-contingency like that is unclear. In this article, inspired by the notion of relativized knowing-value in the literature, we give a plausible explanation for (...) this. We also show that \(\text {KD}\Delta ^2\) is _not_ sound with respect to the class of serial frames, and then correct a mistake in the previous-mentioned Pizzi’s work. (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)

Notions of unknown truths and unknowable truths are important in formal epistemology, which are related to each other in e.g. Fitch’s paradox of knowability. Although there have been some logical research on the notion of unknown truths and some philosophical discussion on the two notions, there seems to be no logical research on unknowable truths. In this paper, we propose a logic of unknowable truths, investigate the logical properties of unknown truths and unknowable truths, which includes the similarities of the (...) two notions and the relationship between the two notions, and axiomatize this logic. (shrink)