This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Notes on neighborhood semantics for logics of unknown truths and false beliefs

Jie Fan
School of Humanities, University of Chinese Academy of Sciences
[email protected]
Abstract

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. Last but not least, we extend the results to the case of public announcements, which has good applications to Moore sentences and some others.

Keywords: unknown truths, false beliefs, accident, neighborhood semantics, morphisms, axiomatizations, expressivity, frame definability, intersection semantics

1 Introduction

This paper studies logics of unknown truths and false beliefs under neighborhood semantics. Intuitively, if pp is true but you do not know that pp, then you have an unknown truth that pp; if pp is false but you believe that pp, then you have a false belief that pp, or you are wrong about pp.

The notion of unknown truths is important in philosophy and formal epistemology. For instance, it is related to Verificationism, or ‘verification thesis’ [31]. Verificationism says that all truths can be known. However, from the thesis, the unknown truth of pp, formalized p¬Kpp\land\neg Kp, gives us a consequence that all truths are actually known. In other words, the notion gives rise to a well-known counterexample to Verificationism. This is the so-called Fitch’s ‘paradox of knowability’ [13].111For an excellent survey on Fitch’s paradox of knowability, we refer to [4]. To take another example: it gives rise to an important type of Moore sentences, which is essential to Moore’s paradox, which says that one cannot claim the paradoxical sentence “pp but I do not know it” [23, 18]. It is known that such a Moore sentence is unsuccessful and self-refuting (see, e.g. [19, 32, 33]).222To say a formula φ\varphi is successful, if it still holds after being announced, in symbol [φ]φ\vDash[\varphi]\varphi. Otherwise, we say this formula is unsuccessful. Moreover, to say φ\varphi is self-refuting, if its negation always holds after being announced, in symbol [φ]¬φ\vDash[\varphi]\neg\varphi.

In addition to the axiomatization for the logic of unknown truths on topological semantics [28], there has been various work on the metaphysical counterpart of unknown truths — accidental truths, or simply, ‘accident’. The notion of accidental truths traces back at least to Leibniz, in the name of ‘vérités de fait’ (factual truths), see e.g. [1, 17]. This notion is related to problem of future contingents, which is formalized by a negative form of accident [2]. Moreover, it is applied to reconstruct Gödel’s ontological argument (e.g. [26]), and also to provide an additional partial verification of the Boxdot Conjecture raised in [14] (also see [30]).

The logical investigation on the notion of accidental truths is initiated by Marcos, who axiomatizes a minimal logic of accident under relational semantics in [21], to differentiate ‘accident’ from ‘contingency’.333As for a recent survey on (non)contingency logic, we refer to [11]. The axiomatization is then simplified and its various extensions are presented in [27]. Symmetric accident logic is axiomatized in [6], and Euclidean accident logic is explored in [3].444In fact, [3] gave a complete axiomatization for strong noncontingency logic ()\mathcal{L}(\blacktriangle) over the class of Euclidean frames, thereby answering an open question posed in [10]. However, since as shown in [10], ()\mathcal{L}(\blacktriangle) is equally expressive as accident logic over the class of arbitrary models, thus one can translate the axiomatization of Euclidean strong noncontingency logic into an axiomatization of Euclidean accident logic. Some quite general soundness and completeness results can be found in [16]. Some relative expressivity results are obtained in [21, 6].

In comparison, the notion of false beliefs is popular in the area of cognitive science, see e.g. [24, 34]. For technical reasons, [29] proposes a logic that has the operator WW as a sole modality. There, WφW\varphi is read “the agent is wrong about φ\varphi”, and being wrong about φ\varphi means believing φ\varphi though φ\varphi is false. Complete axiomatizations of the minimal logic of false belief and its various extensions are given, and some results of frame definability are presented.

However, all this work are based on relational semantics. As the logics of unknown truths and false beliefs are non-normal (due to the non-normality of their modalities), it is then natural and interesting to investigate them from the perspective of neighborhood semantics.

Neighborhood semantics is independently proposed by Scott and Montague in 1970 [25, 22]. Since it is introduced, neighborhood semantics has become a standard semantics for investigating non-normal modal logics [5]. Partly inspired by [12], the authors of [15] proposes neighborhood semantics for logics of unknown truths and false beliefs. According to the semantics, “it is an unknown truth that φ\varphi” is interpreted as “φ\varphi is true and the proposition expressed by φ\varphi is not a neighborhood of the evaluated state”, and “it is a false belief that φ\varphi” as “φ\varphi is false and the proposition expressed by φ\varphi is a neighborhood of the evaluated state”. Beyond some invariance and negative results, a minimal logic of unknown truths under relational semantics, denoted 𝐁𝐊{\bf B_{K}} there, is shown to be sound and complete with respect to the class of filters, and a minimal logic of false beliefs under relational semantics, denoted 𝐀𝐊{\bf A_{K}} therein, is shown to be sound and complete with respect to the class of neighborhood frames that are closed under binary intersections and are negatively supplemented.

In this paper, in addition to explore the relative expressivity of logics of unknown truths and false beliefs over various classes of neighborhood models, we also axiomatize logics of unknown truths and false beliefs over various neighborhood frames. By defining notions of \bullet-morphisms and WW-morphisms, we obtain good applications to, e.g. frame (un)definability, a general soundness and completeness result, and some results that generalize those in [15] in a relative easy way. Moreover, we extend the results to the case of public announcements: by adopting the intersection semantics in the literature (which is a kind of neighborhood semantics for public announcements), we find suitable reduction axioms and thus complete proof systems, which, again, gives us good applications to some interesting questions. For instance, are Moore sentences self-refuting? How about the negation of Moore sentences? Are false beliefs of a fact successful formulas? Other natural questions also result, for instance, are all unknown truths themselves unknown truths? Are all false beliefs themselves are false beliefs?

As we will show in a proof-theoretical way, interestingly, under fairly weak assumption (namely, monotonicity), one’s false belief of a fact cannot be removed even after being told: if you have a false belief, then after someone tells you this, you still have the false belief. In other words, false beliefs of facts are all successful formulas. Different from the case in relational semantics, under neighborhood semantics, Moore sentences are not self-refuting in general. But the negation of Moore sentences are successful in the presence of monotonicity. Also, all unknown truths themselves unknown truths, but not all false beliefs themselves are false beliefs, indeed, none of false beliefs themselves are false beliefs.

The reminder of the paper is organized as follows. After reviewing the languages and their neighborhood semantics and some common neighborhood properties (Sec. 2), we compare the relative expressivity of the languages in Sec. 3. Sec. 4 proposes notions of \bullet-morphisms and WW-morphisms and exploit their applications. Sec. 5 axiomatizes the logics over various classes of neighborhood frames, which include a general soundness and completeness result shown via the notion of WW-morphisms. Sec. 6 extends the previous results to the case of public announcements, where by using intersection semantics for public announcements, we find suitable reduction axioms and complete axiomatizations, which gives us good applications to Moore sentences and some others. We conclude with some future work in Sec. 7.

2 Syntax and Semantics

Throughout this paper, we fix a nonempty set of propositional variables P and pPp\in\textbf{P}.

Definition 2.1.

The languages involved in the current paper include the following.

()φ::=p¬φφφφ(W)φ::=p¬φφφWφ(,W)φ::=p¬φφφφWφ()φ::=p¬φφφφ\begin{array}[]{ll}\mathcal{L}(\bullet)&\varphi::=p\mid\neg\varphi\mid\varphi\land\varphi\mid\bullet\varphi\\ \mathcal{L}(W)&\varphi::=p\mid\neg\varphi\mid\varphi\land\varphi\mid W\varphi\\ \mathcal{L}(\bullet,W)&\varphi::=p\mid\neg\varphi\mid\varphi\land\varphi\mid\bullet\varphi\mid W\varphi\\ \mathcal{L}(\Box)&\varphi::=p\mid\neg\varphi\mid\varphi\land\varphi\mid\Box\varphi\\ \end{array}

()\mathcal{L}(\bullet) is the language of the logic of unknown truths, (W)\mathcal{L}(W) is the language of the logic of false beliefs, (,W)\mathcal{L}(\bullet,W) is the language of the logic of unknown truths and false beliefs, and ()\mathcal{L}(\Box) is the language of epistemic/doxastic logic.

Intuitively, φ\bullet\varphi is read “it is an unknown truth that φ\varphi”, that is, “φ\varphi is true but unknown”, WφW\varphi is read “the agent is wrong about φ\varphi”, or “it is a false belief that φ\varphi”, that is, “φ\varphi is false but believed”, and φ\Box\varphi is read “it is known/believed that φ\varphi”. Other connectives are defined as usual; in particular, φ\circ\varphi is abbreviated as ¬φ\neg\bullet\varphi, read “it is known that φ\varphi once it is the case that φ\varphi”. In a philosophical context, φ\bullet\varphi, φ\circ\varphi, and φ\Box\varphi are read “it is accident (or accidentally true) that φ\varphi”, “it is essential that φ\varphi”, and “it is necessary that φ\varphi”, respectively.

All the above-mentioned languages are interpreted over neighborhood models.

Definition 2.2.

A (neighborhood) model is a triple =S,N,V\mathcal{M}=\langle S,N,V\rangle such that, SS is a nonempty set of states (or called ‘possible worlds’), NN is a neighborhood function from SS to 𝒫(𝒫(S))\mathcal{P}(\mathcal{P}(S)), and VV is a valuation function. Intuitively, XN(s)X\in N(s) means that XX is a neighborhood of ss. For any neighborhood model \mathcal{M} and state ss in \mathcal{M}, (,s)(\mathcal{M},s) is called a pointed (neighborhood) model. Without considering the valuation function, we obtain a (neighborhood) frame.

Given a neighborhood model =S,N,V\mathcal{M}=\langle S,N,V\rangle and a state sSs\in S, the semantics of the aforementioned languages is defined inductively as follows.

,spsV(p),s¬φ,sφ,sφψ,sφ and ,sψ,sφsφ and φN(s),sWφφN(s) and sφ,sφφN(s)\begin{array}[]{|lll|}\hline\cr\mathcal{M},s\vDash p&\Longleftrightarrow&s\in V(p)\\ \mathcal{M},s\vDash\neg\varphi&\Longleftrightarrow&\mathcal{M},s\nvDash\varphi\\ \mathcal{M},s\vDash\varphi\land\psi&\Longleftrightarrow&\mathcal{M},s\vDash\varphi\text{ and }\mathcal{M},s\vDash\psi\\ \mathcal{M},s\vDash\bullet\varphi&\Longleftrightarrow&s\in\varphi^{\mathcal{M}}\text{ and }\varphi^{\mathcal{M}}\notin N(s)\\ \mathcal{M},s\vDash W\varphi&\Longleftrightarrow&\varphi^{\mathcal{M}}\in N(s)\text{ and }s\notin\varphi^{\mathcal{M}}\\ \mathcal{M},s\vDash\Box\varphi&\Longleftrightarrow&\varphi^{\mathcal{M}}\in N(s)\\ \hline\cr\end{array}

Where φ={s,sφ}\varphi^{\mathcal{M}}=\{s\in\mathcal{M}\mid\mathcal{M},s\vDash\varphi\}.

It is easily computed that

,sφsφ implies φN(s).\begin{array}[]{lll}\mathcal{M},s\vDash\circ\varphi&\Longleftrightarrow&s\in\varphi^{\mathcal{M}}\text{ implies }\varphi^{\mathcal{M}}\in N(s).\\ \end{array}

Thus one may easily verify that φ(φ¬φ)\vDash\bullet\varphi\leftrightarrow(\varphi\land\neg\Box\varphi), Wφφ¬φ\vDash W\varphi\leftrightarrow\Box\varphi\land\neg\varphi, φ(φφ)\vDash\circ\varphi\leftrightarrow(\varphi\to\Box\varphi), which conform to the previous readings of φ\bullet\varphi, WφW\varphi, φ\circ\varphi, respectively. This indicates that the modalities \bullet, WW, \circ are all definable in the standard modal logic ()\mathcal{L}(\Box), and therefore ()\mathcal{L}(\Box) is at least as expressive as ()\mathcal{L}(\bullet) and also (W)\mathcal{L}(W) over any class of neighborhood models.

The neighborhood properties which we mainly focus on in this paper include the following.

Definition 2.3 (Neighborhood properties).

Let =S,N\mathcal{F}=\langle S,N\rangle be a neighborhood frame, and \mathcal{M} be a neighborhood model based on \mathcal{F}. For each sSs\in S and X,YSX,Y\subseteq S:

  1. (m)(m)

    N(s)N(s) is supplemented, or closed under supersets, if XN(s)X\in N(s) and XYX\subseteq Y implies YN(s)Y\in N(s). In this case, we also say that N(s)N(s) is monotone.

  2. (c)(c)

    N(s)N(s) is closed under (binary) intersections, if XN(s)X\in N(s) and YN(s)Y\in N(s) implies XYN(s)X\cap Y\in N(s).

  3. (n)(n)

    N(s)N(s) contains the unit, if SN(s)S\in N(s).

  4. (r)(r)

    N(s)N(s) contains its core, if N(s)N(s)\bigcap N(s)\in N(s).

The function NN possesses such a property, if N(s)N(s) has the property for all sSs\in S; \mathcal{F} has a property, if NN has. Frame \mathcal{F} is a filter, if \mathcal{F} has (m)(m), (c)(c) and (n)(n); \mathcal{F} is augmented, if \mathcal{F} has (m)(m) and (r)(r). Model \mathcal{M} has a property, if \mathcal{F} has such a property.

It is known that every augmented model is a filter, but not vice versa (see e.g. [5]).

3 Expressivity

This part compares the relative expressivity of ()\mathcal{L}(\bullet) and (W)\mathcal{L}(W). To begin with, we give the definition of expressivity.

Definition 3.1 (Expressivity).

Let 1\mathcal{L}_{1} and 2\mathcal{L}_{2} be two logical languages that are interpreted in the same class 𝕄\mathbb{M} of models,

  • 2\mathcal{L}_{2} is at least as expressive as 1\mathcal{L}_{1}, notation: 12\mathcal{L}_{1}\preceq\mathcal{L}_{2}, if for each formula φ\varphi in 1\mathcal{L}_{1}, there exists a formula ψ\psi in 2\mathcal{L}_{2} such that for each model \mathcal{M} in 𝕄\mathbb{M}, for each state ss in \mathcal{M}, we have that ,sφ\mathcal{M},s\vDash\varphi iff ,sψ\mathcal{M},s\vDash\psi.

  • 1\mathcal{L}_{1} is less expressive than 2\mathcal{L}_{2}, notation: 12\mathcal{L}_{1}\prec\mathcal{L}_{2}, if 12\mathcal{L}_{1}\preceq\mathcal{L}_{2} and 21\mathcal{L}_{2}\not\preceq\mathcal{L}_{1}.

  • 1\mathcal{L}_{1} and 2\mathcal{L}_{2} are equally expressive, if 12\mathcal{L}_{1}\preceq\mathcal{L}_{2} and 21\mathcal{L}_{2}\preceq\mathcal{L}_{1}.

  • 1\mathcal{L}_{1} and 2\mathcal{L}_{2} are incomparable (in expressivity), if 12\mathcal{L}_{1}\not\preceq\mathcal{L}_{2} and 21\mathcal{L}_{2}\not\preceq\mathcal{L}_{1}.

The following two propositions state that the languages ()\mathcal{L}(\bullet) and (W)\mathcal{L}(W) are incomparable over any model classes with the above neighborhood properties.

Proposition 3.2.

On the class of all models, the (m)(m)-models, the (c)(c)-models, the (n)(n)-models, the (r)(r)-models, ()\mathcal{L}(\bullet) is not at least as expressive as (W)\mathcal{L}(W).

Proof.

Consider the following models, where the only difference is N(s)=N(s){{t}}N^{\prime}(s)=N(s)\cup\{\{t\}\}, and an arrow from a state xx to a set XX means that XX is a neighborhood of xx:

{t}\textstyle{\{t\}}\textstyle{\mathcal{M}}s:¬p\textstyle{s:\neg p\ignorespaces\ignorespaces\ignorespaces\ignorespaces}{s,t}\textstyle{\{s,t\}}t:p\textstyle{t:p\ignorespaces\ignorespaces\ignorespaces\ignorespaces}\textstyle{\mathcal{M}^{\prime}}s:¬p\textstyle{s:\neg p\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}{s,t}\textstyle{\{s,t\}}t:p\textstyle{t:p\ignorespaces\ignorespaces\ignorespaces\ignorespaces}

It may be easily checked that both \mathcal{M} and \mathcal{M}^{\prime} have (m)(m), (c)(c), (n)(n) and (r)(r).

Moreover, (,s)(\mathcal{M},s) and (,s)(\mathcal{M}^{\prime},s) can be distinguished by an (W)\mathcal{L}(W)-formula: on the one hand, as p={t}N(s)p^{\mathcal{M}}=\{t\}\notin N(s), we have ,sWp\mathcal{M},s\nvDash Wp; on the other hand, since ,sp\mathcal{M}^{\prime},s\nvDash p and p={t}N(s)p^{\mathcal{M}^{\prime}}=\{t\}\in N^{\prime}(s), we infer that ,sWp\mathcal{M},s\vDash Wp.

However, these two pointed models cannot be distinguished by any ()\mathcal{L}(\bullet)-formulas. For this, we show a stronger result that for all φ()\varphi\in\mathcal{L}(\bullet), for all xSx\in S, ,xφ\mathcal{M},x\vDash\varphi iff ,xφ\mathcal{M}^{\prime},x\vDash\varphi, that is, φ=φ\varphi^{\mathcal{M}}=\varphi^{\mathcal{M}^{\prime}}. As the two models differs only in the neighborhood of ss, it suffices to show that ,sφ\mathcal{M},s\vDash\varphi iff ,sφ\mathcal{M}^{\prime},s\vDash\varphi, that is, sφs\in\varphi^{\mathcal{M}} iff sφs\in\varphi^{\mathcal{M}^{\prime}}. The proof goes with induction on φ\varphi, where the only case to treat is φ\bullet\varphi.

To begin with, suppose that ,sφ\mathcal{M},s\vDash\bullet\varphi, then sφs\in\varphi^{\mathcal{M}} and φN(s)\varphi^{\mathcal{M}}\notin N(s). By induction hypothesis, sφs\in\varphi^{\mathcal{M}^{\prime}} and φN(s)\varphi^{\mathcal{M}^{\prime}}\notin N(s). Since sφs\in\varphi^{\mathcal{M}^{\prime}}, it must be the case that φ{t}\varphi^{\mathcal{M}^{\prime}}\neq\{t\}, that is, φ{{t}}\varphi^{\mathcal{M}^{\prime}}\notin\{\{t\}\}, and thus φN(s){{t}}=N(s)\varphi^{\mathcal{M}^{\prime}}\notin N(s)\cup\{\{t\}\}=N^{\prime}(s). Therefore, ,sφ\mathcal{M}^{\prime},s\vDash\bullet\varphi.

Conversely, assume that ,sφ\mathcal{M}^{\prime},s\vDash\bullet\varphi, then sφs\in\varphi^{\mathcal{M}^{\prime}} and φN(s)\varphi^{\mathcal{M}^{\prime}}\notin N^{\prime}(s). As N(s)N(s)N(s)\subseteq N^{\prime}(s), by induction hypothesis, we infer that sφs\in\varphi^{\mathcal{M}} and φN(s)\varphi^{\mathcal{M}}\notin N(s). Therefore, ,sφ\mathcal{M},s\vDash\bullet\varphi.

Therefore, (W)()\mathcal{L}(W)\not\preceq\mathcal{L}(\bullet). ∎

Proposition 3.3.

On the class of all models, the (m)(m)-models, the (c)(c)-models, (n)(n)-models, the (r)(r)-models, (W)\mathcal{L}(W) is not at least as expressive as ()\mathcal{L}(\bullet).

Proof.

Consider the following models, where the only difference is that N(s)=N(s){{s}}N^{\prime}(s)=N(s)\cup\{\{s\}\}:

{s}\textstyle{\{s\}}\textstyle{\mathcal{M}}s:p\textstyle{s:p\ignorespaces\ignorespaces\ignorespaces\ignorespaces}{s,t}\textstyle{\{s,t\}}t:¬p\textstyle{t:\neg p\ignorespaces\ignorespaces\ignorespaces\ignorespaces}\textstyle{\mathcal{M}^{\prime}}s:p\textstyle{s:p\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}{s,t}\textstyle{\{s,t\}}t:¬p\textstyle{t:\neg p\ignorespaces\ignorespaces\ignorespaces\ignorespaces}

One may check that \mathcal{M} and \mathcal{M}^{\prime} both have (m)(m), (c)(c), (n)(n) and (r)(r).

One the one hand, (,s)(\mathcal{M},s) and (,s)(\mathcal{M}^{\prime},s) can be distinguished by an ()\mathcal{L}(\bullet)-formula, just noticing that ,sp\mathcal{M},s\vDash\bullet p (as ,sp\mathcal{M},s\vDash p but p={s}N(s)p^{\mathcal{M}}=\{s\}\notin N(s)) and ,sp\mathcal{M}^{\prime},s\nvDash\bullet p (since p={s}N(s)p^{\mathcal{M}^{\prime}}=\{s\}\in N^{\prime}(s)).

On the other hand, (,s)(\mathcal{M},s) and (,s)(\mathcal{M}^{\prime},s) cannot be distinguished by any (W)\mathcal{L}(W)-formulas. For this, we prove a stronger result that for all φ(W)\varphi\in\mathcal{L}(W), for all xSx\in S, ,xφ\mathcal{M},x\vDash\varphi iff ,xφ\mathcal{M}^{\prime},x\vDash\varphi, that is, φ=φ\varphi^{\mathcal{M}}=\varphi^{\mathcal{M}^{\prime}}. As the two models differs only in the neighborhood of ss, it is sufficient to demonstrate that ,sφ\mathcal{M},s\vDash\varphi iff ,sφ\mathcal{M}^{\prime},s\vDash\varphi. The proof continues with induction on φ\varphi, in which the only case to fix is WφW\varphi.

First, suppose that ,sWφ\mathcal{M},s\vDash W\varphi, then φN(s)\varphi^{\mathcal{M}}\in N(s) and sφs\notin\varphi^{\mathcal{M}}. Since N(s)N(s)N(s)\subseteq N^{\prime}(s), by induction hypothesis, we can obtain that φN(s)\varphi^{\mathcal{M}^{\prime}}\in N^{\prime}(s) and sφs\notin\varphi^{\mathcal{M}^{\prime}}, and thus ,sWφ\mathcal{M}^{\prime},s\vDash W\varphi.

For the other direction, assume that ,sWφ\mathcal{M}^{\prime},s\vDash W\varphi, then φN(s)\varphi^{\mathcal{M}^{\prime}}\in N^{\prime}(s) and sφs\notin\varphi^{\mathcal{M}^{\prime}}. As sφs\notin\varphi^{\mathcal{M}^{\prime}}, it must be the case that φ{s}\varphi^{\mathcal{M}^{\prime}}\neq\{s\}, that is, φ{{s}}\varphi^{\mathcal{M}^{\prime}}\notin\{\{s\}\}. Thus φN(s)\varphi^{\mathcal{M}^{\prime}}\in N(s). By induction hypothesis, we infer that φN(s)\varphi^{\mathcal{M}}\in N(s) and sφs\notin\varphi^{\mathcal{M}}, therefore ,sWφ\mathcal{M},s\vDash W\varphi.

Therefore, ()(W)\mathcal{L}(\bullet)\not\preceq\mathcal{L}(W). ∎

The following result follows immediately from Prop. 3.2 and Prop. 3.3.

Corollary 3.4.

On the class of all models, the (m)(m)-models, the (c)(c)-models, the (n)(n)-models, the (r)(r)-models, ()\mathcal{L}(\bullet) and (W)\mathcal{L}(W) are incomparable, and thus both logics are less expressive than (,W)\mathcal{L}(\bullet,W).

The result below states that (,W)\mathcal{L}(\bullet,W) is equally expressive as ()\mathcal{L}(\Box) over any class of neighborhood models. This extends the result in [9], where it is shown that the two logics are equally expressive over any class of relational models.

Proposition 3.5.

(,W)\mathcal{L}(\bullet,W) is equally expressive as ()\mathcal{L}(\Box) on any class of neighborhood models.

Proof.

Since φφ¬φ\vDash\bullet\varphi\leftrightarrow\varphi\land\neg\Box\varphi and Wφφ¬φ\vDash W\varphi\leftrightarrow\Box\varphi\land\neg\varphi, we have (,W)()\mathcal{L}(\bullet,W)\preceq\mathcal{L}(\Box).

Moreover, we demonstrate that φWφ(φφ)\vDash\Box\varphi\leftrightarrow W\varphi\vee(\circ\varphi\land\varphi), as follows. Given any neighborhood model =S,N,V\mathcal{M}=\langle S,N,V\rangle and sSs\in S, we have the following equivalences:

,sWφ(φφ),sWφ or ,sφφ(φN(s) and ,sφ) or (,sφ and ,sφ)(φN(s) and ,sφ) or ((,sφ implies φN(s)) and ,sφ)(φN(s) and ,sφ) or (,sφ and φN(s))φMN(s),sφ.\begin{array}[]{ll}&\mathcal{M},s\vDash W\varphi\vee(\circ\varphi\land\varphi)\\ \Longleftrightarrow&\mathcal{M},s\vDash W\varphi\text{ or }\mathcal{M},s\vDash\circ\varphi\land\varphi\\ \Longleftrightarrow&(\varphi^{\mathcal{M}}\in N(s)\text{ and }\mathcal{M},s\nvDash\varphi)\text{ or }(\mathcal{M},s\vDash\circ\varphi\text{ and }\mathcal{M},s\vDash\varphi)\\ \Longleftrightarrow&(\varphi^{\mathcal{M}}\in N(s)\text{ and }\mathcal{M},s\nvDash\varphi)\text{ or }((\mathcal{M},s\vDash\varphi\text{ implies }\varphi^{\mathcal{M}}\in N(s))\text{ and }\mathcal{M},s\vDash\varphi)\\ \Longleftrightarrow&(\varphi^{\mathcal{M}}\in N(s)\text{ and }\mathcal{M},s\nvDash\varphi)\text{ or }(\mathcal{M},s\vDash\varphi\text{ and }\varphi^{\mathcal{M}}\in N(s))\\ \Longleftrightarrow&\varphi^{M}\in N(s)\\ \Longleftrightarrow&\mathcal{M},s\vDash\Box\varphi.\end{array}

This implies that ()(,W)\mathcal{L}(\Box)\preceq\mathcal{L}(\bullet,W), and therefore (,W)\mathcal{L}(\bullet,W) is equally expressive as ()\mathcal{L}(\Box) on any class of neighborhood models. ∎

4 Morphisms and their applications

This section proposes notions of morphisms for ()\mathcal{L}(\bullet) and (W)\mathcal{L}(W), and some of their applications.

4.1 \bullet-morphisms

Definition 4.1 (\bullet-Morphisms).

Let =S,N,V\mathcal{M}=\langle S,N,V\rangle and =S,N,V\mathcal{M}^{\prime}=\langle S^{\prime},N^{\prime},V^{\prime}\rangle be neighborhood models. A function f:SSf:S\to S^{\prime} is a \bullet-morphism from \mathcal{M} to \mathcal{M}^{\prime}, if for all sSs\in S,

  • (Var)

    sV(p)s\in V(p) iff f(s)V(p)f(s)\in V(p) for all pPp\in\textbf{P};

  • (\bullet-Mor)

    for all XSX\subseteq S, [sX and XN(s)][f(s)f[X] and f[X]N(f(s))].[s\in X\text{ and }X\notin N(s)]\Longleftrightarrow[f(s)\in f[X]\text{ and }f[X]\notin N^{\prime}(f(s))].

We say that \mathcal{M}^{\prime} is a \bullet-morphic image of \mathcal{M}, if there is a surjective \bullet-morphism from \mathcal{M} to \mathcal{M}^{\prime}.

The following result indicates that the formulas of ()\mathcal{L}(\bullet) are invariant under \bullet-morphisms.

Proposition 4.2.

Let =S,N,V\mathcal{M}=\langle S,N,V\rangle and =S,N,V\mathcal{M}^{\prime}=\langle S^{\prime},N^{\prime},V^{\prime}\rangle be neighborhood models, and let ff be a \bullet-morphism from \mathcal{M} to \mathcal{M}^{\prime}. Then for all sSs\in S, for all φ()\varphi\in\mathcal{L}(\bullet), we have ,sφ,f(s)φ\mathcal{M},s\vDash\varphi\Longleftrightarrow\mathcal{M}^{\prime},f(s)\vDash\varphi, that is, f[φ]=φf[\varphi^{\mathcal{M}}]=\varphi^{\mathcal{M}^{\prime}}.

Proof.

By induction on φ\varphi. The nontrivial case is φ\bullet\varphi.

Suppose that ,sφ\mathcal{M},s\vDash\bullet\varphi, to show that ,f(s)φ\mathcal{M}^{\prime},f(s)\vDash\bullet\varphi. By supposition, sφs\in\varphi^{\mathcal{M}} and φN(s)\varphi^{\mathcal{M}}\notin N(s). By (\bullet-Mor), we have that f(s)f[φ]f(s)\in f[\varphi^{\mathcal{M}}] and f[φ]N(f(s))f[\varphi^{\mathcal{M}}]\notin N^{\prime}(f(s)). By induction hypothesis, this means that f(s)φf(s)\in\varphi^{\mathcal{M}^{\prime}} and φN(f(s))\varphi^{\mathcal{M}^{\prime}}\notin N^{\prime}(f(s)). Thus ,f(s)φ\mathcal{M}^{\prime},f(s)\vDash\bullet\varphi.

Conversely, assume that ,f(s)φ\mathcal{M}^{\prime},f(s)\vDash\bullet\varphi, to prove that ,sφ\mathcal{M},s\vDash\bullet\varphi. By assumption, f(s)φf(s)\in\varphi^{\mathcal{M}^{\prime}} and φN(f(s))\varphi^{\mathcal{M}^{\prime}}\notin N^{\prime}(f(s)). By induction hypothesis, this entails that f(s)f[φ]f(s)\in f[\varphi^{\mathcal{M}}] and f[φ]N(f(s))f[\varphi^{\mathcal{M}}]\notin N^{\prime}(f(s)). By (\bullet-Mor) again, we obtain that sφs\in\varphi^{\mathcal{M}} and φN(s)\varphi^{\mathcal{M}}\notin N(s). Therefore, ,sφ\mathcal{M},s\vDash\bullet\varphi. ∎

The notion of \bullet-morphisms can be applied to the following result in a relative easy way. Note that t+\mathcal{M}^{t^{+}} and t\mathcal{M}^{t^{-}} defined on [15, p. 254] are, respectively, the special cases of t+\mathcal{M}^{t^{+}} and t\mathcal{M}^{t^{-}} defined below when Γw=Sw\Gamma_{w}=S_{w}. Thus our result below is an extension of [15, Thm. 1.10].

Proposition 4.3.

Let =S,N,V\mathcal{M}=\langle S,N,V\rangle. For each wSw\in S and α()\alpha\in\mathcal{L}(\bullet), we have

,wα iff t+,wα\mathcal{M},w\vDash\alpha\text{ iff }\mathcal{M}^{t^{+}},w\vDash\alpha

and

,wα iff t,wα,\mathcal{M},w\vDash\alpha\text{ iff }\mathcal{M}^{t^{-}},w\vDash\alpha,

where t+=S,Nt+,V\mathcal{M}^{t^{+}}=\langle S,N^{t^{+}},V\rangle and t=S,Nt,V\mathcal{M}^{t^{-}}=\langle S,N^{t^{-}},V\rangle, where Nt+(w)=N(w)ΓwN^{t^{+}}(w)=N(w)\cup\Gamma_{w} and Nt(w)=N(w)\ΓwN^{t^{-}}(w)=N(w)\backslash\Gamma_{w}, in which ΓwSw={XSwX}\Gamma_{w}\subseteq S_{w}=\{X\subseteq S\mid w\notin X\}.

Proof.

By Prop. 4.2, it is sufficient to show that f:SSf:S\to S such that f(x)=xf(x)=x is a \bullet-morphism from \mathcal{M} to t+\mathcal{M}^{t^{+}}, and also a \bullet-morphism from \mathcal{M} to t\mathcal{M}^{t^{-}}.

The condition (Var) is clear. For (Mor), we need to show that

[wX and XN(w)][wX and XNt+(w)](1)[w\in X\text{ and }X\notin N(w)]\Longleftrightarrow[w\in X\text{ and }X\notin N^{t^{+}}(w)]~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}(1)

and

[wX and XN(w)][wX and XNt(w)](2).[w\in X\text{ and }X\notin N(w)]\Longleftrightarrow[w\in X\text{ and }X\notin N^{t^{-}}(w)]~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}(2).

The “\Longleftarrow” of (1) and “\Longrightarrow” of (2) follows directly from the fact that Nt(w)N(w)Nt+(w)N^{t^{-}}(w)\subseteq N(w)\subseteq N^{t^{+}}(w).

Moreover, given wXw\in X, according to the definition of SwS_{w}, we have XSwX\notin S_{w}, thus XΓwX\notin\Gamma_{w}. This follows that “\Longrightarrow” of (1) and “\Longleftarrow” of (2). ∎

Note that in the above proposition, as Γw\Gamma_{w} is defined in terms of ww, thus given any two points x,ySx,y\in S, Γx\Gamma_{x} may be different from Γy\Gamma_{y}. This point will be used frequently in the proofs below.

Now coming back to Prop. 3.2, instead of directly proving that ()\mathcal{L}(\bullet)-formulas cannot distinguish between (,s)(\mathcal{M},s) and (,s)(\mathcal{M}^{\prime},s), we can resort to Prop. 4.3, by just noticing that =t+\mathcal{M}^{\prime}=\mathcal{M}^{t^{+}} where Γs={{t}}\Gamma_{s}=\{\{t\}\} and Γt=\Gamma_{t}=\emptyset.555Note that Γs\Gamma_{s} is an arbitrary subset of SsS_{s}, and {t}Ss\{t\}\in S_{s} (as s{t}s\notin\{t\}), we thus can set Γs={{t}}\Gamma_{s}=\{\{t\}\}. Similar arguments apply for Γt\Gamma_{t} and other similar definitions of Γs\Gamma_{s} and Γt\Gamma_{t} in other situations below.

With Prop. 4.3, we immediately have the following corollary, which extends the result in [15, Coro. 1.11].

Corollary 4.4.

Let =S,N\mathcal{F}=\langle S,N\rangle, and t+=S,Nt+\mathcal{F}^{t^{+}}=\langle S,N^{t^{+}}\rangle and t=S,Nt\mathcal{F}^{t^{-}}=\langle S,N^{t^{-}}\rangle be defined as in Prop. 4.3. Then for all φ()\varphi\in\mathcal{L}(\bullet), we have

φ iff t+φ\mathcal{F}\vDash\varphi\text{ iff }\mathcal{F}^{t^{+}}\vDash\varphi

and

φ iff tφ.\mathcal{F}\vDash\varphi\text{ iff }\mathcal{F}^{t^{-}}\vDash\varphi.

It turns out that this corollary is quite useful in exploring the problem of frame (un)definability of ()\mathcal{L}(\bullet). A frame property PP is said to be definable in a language \mathcal{L}, if there exists a set Θ\Theta of formulas in \mathcal{L} such that Θ\mathcal{F}\vDash\Theta iff \mathcal{F} has PP. When Θ={φ}\Theta=\{\varphi\}, we write simply φ\varphi rather than {φ}\{\varphi\}.

To demonstrate the undefinability of a frame property PP in a language \mathcal{L}, we (only) need to construct two frames such that one of them has PP but the other fails, and any \mathcal{L}-formula is valid on one frame if and only if it is also valid on the other. The argument is as follows: were PP defined by a set of \mathcal{L}-formulas Θ\Theta, we would derive that Θ\mathcal{F}\vDash\Theta iff \mathcal{F} has PP. As any \mathcal{L}-formula is valid on one frame if and only if it is also valid on the other, this also applies to the set Θ\Theta. This implies that one frame has PP iff the other also has, which is a contradiction.

Proposition 4.5.

The frame properties (c)(c) and (r)(r) are undefinable in ()\mathcal{L}(\bullet).

Proof.

Consider the following frames:

{s}\textstyle{\{s\}}{t}\textstyle{\{t\}}{s}\textstyle{\{s\}}{t}\textstyle{\{t\}}\textstyle{\mathcal{F}}s\textstyle{s\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}t\textstyle{t\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}\textstyle{\mathcal{F}^{\prime}}s\textstyle{s\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}\textstyle{\emptyset}t\textstyle{t\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}

From the above figure, we can see that \mathcal{F}^{\prime} possesses (c)(c) and (r)(r) but \mathcal{F} does not, since {s}N(s)\{s\}\in N(s) and {t}N(s)\{t\}\in N(s) but {s}{t}=N(s)\{s\}\cap\{t\}=\emptyset\notin N(s).

Moreover, one may easily verify that =t+\mathcal{F}^{\prime}=\mathcal{F}^{t^{+}} in which Γs=Γt={}\Gamma_{s}=\Gamma_{t}=\{\emptyset\}, then by Coro. 4.4, we obtain that for all φ()\varphi\in\mathcal{L}(\bullet), we have φ\mathcal{F}\vDash\varphi iff φ\mathcal{F}^{\prime}\vDash\varphi. ∎

Proposition 4.6.

The frame property (m)(m) is undefinable in ()\mathcal{L}(\bullet).

Proof.

Consider the following frames:

{s}\textstyle{\{s\}}{s}\textstyle{\{s\}}\textstyle{\emptyset}\textstyle{\mathcal{F}}s\textstyle{s\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}{s,t}\textstyle{\{s,t\}}t\textstyle{t\ignorespaces\ignorespaces\ignorespaces\ignorespaces}\textstyle{\mathcal{F}^{\prime}}s\textstyle{s\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}{s,t}\textstyle{\{s,t\}}t\textstyle{t\ignorespaces\ignorespaces\ignorespaces\ignorespaces}

One may check that \mathcal{F} possesses (m)(m) whereas \mathcal{F}^{\prime} does not, since N(s)\emptyset\in N^{\prime}(s) but {t}N(s)\{t\}\notin N^{\prime}(s) although {t}\emptyset\subseteq\{t\}.

Besides, =t+\mathcal{F}^{\prime}=\mathcal{F}^{t^{+}} where Γs={}\Gamma_{s}=\{\emptyset\} and Γt=\Gamma_{t}=\emptyset. Then by Coro. 4.4, we derive that φ\mathcal{F}\vDash\varphi iff φ\mathcal{F}^{\prime}\vDash\varphi for all φ()\varphi\in\mathcal{L}(\bullet). ∎

Although the properties of (m)(m), (c)(c) and (r)(r) are undefinable in ()\mathcal{L}(\bullet), the property (n)(n) is definable in the language. This can be explained via Coro. 4.4 as follows: since for all ww in =S,N,V\mathcal{M}=\langle S,N,V\rangle, ww must be in SS, thus it must be the case that SΓwS\notin\Gamma_{w}, and this makes a suitable definition of Γw\Gamma_{w} in showing the undefinability as in Props. 4.5 and 4.6 unavailable.

Proposition 4.7.

The frame property (n)(n) is definable in ()\mathcal{L}(\bullet).

Proof.

We show that (n)(n) is defined by .\circ\top. Let =S,N\mathcal{F}=\langle S,N\rangle.

Suppose that \mathcal{F} has (n)(n), to show that \mathcal{F}\vDash\circ\top. For this, for any model \mathcal{M} based on \mathcal{F} and sSs\in S, we need to show that ,s\mathcal{M},s\vDash\circ\top, which amounts to showing that SN(s)S\in N(s) (because ,s\mathcal{M},s\vDash\top and =S\top^{\mathcal{M}}=S). And SN(s)S\in N(s) is immediate by supposition.

Conversely, assume that \mathcal{F} does not have (n)(n), then there exists sSs\in S such that SN(s)S\notin N(s), that is, N(s)\top^{\mathcal{M}}\notin N(s). We have also ,s\mathcal{M},s\vDash\top, and thus ,s\mathcal{M},s\nvDash\circ\top, therefore \mathcal{F}\nvDash\circ\top. ∎

4.2 WW-morphisms

Definition 4.8 (WW-morphisms).

Let =S,N,V\mathcal{M}=\langle S,N,V\rangle and =S,N,V\mathcal{M}^{\prime}=\langle S^{\prime},N^{\prime},V^{\prime}\rangle be neighborhood models. A function f:SSf:S\to S^{\prime} is a WW-morphism from \mathcal{M} to \mathcal{M}^{\prime}, if for all sSs\in S,

  1. (Var)

    sV(p)s\in V(p) iff sV(p)s^{\prime}\in V^{\prime}(p) for all pPp\in\textbf{P};

  2. (WW-Mor)

    for all XSX\subseteq S, [XN(s) and sX][f[X]N(f(s)) and f(s)f[X]].[X\in N(s)\text{ and }s\notin X]\Longleftrightarrow[f[X]\in N^{\prime}(f(s))\text{ and }f(s)\notin f[X]].

We say that \mathcal{M}^{\prime} is a WW-morphic image of \mathcal{M}, if there is a surjective WW-morphism from \mathcal{M} to \mathcal{M}^{\prime}.

Proposition 4.9.

Let =S,N,V\mathcal{M}=\langle S,N,V\rangle and =S,N,V\mathcal{M}^{\prime}=\langle S^{\prime},N^{\prime},V^{\prime}\rangle be neighborhood models, and let ff be a WW-morphism from \mathcal{M} to \mathcal{M}^{\prime}. Then for all sSs\in S, for all φ(W)\varphi\in\mathcal{L}(W), we have ,sφ,f(s)φ\mathcal{M},s\vDash\varphi\Longleftrightarrow\mathcal{M}^{\prime},f(s)\vDash\varphi, that is, f[φ]=φf[\varphi^{\mathcal{M}}]=\varphi^{\mathcal{M}^{\prime}}.

Proof.

By induction on φ\varphi, where the only nontrivial case is WφW\varphi.

Suppose that ,sWφ\mathcal{M},s\vDash W\varphi, to show that ,f(s)Wφ\mathcal{M}^{\prime},f(s)\vDash W\varphi. By supposition, φN(s)\varphi^{\mathcal{M}}\in N(s) and sφs\notin\varphi^{\mathcal{M}}. By (WW-Mor), f[φ]N(f(s))f[\varphi^{\mathcal{M}}]\in N^{\prime}(f(s)) and f(s)f[φ]f(s)\notin f[\varphi^{\mathcal{M}}]. By induction hypothesis, we infer that φN(f(s))\varphi^{\mathcal{M}^{\prime}}\in N^{\prime}(f(s)) and f(s)φf(s)\notin\varphi^{\mathcal{M}^{\prime}}, and thus ,f(s)Wφ\mathcal{M}^{\prime},f(s)\vDash W\varphi.

Conversely, assume that ,f(s)Wφ\mathcal{M}^{\prime},f(s)\vDash W\varphi, to prove that ,sWφ\mathcal{M},s\vDash W\varphi. By assumption, φN(f(s))\varphi^{\mathcal{M}^{\prime}}\in N^{\prime}(f(s)) and f(s)φf(s)\notin\varphi^{\mathcal{M}^{\prime}}. By induction hypothesis, we derive that f[φ]N(f(s))f[\varphi^{\mathcal{M}}]\in N^{\prime}(f(s)) and f(s)f[φ]f(s)\notin f[\varphi^{\mathcal{M}}]. Then by (WW-Mor) again, we get φN(s)\varphi^{\mathcal{M}}\in N(s) and sφs\notin\varphi^{\mathcal{M}}, and therefore ,sWφ\mathcal{M},s\vDash W\varphi. ∎

The models u+\mathcal{M}^{u^{+}} and u\mathcal{M}^{u^{-}} defined in [15, p. 262] are, respectively, the special cases of those defined in the following proposition, when Σw=Uw\Sigma_{w}=U_{w}. Therefore, the following proposition extends the result in [15, Thm. 2.8].

Proposition 4.10.

Let =S,N,V\mathcal{M}=\langle S,N,V\rangle. For all wSw\in S and α(W)\alpha\in\mathcal{L}(W), we have

,wα iff u+,wα\mathcal{M},w\vDash\alpha\text{ iff }\mathcal{M}^{u^{+}},w\vDash\alpha

and

,wα iff u,wα,\mathcal{M},w\vDash\alpha\text{ iff }\mathcal{M}^{u^{-}},w\vDash\alpha,

where u+=S,Nu+,V\mathcal{M}^{u^{+}}=\langle S,N^{u^{+}},V\rangle and u=S,Nu,V\mathcal{M}^{u^{-}}=\langle S,N^{u^{-}},V\rangle, where Nu+(w)=N(w)ΣwN^{u^{+}}(w)=N(w)\cup\Sigma_{w} and Nu(w)=N(w)\ΣwN^{u^{-}}(w)=N(w)\backslash\Sigma_{w} for ΣwUw={XSwX}\Sigma_{w}\subseteq U_{w}=\{X\subseteq S\mid w\in X\}.

Proof.

By Prop. 4.9, it suffices to show that f:SSf:S\to S such that f(x)=xf(x)=x is a WW-morphism from \mathcal{M} to u+\mathcal{M}^{u^{+}}, and also a WW-morphism from \mathcal{M} to u\mathcal{M}^{u^{-}}.

The condition (Var) is clear. For (WW-Mor), we only need to show that

[XN(w) and wX][XNu+(w) and wX](1)[X\in N(w)\text{ and }w\notin X]\Longleftrightarrow[X\in N^{u^{+}}(w)\text{ and }w\notin X]~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}(1)

and

[XN(w) and wX][XNu(w) and wX](2).[X\in N(w)\text{ and }w\notin X]\Longleftrightarrow[X\in N^{u^{-}}(w)\text{ and }w\notin X]~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}~{}(2).

The “\Longrightarrow” of (1) and “\Longleftarrow” of (2) are straightforward since Nu(w)N(w)Nu+(w)N^{u^{-}}(w)\subseteq N(w)\subseteq N^{u^{+}}(w).

Moreover, if wXw\notin X, then XUwX\notin U_{w}, thus XΣwX\notin\Sigma_{w}. This gives us “\Longleftarrow” of (1) and “\Longrightarrow” of (2). ∎

Similar to the case in Prop. 4.3, here Σw\Sigma_{w} is defined in terms of ww, thus given any two points x,ySx,y\in S, Σx\Sigma_{x} may be different from Σy\Sigma_{y}.

Now coming back to Prop. 3.3, without showing directly (W)\mathcal{L}(W)-formulas cannot distinguish between (,s)(\mathcal{M},s) and (,s)(\mathcal{M}^{\prime},s^{\prime}), we can appeal to Prop. 4.10, by noting that =u+\mathcal{M}^{\prime}=\mathcal{M}^{u^{+}} where Σs={{s}}\Sigma_{s}=\{\{s\}\} and Σt={{s,t}}\Sigma_{t}=\{\{s,t\}\}.666Note that since Σs\Sigma_{s} is an arbitrary subset of UsU_{s}, and {s}Us\{s\}\in U_{s} (as s{s}s\in\{s\}), then we can set Σs={{s}}\Sigma_{s}=\{\{s\}\}. Similar arguments also holds for Σt\Sigma_{t} and other definitions of Σs\Sigma_{s} and Σt\Sigma_{t} in other situations below. Prop. 4.10 will be also useful in proving a general completeness result (see Thm. 5.29).

With Prop. 4.10, we have immediately the following, which extends the result in [15, Coro. 2.9].

Corollary 4.11.

Let =S,N\mathcal{F}=\langle S,N\rangle, and u+=S,Nu+\mathcal{F}^{u^{+}}=\langle S,N^{u^{+}}\rangle and u=S,Nu\mathcal{F}^{u^{-}}=\langle S,N^{u^{-}}\rangle be defined as in Prop. 4.10. Then for all φ()\varphi\in\mathcal{L}(\circ), we have

φ iff u+φ\mathcal{F}\vDash\varphi\text{ iff }\mathcal{F}^{u^{+}}\vDash\varphi

and

φ iff uφ.\mathcal{F}\vDash\varphi\text{ iff }\mathcal{F}^{u^{-}}\vDash\varphi.

Similar to Coro. 4.4, Coro. 4.11 can also be applied to proving the results of frame (un)definability in (W)\mathcal{L}(W).

Proposition 4.12.

The frame properties (m)(m) and (n)(n) are undefinable in (W)\mathcal{L}(W).

Proof.

Consider the following frames:

\textstyle{\mathcal{F}}s\textstyle{s\ignorespaces\ignorespaces\ignorespaces\ignorespaces}\textstyle{\emptyset}\textstyle{\mathcal{F}^{\prime}}{s}\textstyle{\{s\}}s\textstyle{s\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}\textstyle{\emptyset}

One may check that \mathcal{F}^{\prime} has (m)(m) and (n)(n), but \mathcal{F} does not, since N(s)\emptyset\in N(s) but {s}N(s)\{s\}\notin N(s) although {s}\emptyset\subseteq\{s\}.

Moreover, =u+\mathcal{F}^{\prime}=\mathcal{F}^{u^{+}} where Σs={{s}}\Sigma_{s}=\{\{s\}\}. Then by Coro. 4.11, we conclude that for all φ(W)\varphi\in\mathcal{L}(W), φφ.\mathcal{F}\vDash\varphi\Longleftrightarrow\mathcal{F}^{\prime}\vDash\varphi.

Proposition 4.13.

The frame properties (c)(c) and (r)(r) are undefinable in (W)\mathcal{L}(W).

Proof.

Consider the following frames:

{t}\textstyle{\{t\}}{s}\textstyle{\{s\}}{t}\textstyle{\{t\}}\textstyle{\mathcal{F}}s\textstyle{s\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}{s,t}\textstyle{\{s,t\}}t\textstyle{t\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}\textstyle{\mathcal{F}^{\prime}}s\textstyle{s\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}{s,t}\textstyle{\{s,t\}}t\textstyle{t\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}

One may check that \mathcal{F} has (c)(c) and (r)(r), but \mathcal{F}^{\prime} fails, since {s}N(s)\{s\}\in N^{\prime}(s) and {t}N(s)\{t\}\in N^{\prime}(s) but {s}{t}=N(s)\{s\}\cap\{t\}=\emptyset\notin N^{\prime}(s).

Moreover, =u+\mathcal{F}^{\prime}=\mathcal{F}^{u^{+}} where Σs={{s}}\Sigma_{s}=\{\{s\}\} and Σt={{s,t}}\Sigma_{t}=\{\{s,t\}\}. Then by Coro. 4.11, we conclude that for all φ(W)\varphi\in\mathcal{L}(W), φφ.\mathcal{F}\vDash\varphi\Longleftrightarrow\mathcal{F}^{\prime}\vDash\varphi.

We conclude this part with another application of the notion of WW-morphisms. For this, we define the notion of transitive closure of a neighborhood frame, which comes from [15, Def. 2.12].

Definition 4.14.

Given a neighborhood frame =S,N\mathcal{F}=\langle S,N\rangle, we define its transitive closure tc=S,Ntc\mathcal{F}^{tc}=\langle S,N^{tc}\rangle inductively as ii\bigcup_{i\in\mathbb{N}}\mathcal{F}_{i}, with 0=\mathcal{F}_{0}=\mathcal{F} and i+1=S,Ni+1\mathcal{F}_{i+1}=\langle S,N_{i+1}\rangle, where

Ni+1(w)=Ni(w){mNi(X)XNi(w)}N_{i+1}(w)=N_{i}(w)\cup\{m_{N_{i}}(X)\mid X\in N_{i}(w)\}

for every wSw\in S, and

mNi(X)={zSXNi(z)}m_{N_{i}}(X)=\{z\in S\mid X\in N_{i}(z)\}

for XSX\subseteq S.

Fact 4.15.

[15, Fact 2.13] For all wSw\in S, if XNtc(w)\N(w)X\in N^{tc}(w)\backslash N(w), then wXw\in X.

The following proposition is shown in [15, Thm. 2.14], but without use of a morphism argument. Here we give a much easier proof via the notion of WW-morphisms.

Proposition 4.16.

Let =S,N,V\mathcal{M}=\langle S,N,V\rangle be a model based on a frame \mathcal{F} and tc\mathcal{M}^{tc} the corresponding one based on tc\mathcal{F}^{tc}. For all wSw\in S and φ(W)\varphi\in\mathcal{L}(W), we have

,wφ iff tc,wφ.\mathcal{M},w\vDash\varphi\text{ iff }\mathcal{M}^{tc},w\vDash\varphi.
Proof.

We show a stronger result: f:SSf:S\to S such that f(x)=xf(x)=x is a WW-morphism from \mathcal{M} to tc\mathcal{M}^{tc}. which implies the statement due to Prop. 4.9. The condition (Var) is straightforward.

For (WW-Mor), we need to show that

[XN(x) and xX][XNtc(x) and xX].[X\in N(x)\text{ and }x\notin X]\Longleftrightarrow[X\in N^{tc}(x)\text{ and }x\notin X].

The ‘\Longrightarrow’ follows immediately since N(x)Ntc(x)N(x)\subseteq N^{tc}(x). For the other direction, if XNtc(x) and xXX\in N^{tc}(x)\text{ and }x\notin X, by Fact 4.15, we obtain that XN(x)X\in N(x), as desired. ∎

5 Axiomatizations

We now axiomatize ()\mathcal{L}(\bullet) and (W)\mathcal{L}(W) over various neighborhood frames.

5.1 Axiomatizations for ()\mathcal{L}(\bullet)

The following lists the axioms and inference rules that are needed in this part.

AxiomsRulesPLAll instances of propositional tautologiesEφφMPφ,φψψMφφ(φψ)Cφψ(φψ)REφψφψN\begin{array}[]{lllll}\text{Axioms}&&&\text{Rules}\\ \texttt{PL}&\text{All instances of propositional tautologies}&&&\\ \circ\texttt{E}&\bullet\varphi\to\varphi&&\texttt{MP}&\dfrac{\varphi,\varphi\to\psi}{\psi}\\ \circ\texttt{M}&\circ\varphi\land\varphi\to\circ(\varphi\vee\psi)&&\\ \circ\texttt{C}&\circ\varphi\land\circ\psi\to\circ(\varphi\land\psi)&&\texttt{RE}\circ&\dfrac{\varphi\leftrightarrow\psi}{\circ\varphi\leftrightarrow\circ\psi}\\ \circ\texttt{N}&\circ\top&&\\ \end{array}

All axioms and inference rules arise in the literature, with distinct names, except for M\circ\texttt{M}, which is derivable from axiom (K1.2) in [21], that is, ((φφ)(ψψ))(φψ)((\varphi\land\circ\varphi)\vee(\psi\land\circ\psi))\to\circ(\varphi\vee\psi). Rather, a stronger rule φψ(φφ)(ψψ)\dfrac{\varphi\to\psi}{(\circ\varphi\land\varphi)\to(\circ\psi\land\psi)} (denoted RM\texttt{RM}\circ), has usually been used to replace axiom M\circ\texttt{M} (see e.g. [27, 16, 15]). But we prefer axioms to rules of inference. As we will see below, given RE\texttt{RE}\circ (and propositional calculus), the rule RM\texttt{RM}\circ is also derivable from M\circ\texttt{M}.

Proposition 5.1.

RM\texttt{RM}\circ is derivable from PL+MP+M+RE\texttt{PL}+\texttt{MP}+\circ\texttt{M}+\texttt{RE}\circ.

Proof.

We have the following proof sequences in PL+MP+M+RE\texttt{PL}+\texttt{MP}+\circ\texttt{M}+\texttt{RE}\circ:

(1)φψPremise(2)φψψ(1),PL,MP(3)(φψ)ψ(2),RE(4)φφ(φψ)M(5)φφψ(3),(4)(6)(φφ)(ψψ)(1),(5)\begin{array}[]{llll}(1)&\varphi\to\psi&&\text{Premise}\\ (2)&\varphi\vee\psi\leftrightarrow\psi&&(1),\texttt{PL},\texttt{MP}\\ (3)&\circ(\varphi\vee\psi)\leftrightarrow\circ\psi&&(2),\texttt{RE}\circ\\ (4)&\circ\varphi\land\varphi\to\circ(\varphi\vee\psi)&&\circ\texttt{M}\\ (5)&\circ\varphi\land\varphi\to\circ\psi&&(3),(4)\\ (6)&(\circ\varphi\land\varphi)\to(\circ\psi\land\psi)&&(1),(5)\\ \end{array}

If we consider all axioms and rules above, we obtain a logic called 𝐁𝐊{\bf B_{K}} in [27, 16, 15].777More precisely, the system 𝐁𝐊{\bf B_{K}} contains the rule RM\texttt{RM}\circ instead of the axiom M\circ\texttt{M}, and skips the rule RE\texttt{RE}\circ since it is then derivable from RM\texttt{RM}\circ and E\circ\texttt{E} (see [16, Prop. 3.2]). 𝐁𝐊{\bf B_{K}} is the minimal logic for ()\mathcal{L}(\circ) over relational semantics, that is, it is sound and strongly complete with respect to the class of all relational frames [27]. As each Kripke model is pointwise equivalent to some augmented model, 𝐁𝐊{\bf B_{K}} is also (sound and) strongly complete with respect to the class of augmented frames [15]. Moreover, since every augmented model is a filter, thus 𝐁𝐊{\bf B_{K}} also characterizes the class of filters. From now on, for the sake of consistency on notation, we denote the logic by 𝐊{\bf K^{\circ}} here. As neighborhood semantics can handle logics weaker than the minimal relational logic, it is then natural to ask what logics weaker than 𝐊{\bf K^{\circ}} look like. Here is a table that summarizes 𝐊{\bf K^{\circ}} and its weaker logics and the corresponding classes of frames which determine them.888It is worth remarking that E\circ\texttt{E} is indispensable in any proof system in the table. To see this, define a new semantics which interprets all formulas of the form φ\circ\varphi as φ\varphi (so that φ\bullet\varphi is interpreted as ¬φ\neg\varphi), then one can see that under the new semantics, E\circ\texttt{E} is not valid, but any subsystem 𝐋E{\bf L}-\circ\texttt{E} of 𝐋{\bf L} in the table is sound. This entails that E\circ\texttt{E} is not derivable in any such subsystem, and thus E\circ\texttt{E} is indispensable in any proof system in the table.

Proof systemsFrame classes𝐄=PL+MP+E+RE𝐌=𝐄+M(m)𝐄𝐂=𝐄+C(c)𝐄𝐍=𝐄+N(n)𝐄𝐌𝐂=𝐌+C(mc)𝐄𝐌𝐍=𝐌+N(mn)𝐄𝐂𝐍=𝐄𝐂+N(cn)𝐊=𝐄𝐌𝐂+Nfilters=(mcn)\begin{array}[]{|c|c|}\hline\cr\text{Proof systems}&\text{Frame classes}\\ \hline\cr{\bf E^{\circ}}=\texttt{PL}+\texttt{MP}+\circ\texttt{E}+\texttt{RE}\circ&\text{---}\\ {\bf M^{\circ}}={\bf E^{\circ}}+\circ\texttt{M}&(m)\\ {\bf EC^{\circ}}={\bf E^{\circ}}+\circ\texttt{C}&(c)\\ {\bf EN^{\circ}}={\bf E^{\circ}}+\circ\texttt{N}&(n)\\ {\bf EMC^{\circ}}={\bf M^{\circ}}+\circ\texttt{C}&(mc)\\ {\bf EMN^{\circ}}={\bf M^{\circ}}+\circ\texttt{N}&(mn)\\ {\bf ECN^{\circ}}={\bf EC^{\circ}}+\circ\texttt{N}&(cn)\\ {\bf K^{\circ}}={\bf EMC^{\circ}}+\circ\texttt{N}&\text{filters}=(mcn)\\ \hline\cr\end{array}

A natural question is: are all unknown truths themselves unknown truths? Interestingly, in monotone logics, the answer is positive. We now give a proof-theoretical perspective.

Proposition 5.2.

φφ\bullet\varphi\to\bullet\bullet\varphi is provable in 𝐌{\bf M^{\circ}}.

Proof.

Notice that we have the following proof sequences in 𝐌{\bf M^{\circ}}.

(i)φφE(ii)φφφ(i),RM(iii)φφ(ii),PL(iv)φφ(iii),PL\begin{array}[]{lll}(i)&\bullet\varphi\to\varphi&\circ\texttt{E}\\ (ii)&\circ\bullet\varphi\land\bullet\varphi\to\circ\varphi&(i),\texttt{RM}\circ\\ (iii)&\circ\bullet\varphi\to\circ\varphi&(ii),\texttt{PL}\\ (iv)&\bullet\varphi\to\bullet\bullet\varphi&(iii),\texttt{PL}\end{array}

We now focus on the completeness of the proof systems in the above table. The completeness proof is based on the construction of the canonical model. From now on, we define the proof set of φ\varphi in a system Λ\Lambda, denoted |φ|Λ|\varphi|_{\Lambda}, as the set of maximal consistent sets of Λ\Lambda that contains φ\varphi; in symbol, |φ|Λ={sScφs}|\varphi|_{\Lambda}=\{s\in S^{c}\mid\varphi\in s\}. We skip the subscript and simply write |φ||\varphi| whenever the system Λ\Lambda is clear. If a set of states Γ\Gamma is not a proof set in Λ\Lambda for any formula, then we say it is a non-proof set relative to Λ\Lambda.

Definition 5.3.

The canonical model for 𝐄{\bf E^{\circ}} is the triple c=Sc,Nc,Vc\mathcal{M}^{c}=\langle S^{c},N^{c},V^{c}\rangle, where

  • Sc={ss is a maximal consistent set of 𝐄}S^{c}=\{s\mid s\text{ is a maximal consistent set of }{\bf E^{\circ}}\},

  • Nc(s)={|φ|φφs}N^{c}(s)=\{|\varphi|\mid\circ\varphi\land\varphi\in s\},

  • Vc(p)={sScps}V^{c}(p)=\{s\in S^{c}\mid p\in s\}.

Lemma 5.4.

For all sScs\in S^{c}, for all φ()\varphi\in\mathcal{L}(\bullet), we have c,sφφs\mathcal{M}^{c},s\vDash\varphi\Longleftrightarrow\varphi\in s, that is, φc=|φ|\varphi^{\mathcal{M}^{c}}=|\varphi|.

Proof.

By induction on φ\varphi. The nontrivial case is φ\bullet\varphi, that is, we only need to show that c,sφ\mathcal{M}^{c},s\vDash\bullet\varphi iff φs\bullet\varphi\in s.

First, suppose that φs\bullet\varphi\in s, to prove that c,sφ\mathcal{M}^{c},s\vDash\bullet\varphi, which by induction hypothesis is equivalent to showing that φs\varphi\in s and |φ|Nc(s)|\varphi|\notin N^{c}(s). By supposition and axiom E\circ\texttt{E}, we infer that φs\varphi\in s. As φs\bullet\varphi\in s, we have φφs\circ\varphi\land\varphi\notin s, and then |φ|Nc(s)|\varphi|\notin N^{c}(s) according to the definition of NcN^{c}.

Conversely, suppose that φs\bullet\varphi\notin s, to show that c,sφ\mathcal{M}^{c},s\nvDash\bullet\varphi. Assume that c,sφ\mathcal{M}^{c},s\vDash\varphi, viz., sφcs\in\varphi^{\mathcal{M}^{c}}, then by induction hypothesis, s|φ|s\in|\varphi|, namely, φs\varphi\in s. By supposition, we infer that φφs\circ\varphi\land\varphi\in s. Then from the definition of NcN^{c}, it follows that |φ|Nc(s)|\varphi|\in N^{c}(s). Now by induction hypothesis again, we conclude that φcNc(s)\varphi^{\mathcal{M}^{c}}\in N^{c}(s). Therefore, c,sφ\mathcal{M}^{c},s\nvDash\bullet\varphi. ∎

We also need to show that NcN^{c} is well-defined.

Lemma 5.5.

If |φ|Nc(s)|\varphi|\in N^{c}(s) and |φ|=|ψ||\varphi|=|\psi|, then ψψs\circ\psi\land\psi\in s.

Proof.

Suppose that |φ|Nc(s)|\varphi|\in N^{c}(s) and |φ|=|ψ||\varphi|=|\psi|, to show that ψψs\circ\psi\land\psi\in s. By supposition, we obtain φφs\circ\varphi\land\varphi\in s and φψ\vdash\varphi\leftrightarrow\psi. By RE\texttt{RE}\circ, it follows that φψ\vdash\circ\varphi\leftrightarrow\circ\psi. Therefore, ψψs\circ\psi\land\psi\in s. ∎

Now it is a routine work to show the following.

Theorem 5.6.

𝐄{\bf E^{\circ}} is sound and strongly complete with respect to the class of all neighborhood frames.

Theorem 5.7.

𝐄𝐂{\bf EC^{\circ}} is sound and strongly complete with respect to the class of (c)(c)-frames.

Proof.

For soundness, we need to show the validity of C\circ\texttt{C} over the class of (c)(c)-frames. For this, let =S,N,V\mathcal{M}=\langle S,N,V\rangle be a (c)(c)-model, sSs\in S, and suppose that ,sφψ\mathcal{M},s\vDash\circ\varphi\land\circ\psi, to show that ,s(φψ)\mathcal{M},s\vDash\circ(\varphi\land\psi). Assume that s(φψ)s\in(\varphi\land\psi)^{\mathcal{M}}, it suffices to show that (φψ)N(s)(\varphi\land\psi)^{\mathcal{M}}\in N(s). By supposition, it follows that sφs\in\varphi^{\mathcal{M}} implies φN(s)\varphi^{\mathcal{M}}\in N(s), and sψs\in\psi^{\mathcal{M}} implies ψN(s)\psi^{\mathcal{M}}\in N(s). By assumption, sφs\in\varphi^{\mathcal{M}} and sψs\in\psi^{\mathcal{M}}, and thus φN(s)\varphi^{\mathcal{M}}\in N(s) and ψN(s)\psi^{\mathcal{M}}\in N(s). An application of (c)(c) gives us φψN(s)\varphi^{\mathcal{M}}\cap\psi^{\mathcal{M}}\in N(s), that is, (φψ)N(s)(\varphi\land\psi)^{\mathcal{M}}\in N(s), as desired.

For completeness, define c\mathcal{M}^{c} w.r.t. 𝐄𝐂{\bf EC^{\circ}} as in Def. 5.3. It suffices to show that NcN^{c} is closed under conjunctions. For this, let sScs\in S^{c} be arbitrary, and suppose that XNc(s)X\in N^{c}(s) and YNc(s)Y\in N^{c}(s), to show that XYNc(s)X\cap Y\in N^{c}(s). By supposition, there are φ,ψ\varphi,\psi such that X=|φ|Nc(s)X=|\varphi|\in N^{c}(s) and Y=|ψ|Nc(s)Y=|\psi|\in N^{c}(s), then φφs\circ\varphi\land\varphi\in s and ψψs\circ\psi\land\psi\in s. From this and axiom C\circ\texttt{C}, it follows that (φψ)(φψ)s\circ(\varphi\land\psi)\land(\varphi\land\psi)\in s, and thus |φψ|Nc(s)|\varphi\land\psi|\in N^{c}(s), viz. XYNc(s)X\cap Y\in N^{c}(s). ∎

Theorem 5.8.

𝐄𝐍{\bf EN^{\circ}} is sound and strongly complete with respect to the class of (n)(n)-frames.

Proof.

The soundness follows directly from the soundness of 𝐄{\bf E^{\circ}} (Thm. 5.6) and the validity of N\circ\texttt{N} (Prop. 4.7).

For the completeness, define c\mathcal{M}^{c} w.r.t. 𝐄𝐍{\bf EN^{\circ}} as in Def. 5.3. It suffices to show that for all sScs\in S^{c}, ScNc(s)S^{c}\in N^{c}(s). This follows immediately from the axiom s\circ\top\land\top\in s and the fact that ||=Sc|\top|=S^{c}. ∎

The following is a consequence of Thm. 5.7 and Thm. 5.8.

Corollary 5.9.

𝐄𝐂𝐍{\bf ECN^{\circ}} is sound and strongly complete with respect to the class of (cn)(cn)-frames.

Now we deal with the completeness of 𝐌{\bf M^{\circ}}. As in the case of monotone modal logic, the canonical neighborhood function NcN^{c} is not necessarily supplemented due to the presence of non-proof sets. To deal with this problem, we use the strategy of supplementation.

Definition 5.10.

Let =S,N,V\mathcal{M}=\langle S,N,V\rangle be a neighborhood model. We say that +=S,N+,V\mathcal{M}^{+}=\langle S,N^{+},V\rangle is the supplementation of \mathcal{M}, if for all sSs\in S, N+(s)={XYX for some YN(s)}N^{+}(s)=\{X\mid Y\subseteq X\text{ for some }Y\in N(s)\}.

Given any neighborhood model, its supplementation is supplemented. Also, N(s)N+(s)N(s)\subseteq N^{+}(s) for all sSs\in S. Moreover, the supplementation preserves the properties (c)(c) and (n)(n).

Fact 5.11.

Let =S,N,V\mathcal{M}=\langle S,N,V\rangle be a neighborhood frame. If \mathcal{M} has (c)(c), then so does +\mathcal{M}^{+}; if \mathcal{M} has (n)(n), then so does +\mathcal{M}^{+}.

Proof.

Suppose that \mathcal{M} has (c)(c). Let sSs\in S and X,XSX,X^{\prime}\subseteq S, if X,XN+(s)X,X^{\prime}\in N^{+}(s), then YXY\subseteq X and YXY^{\prime}\subseteq X^{\prime} for some Y,YN(s)Y,Y^{\prime}\in N(s), thus YYXXY\cap Y^{\prime}\subseteq X\cap X^{\prime}. From Y,YN(s)Y,Y^{\prime}\in N(s) and the supposition, it follows that YYN(s)Y\cap Y^{\prime}\in N(s). Therefore, XXN+(s)X\cap X^{\prime}\in N^{+}(s). This means that +\mathcal{M}^{+} has also (c)(c).

Assume that \mathcal{M} has (n)(n). Then SN(s)S\in N(s) for all sSs\in S. Since N(s)N+(s)N(s)\subseteq N^{+}(s), thus SN+(s)S\in N^{+}(s) for all sSs\in S. This entails that +\mathcal{M}^{+} has also (n)(n). ∎

Theorem 5.12.

𝐌{\bf M^{\circ}} is sound and strongly complete with respect to the class of (m)(m)-frames.

Proof.

For soundness, by the soundness of 𝐄{\bf E^{\circ}} (Thm. 5.6), it suffices to show that the axiom M\circ\texttt{M} preserves validity over (m)(m)-frames.

Suppose for any (m)(m)-model =S,N,V\mathcal{M}=\langle S,N,V\rangle and sSs\in S that ,sφφ\mathcal{M},s\vDash\circ\varphi\land\varphi, to prove that ,s(φψ)\mathcal{M},s\vDash\circ(\varphi\vee\psi). By supposition, we obtain that sφs\in\varphi^{\mathcal{M}} and φN(s)\varphi^{\mathcal{M}}\in N(s). Since φφψ\varphi^{\mathcal{M}}\subseteq\varphi^{\mathcal{M}}\cup\psi^{\mathcal{M}}, by (m)(m), it follows that (φψ)N(s)(\varphi\vee\psi)^{\mathcal{M}}\in N(s), and therefore ,s(φψ)\mathcal{M},s\vDash\circ(\varphi\vee\psi).

For completeness, define c\mathcal{M}^{c} w.r.t. 𝐌{\bf M^{\circ}} as in Def. 5.3, and consider the supplementation of c\mathcal{M}^{c}, that is, (c)+=Sc,(Nc)+,Vc(\mathcal{M}^{c})^{+}=\langle S^{c},(N^{c})^{+},V^{c}\rangle. By definition of supplementation, (c)+(\mathcal{M}^{c})^{+} possesses (m)(m).

It suffices to show that for all sScs\in S^{c}, for all φ()\varphi\in\mathcal{L}(\circ),

|φ|(Nc)+(s)φφs.|\varphi|\in(N^{c})^{+}(s)\Longleftrightarrow\circ\varphi\land\varphi\in s.

\Longleftarrow” follows directly from the fact that Nc(s)(Nc)+(s)N^{c}(s)\subseteq(N^{c})^{+}(s).

For “\Longrightarrow”, suppose that |φ|(Nc)+(s)|\varphi|\in(N^{c})^{+}(s), then X|φ|X\subseteq|\varphi| for some XNc(s)X\in N^{c}(s). Since XNc(s)X\in N^{c}(s), there must be a χ\chi such that |χ|=XNc(s)|\chi|=X\in N^{c}(s), and then χχs\circ\chi\land\chi\in s. We have also |χ||φ||\chi|\subseteq|\varphi|, then χφ\vdash\chi\to\varphi. Note that the rule RM\texttt{RM}\circ is derivable in 𝐌{\bf M^{\circ}} (Prop. 5.1), thus we have χχφφ\vdash\circ\chi\land\chi\to\circ\varphi\land\varphi, thus φφs\circ\varphi\land\varphi\in s, as desired. ∎

Theorem 5.13.

𝐄𝐌𝐂{\bf EMC^{\circ}} is sound and strongly complete with respect to the class of (mc)(mc)-frames.

Proof.

The soundness follows directly from the soundness of 𝐌{\bf M^{\circ}} (Thm. 5.12) and the validity of C\circ\texttt{C} (Thm. 5.7).

As for the completeness, define c\mathcal{M}^{c} and (c)+(\mathcal{M}^{c})^{+} w.r.t. 𝐄𝐌𝐂{\bf EMC^{\circ}} as in Thm. 5.12. By Thm. 5.12, it suffices to show that (c)+(\mathcal{M}^{c})^{+} possesses (c)(c). This follows immediately from Thm. 5.7 and Fact 5.11. ∎

Theorem 5.14.

𝐄𝐌𝐍{\bf EMN^{\circ}} is sound and strongly complete with respect to the class of (mn)(mn)-frames.

Proof.

The soundness follows directly from the soundness of 𝐌{\bf M^{\circ}} (Thm. 5.12) and the validity of N\circ\texttt{N} (Prop. 4.7).

As for the completeness, define c\mathcal{M}^{c} and (c)+(\mathcal{M}^{c})^{+} w.r.t. 𝐄𝐌𝐍{\bf EMN^{\circ}} as in Thm. 5.12. By Thm. 5.12, it suffices to show that (c)+(\mathcal{M}^{c})^{+} possesses (n)(n). This follows immediately from Thm. 5.8 and Fact 5.11. ∎

Theorem 5.15.

𝐊{\bf K^{\circ}} is sound and strongly complete with respect to the class of filters.

Proof.

The soundness follows immediately from that of 𝐄𝐌𝐍{\bf EMN^{\circ}} (Thm. 5.14) and the validity of C\circ\texttt{C} (Thm. 5.7).

As for the completeness, define c\mathcal{M}^{c} and (c)+(\mathcal{M}^{c})^{+} w.r.t. 𝐊{\bf K^{\circ}} as in Thm. 5.14. By Thm. 5.14, it suffices to show that (c)+(\mathcal{M}^{c})^{+} has (c)(c). This follows from Thm. 5.7 and Fact 5.11.999Note that there was a mistake in [15, Thm. 1.8], where the authors did not prove that (c)+(\mathcal{M}^{c})^{+} (denoted +\mathcal{M}^{+} there) has (c)(c) and (n)(n); rather, they only show that c\mathcal{M}^{c} (denoted \mathcal{M} there) does have, which though does not directly give us the completeness in question.

5.2 Axiomatizations for (W)\mathcal{L}(W)

To axiomatize (W)\mathcal{L}(W) over various neighborhood frames, we list the following axioms and rules of inference.

AxiomsRulesPLAll instances of propositional tautologiesWEWφ¬φMPφ,φψψWMW(φψ)¬ψWψWCWφWψW(φψ)REWφψWφWψ\begin{array}[]{lllll}\text{Axioms}&&&\text{Rules}\\ \texttt{PL}&\text{All instances of propositional tautologies}&&&\\ \texttt{WE}&W\varphi\to\neg\varphi&&\texttt{MP}&\dfrac{\varphi,\varphi\to\psi}{\psi}\\ \texttt{WM}&W(\varphi\land\psi)\land\neg\psi\to W\psi\\ \texttt{WC}&W\varphi\land W\psi\to W(\varphi\land\psi)&&\texttt{REW}&\dfrac{\varphi\leftrightarrow\psi}{W\varphi\leftrightarrow W\psi}\\ \end{array}

Similar to the axiomatizations for ()\mathcal{L}(\bullet), all axioms and inference rules listed above also arise in the literature, with different names. The axiom WM is derivable from a rule φψ(Wφ¬ψ)Wψ\dfrac{\varphi\to\psi}{(W\varphi\land\neg\psi)\to W\psi} (see [29, Thm. 3.2]), denoted RMW, which has usually been used to replace WM [29, 15]. Again, we prefer axioms to inference rules. Also, note that the rule RMW is derivable from the axiom WM in the presence of REW (and propositional calculus).

Proposition 5.16.

RMW is derivable from PL+MP+WM+REW\texttt{PL}+\texttt{MP}+\texttt{WM}+\texttt{REW}.

Proof.

We have the following proof sequences in PL+MP+WM+REW\texttt{PL}+\texttt{MP}+\texttt{WM}+\texttt{REW}.

(1)φψPremise(2)φψφ(1),PL,MP(3)W(φψ)Wφ(2),REW(4)W(φψ)¬ψWψWM(5)(Wφ¬ψ)Wψ(3),(4)\begin{array}[]{lll}(1)&\varphi\to\psi&\text{Premise}\\ (2)&\varphi\land\psi\leftrightarrow\varphi&(1),\texttt{PL},\texttt{MP}\\ (3)&W(\varphi\land\psi)\leftrightarrow W\varphi&(2),\texttt{REW}\\ (4)&W(\varphi\land\psi)\land\neg\psi\to W\psi&\texttt{WM}\\ (5)&(W\varphi\land\neg\psi)\to W\psi&(3),(4)\\ \end{array}

It is shown that the proof system consisting of all axioms and inference rules for (W)\mathcal{L}(W), denoted 𝐊𝐖{\bf K^{W}} here, is sound and strongly complete with respect to the class of all relational frames in [29] and to the class of all neighborhood frames that are closed under intersections and are negatively supplemented in [15].101010More precisely, the system in [29] (called SWS^{W} there) and [15] (called 𝐀𝐊{\bf A_{K}} there) contains the rule RMW instead of the axiom WM, and drops the rule REW since it is then derivable from RMW and WE (see [29, Thm. 3.1]). We will give the definition of ‘negatively supplemented’ later. Again, it is natural to ask what logics weaker than 𝐊𝐖{\bf K^{W}} look like. Below is a table summarizing 𝐊𝐖{\bf K^{W}} and its weaker logics and the corresponding frame classes that determine them.

Proof systemsFrame classes𝐄𝐖=PL+MP+WE+REW, also (n)𝐌𝐖=𝐄𝐖+WM(m), also (mn)𝐄𝐂𝐖=𝐄𝐖+WC(c), also (cn)𝐊𝐖=𝐌𝐖+WC(mc), also filters=(mcn)\begin{array}[]{|c|c|}\hline\cr\text{Proof systems}&\text{Frame classes}\\ \hline\cr{\bf E^{W}}=\texttt{PL}+\texttt{MP}+\texttt{WE}+\texttt{REW}&\text{---},\text{ also }(n)\\ {\bf M^{W}}={\bf E^{W}}+\texttt{WM}&(m),\text{ also }(mn)\\ {\bf EC^{W}}={\bf E^{W}}+\texttt{WC}&(c),\text{ also }(cn)\\ {\bf K^{W}}={\bf M^{W}}+\texttt{WC}&(mc),\text{ also \text{filters}}=(mcn)\\ \hline\cr\end{array}

Note that WE is indispensable in 𝐊𝐖{\bf K^{W}} and its weaker systems in the above table. To see this, consider an auxiliary semantics which interprets all formulas of the form WφW\varphi as φ\varphi, then one may easily verify that the subsystem 𝐊𝐖WE{\bf K^{W}}-\texttt{WE} is sound with respect to the auxiliary semantics, but WE is unsound, and thus WE cannot be derived from the remaining axioms and inference rules. This entails that WE is indispensable in 𝐊𝐖{\bf K^{W}}, and thus WE is indispensable in the weaker systems of 𝐊𝐖{\bf K^{W}}.

We can also ask the following question: are all false beliefs themselves false beliefs? Different from the notion of unknown truths, the answer to this question is negative. In fact, none of false beliefs themselves are false beliefs. We now give a proof-theoretical perspective for this.

Proposition 5.17.

Wφ¬WWφW\varphi\to\neg WW\varphi is derivable in 𝐄𝐖{\bf E^{W}}.

Proof.

We have the following proof sequences:

(i)WWφ¬WφWE(ii)Wφ¬WWφ(i),PL\begin{array}[]{lll}(i)&WW\varphi\to\neg W\varphi&\texttt{WE}\\ (ii)&W\varphi\to\neg WW\varphi&(i),\texttt{PL}\end{array}

In the reminder of this section, we focus on the completeness of the four proof systems listed above, with the aid of canonical neighborhood model constructions. Unfortunately, all these systems may not be handled by a uniform canonical neighborhood function; rather, we need to distinguish systems excluding axiom WM from those including it. This is similar to the case of neighborhood contingency logics [8].

5.2.1 Systems excluding WM

Definition 5.18.

Let 𝐋{\bf L} be a system excluding WM. A tuple 𝐋=S𝐋,N𝐋,V𝐋\mathcal{M}^{\bf L}=\langle S^{\bf L},N^{\bf L},V^{\bf L}\rangle is the canonical neighborhood model for 𝐋{\bf L}, if

  • S𝐋={ss is a maximal consistent set of 𝐋}S^{\bf L}=\{s\mid s\text{ is a maximal consistent set of }{\bf L}\},

  • N𝐋(s)={|φ|Wφs}N^{\bf L}(s)=\{|\varphi|\mid W\varphi\in s\},

  • V𝐋(p)={sS𝐋ps}V^{\bf L}(p)=\{s\in S^{\bf L}\mid p\in s\}.

The neighborhood function N𝐋N^{\bf L} is well defined.

Lemma 5.19.

Let 𝐋{\bf L} be a system excluding WM. If |φ|=|ψ||\varphi|=|\psi| and |φ|N𝐋(s)|\varphi|\in N^{\bf L}(s), then WψsW\psi\in s.

Proof.

Suppose that |φ|=|ψ||\varphi|=|\psi| and |φ|N𝐋(s)|\varphi|\in N^{\bf L}(s), to prove that WψsW\psi\in s. By supposition, φψ\vdash\varphi\leftrightarrow\psi and WφsW\varphi\in s. By REW, we have WφWψ\vdash W\varphi\leftrightarrow W\psi, and thus WψsW\psi\in s. ∎

Lemma 5.20.

Let 𝐋{\bf L} be a system excluding WM. For all φ(W)\varphi\in\mathcal{L}(W), for all sS𝐋s\in S^{\bf L}, we have 𝐋,sφφs\mathcal{M}^{\bf L},s\vDash\varphi\Longleftrightarrow\varphi\in s, that is, φ𝐋=|φ|\varphi^{\mathcal{M}^{\bf L}}=|\varphi|.

Proof.

By induction on φ\varphi, where the nontrivial case is WφW\varphi.

Suppose that WφsW\varphi\in s, to show that 𝐋,sWφ\mathcal{M}^{\bf L},s\vDash W\varphi. By supposition and axiom WE, we derive that ¬φs\neg\varphi\in s, viz., φs\varphi\notin s, then by IH, we obtain 𝐋,sφ\mathcal{M}^{\bf L},s\nvDash\varphi. It suffices to show that φ𝐋N𝐋(s)\varphi^{\mathcal{M}^{\bf L}}\in N^{\bf L}(s), which is equivalent to showing that |φ|N𝐋(s)|\varphi|\in N^{\bf L}(s) by IH. This follows directly from the fact that WφsW\varphi\in s.

Conversely, suppose that 𝐋,sWφ\mathcal{M}^{\bf L},s\vDash W\varphi, to prove that WφsW\varphi\in s. By supposition and IH, |φ|N𝐋(s)|\varphi|\in N^{\bf L}(s) and φs\varphi\notin s. This immediately gives us WφsW\varphi\in s. ∎

Now it is a standard work to show the following.

Theorem 5.21.

𝐄𝐖{\bf E^{W}} is sound and strongly complete with respect to the class of all neighborhood frames.

Proposition 5.22.

𝐄𝐂𝐖{\bf EC^{W}} is sound and strongly complete with respect to the class of (c)(c)-frames.

Proof.

For the soundness, by Thm. 5.21, it suffices to show the validity of WC. For this, let =S,N,V\mathcal{M}=\langle S,N,V\rangle and sSs\in S such that ,sWφWψ\mathcal{M},s\vDash W\varphi\land W\psi. Then φN(s)\varphi^{\mathcal{M}}\in N(s) and sφs\notin\varphi^{\mathcal{M}}, and ψN(s)\psi^{\mathcal{M}}\in N(s) and sψs\notin\psi^{\mathcal{M}}. From φN(s)\varphi^{\mathcal{M}}\in N(s) and ψN(s)\psi^{\mathcal{M}}\in N(s) and (c)(c), it follows that φψN(s)\varphi^{\mathcal{M}}\cap\psi^{\mathcal{M}}\in N(s), that is, (φψ)N(s)(\varphi\land\psi)^{\mathcal{M}}\in N(s); from sφs\notin\varphi^{\mathcal{M}} it follows that s(φψ)s\notin(\varphi\land\psi)^{\mathcal{M}}. Therefore, ,sW(φψ)\mathcal{M},s\vDash W(\varphi\land\psi).

For the completeness, by Thm. 5.21, it is sufficient to prove that N𝐋N^{\bf L} has the property (c)(c). Suppose that XN𝐋(s)X\in N^{\bf L}(s) and YN𝐋(s)Y\in N^{\bf L}(s), then there are φ,ψ\varphi,\psi such that X=|φ|X=|\varphi| and Y=|ψ|Y=|\psi|. From |φ|N𝐋(s)|\varphi|\in N^{\bf L}(s) and |ψ|N𝐋(s)|\psi|\in N^{\bf L}(s), it follows that WφsW\varphi\in s and WψsW\psi\in s. By axiom WC, we obtain W(φψ)sW(\varphi\land\psi)\in s, thus |φψ|N𝐋(s)|\varphi\land\psi|\in N^{\bf L}(s), namely XYN𝐋(s)X\cap Y\in N^{\bf L}(s). ∎

5.2.2 Systems including WM

To deal with the completeness of the systems including WM, we need to redefine the canonical neighborhood function. The reason is as follows. If we continue using the canonical neighborhood function in Def. 5.18 and the strategy of supplementation (like the case in monotone modal logics), then we also need a rule φψWφWψ\dfrac{\varphi\to\psi}{W\varphi\to W\psi} in the systems. However, this rule is not sound, as one may easily check.

The following canonical neighborhood function is found to satisfy the requirement.

Definition 5.23.

Let 𝐋{\bf L} be a system including WM. A triple 𝐋=S𝐋,N𝐋,V𝐋\mathcal{M}^{\bf L}=\langle S^{\bf L},N^{\bf L},V^{\bf L}\rangle is a canonical neighborhood model for 𝐋{\bf L}, if

  • S𝐋={ss is a maximal consistent set of 𝐋}S^{\bf L}=\{s\mid s\text{ is a maximal consistent set of }{\bf L}\},

  • |φ|N𝐋(s)|\varphi|\in N^{\bf L}(s) iff WφφsW\varphi\vee\varphi\in s,

  • V𝐋(p)={sS𝐋ps}V^{\bf L}(p)=\{s\in S^{\bf L}\mid p\in s\}.

The reader may ask why we do not use this definition for systems excluding WM. This is because it does not work for system 𝐄𝐂𝐖{\bf EC^{W}} (Thm. 5.22), as one may check.

Note that Def. 5.23 does not specify the function N𝐋N^{\bf L} completely; in addition to the proof sets that satisfy this definition, N𝐋N^{\bf L} may also contain non-proof sets relative to 𝐋{\bf L}. Therefore, each of such logics has many canonical neighborhood models.

We need also show that N𝐋N^{\bf L} is well defined.

Lemma 5.24.

Let 𝐋{\bf L} be a system including WM. If |φ|=|ψ||\varphi|=|\psi| and |φ|N𝐋(s)|\varphi|\in N^{\bf L}(s), then WψψsW\psi\vee\psi\in s.

Proof.

Suppose that |φ|=|ψ||\varphi|=|\psi| and |φ|N𝐋(s)|\varphi|\in N^{\bf L}(s), to prove that WψψsW\psi\vee\psi\in s. By supposition, φψ\vdash\varphi\leftrightarrow\psi and WφφsW\varphi\vee\varphi\in s. By REW, we have WφWψ\vdash W\varphi\leftrightarrow W\psi, and thus WψψsW\psi\vee\psi\in s. ∎

Lemma 5.25.

Let 𝐋\mathcal{M}^{\bf L} be a canonical neighborhood model for any system extending 𝐌𝐖{\bf M^{W}}. Then for all φ(W)\varphi\in\mathcal{L}(W), for all sS𝐋s\in S^{\bf L}, we have 𝐋,sφφs\mathcal{M}^{\bf L},s\vDash\varphi\Longleftrightarrow\varphi\in s, that is, φ𝐋=|φ|\varphi^{\mathcal{M}^{\bf L}}=|\varphi|.

Proof.

By induction on φ\varphi, where the nontrivial case is WφW\varphi.

Suppose that WφsW\varphi\in s, to show that 𝐋,sWφ\mathcal{M}^{\bf L},s\vDash W\varphi. By supposition and axiom WE, we derive that ¬φs\neg\varphi\in s, viz., φs\varphi\notin s, then by IH, we obtain 𝐋,sφ\mathcal{M}^{\bf L},s\nvDash\varphi. It suffices to show that φ𝐋N𝐋(s)\varphi^{\mathcal{M}^{\bf L}}\in N^{\bf L}(s), which is equivalent to showing that |φ|N𝐋(s)|\varphi|\in N^{\bf L}(s) by IH. This follows directly from the fact that WφφsW\varphi\vee\varphi\in s.

Conversely, suppose that 𝐋,sWφ\mathcal{M}^{\bf L},s\vDash W\varphi, to prove that WφsW\varphi\in s. By supposition and IH, |φ|N𝐋(s)|\varphi|\in N^{\bf L}(s) and φs\varphi\notin s, which implies that WφφsW\varphi\vee\varphi\in s. Therefore, WφsW\varphi\in s. ∎

Given any system 𝐋{\bf L} extending 𝐌𝐖{\bf M^{W}}, the minimal canonical neighborhood model for 𝐋{\bf L}, denoted min𝐋=S𝐋,Nmin𝐋,V𝐋\mathcal{M}^{\bf L}_{min}=\langle S^{\bf L},N^{\bf L}_{min},V^{\bf L}\rangle, is defined such that Nmin𝐋(s)={|φ|Wφφs}N^{\bf L}_{min}(s)=\{|\varphi|\mid W\varphi\vee\varphi\in s\}. Similar to the cases in monotone modal logic and 𝐌{\bf M^{\circ}}, due to the existence of non-proof sets, the canonical neighborhood function Nmin𝐋N^{\bf L}_{min} is not necessarily supplemented. So again, we use the strategy of supplementation. The notion of supplementation can be found in Def. 5.10.

Theorem 5.26.

𝐌𝐖{\bf M^{W}} is sound and strongly complete with respect to the class of (m)(m)-frames.

Proof.

For the soundness, by Thm. 5.21, it remains to show the validity of WM. For this, let =S,N,V\mathcal{M}=\langle S,N,V\rangle be an (m)(m)-model and sSs\in S.

Suppose that ,sW(φψ)¬ψ\mathcal{M},s\vDash W(\varphi\land\psi)\land\neg\psi, to demonstrate that ,sWψ\mathcal{M},s\vDash W\psi. By supposition, we have (φψ)N(s)(\varphi\land\psi)^{\mathcal{M}}\in N(s), that is to say, φψN(s)\varphi^{\mathcal{M}}\cap\psi^{\mathcal{M}}\in N(s). Since s(¬ψ)s\in(\neg\psi)^{\mathcal{M}}, we have sψs\notin\psi^{\mathcal{M}}. By (m)(m), we derive that ψN(s)\psi^{\mathcal{M}}\in N(s). Therefore, ,sWψ\mathcal{M},s\vDash W\psi.

For the completeness, define the supplementation of min𝐋\mathcal{M}^{\bf L}_{min} and denote it (min𝐋)+(\mathcal{M}^{\bf L}_{min})^{+}. By definition of supplementation, (min𝐋)+(\mathcal{M}^{\bf L}_{min})^{+} possesses (m)(m). Thus the remainder is to prove that (min𝐋)+(\mathcal{M}^{\bf L}_{min})^{+} is indeed a canonical neighborhood model for 𝐌𝐖{\bf M^{W}}. That is, for every sScs\in S^{c}, for every φ(W)\varphi\in\mathcal{L}(W), we have

|φ|(Nmin𝐋)+(s)Wφφs.|\varphi|\in(N^{\bf L}_{min})^{+}(s)\Longleftrightarrow W\varphi\vee\varphi\in s.

The proof is as follows.

\Longleftarrow’: This follows immediately from the fact that Nmin𝐋(s)(Nmin𝐋)+(s)N^{\bf L}_{min}(s)\subseteq(N^{\bf L}_{min})^{+}(s).

\Longrightarrow’: Suppose that |φ|(Nmin𝐋)+(s)|\varphi|\in(N^{\bf L}_{min})^{+}(s), then there exists XNmin𝐋(s)X\in N^{\bf L}_{min}(s) such that X|φ|X\subseteq|\varphi|. Since XNmin𝐋(s)X\in N^{\bf L}_{min}(s), there must be a χ\chi such that X=|χ|X=|\chi|. By |χ|Nmin𝐋(s)|\chi|\in N^{\bf L}_{min}(s), we have WχχsW\chi\vee\chi\in s. From |χ||φ||\chi|\subseteq|\varphi| it follows that χφ\vdash\chi\to\varphi. Note that the rule RMW is derivable in 𝐌𝐖{\bf M^{W}} (Prop. 5.16). Thus an application of RMW gives us Wχ¬φWφ\vdash W\chi\land\neg\varphi\to W\varphi, that is, WχWφφ\vdash W\chi\to W\varphi\vee\varphi. From χφ\vdash\chi\to\varphi it also follows that χWφφ\vdash\chi\to W\varphi\vee\varphi, and then WχχWφφ\vdash W\chi\vee\chi\to W\varphi\vee\varphi, and therefore WφφsW\varphi\vee\varphi\in s, as required. ∎

It is shown in [15, Thm. 2.2, Coro. 2.7] that 𝐊𝐖{\bf K^{W}} (denoted 𝐀𝐊{\bf A_{K}} there) is sound and complete with respect to the class of all neighborhood frames that are closed under binary intersections and are negatively supplemented, where a neighborhood frame =S,N\mathcal{F}=\langle S,N\rangle is said to be negatively supplemented if for all sSs\in S and X,YSX,Y\subseteq S, if XN(s)X\in N(s), XYX\subseteq Y and sYs\notin Y, then YN(s)Y\in N(s). Notice that the notion of negative supplementation is weaker than that of supplementation.111111For us, ‘weakly supplemented’ seems a better term than ‘negatively supplemented’, partly because the notion is indeed weaker than supplementation, and partly because it is not actually to negate supplementation; rather, it only adds a negative condition to the property of supplementation. We have seen that 𝐌𝐖{\bf M^{W}} characterizes the class of neighborhood frames that are supplemented. Thus it is quite natural to ask which logic characterizes the class of neighborhood frames that are negative supplemented. As we will see, 𝐌𝐖{\bf M^{W}} does this job as well.

Corollary 5.27.

𝐌𝐖{\bf M^{W}} is sound and strongly complete with respect to the class of neighborhood frames that are negatively supplemented.

Proof.

The proof of the soundness is the same as in Thm. 5.26, by replacing (m)(m) with the property of ‘negative supplementation’.

The completeness also follows from Thm. 5.26, since negative supplementation is weaker than supplementation. ∎

We have the following conjecture. Note that the soundness is straightforward. In the current stage we do not know how to prove the completeness, because if we define (min𝐋)+(\mathcal{M}^{\bf L}_{min})^{+} w.r.t. 𝐊𝐖{\bf K^{W}} as in Thm. 5.26, by Thm. 5.26, it suffices to prove that (Nmin𝐋)+(N^{\bf L}_{min})^{+} has (c)(c), which follows directly by Fact 5.11 if Nmin𝐋N^{\bf L}_{min} possesses (c)(c). But to show Nmin𝐋N^{\bf L}_{min} possesses (c)(c), we again encounter the problem which is remarked immediately behind Def. 5.23.121212Note that we can prove the completeness based on the completeness of 𝐊𝐖{\bf K^{W}} w.r.t. the class of relational frames. Since it is shown that 𝐊𝐖{\bf K^{W}} is complete with respect to the class of relational frames [29], and each relational model has a pointwise equivalent augmented model (the proof is similar to the case in standard modal logic), and each augmented model is a filter, thus 𝐊𝐖{\bf K^{W}} is complete with respect to the class of filters, and hence also complete with respect to the class of (mc)(mc)-frames.

Conjecture 5.28.

𝐊𝐖{\bf K^{W}} is sound and strongly complete with respect to the class of filters, and also to the class of (mc)(mc)-frames.

We close this section with a general soundness and completeness result. For those systems 𝐋{\bf L} including WM, as s\top\in s, thus WsW\top\vee\top\in s, and hence SL=||Nmin𝐋(s)S^{L}=|\top|\in N^{\bf L}_{min}(s), then by Fact 5.11, we obtain that S𝐋(Nmin𝐋)+(s)S^{\bf L}\in(N^{\bf L}_{min})^{+}(s), which means that (min𝐋)+(\mathcal{M}^{\bf L}_{min})^{+} possesses (n)(n).

However, for those systems 𝐋{\bf L} excluding WM, as WsW\top\notin s (by axiom W1), by Def. 5.18, we infer that S𝐋=||N𝐋(s)S^{\bf L}=|\top|\notin N^{\bf L}(s). Thus the canonical model 𝐋\mathcal{M}^{\bf L} for such systems 𝐋{\bf L} does not have (n)(n). We can handle this problem with Prop. 4.10. The following general completeness result is a corollary of Prop. 4.10. Note that the following result also holds for systems including WM.

Theorem 5.29.

Let 𝐋{\bf L} be a system of (W)\mathcal{L}(W). If 𝐋{\bf L} is determined by a certain class of neighborhood frames, then it is also determined by the class of neighborhood frames satisfying (n)(n).

Proof.

Suppose that 𝐋{\bf L} is determined by a certain class \mathbb{C} of neighborhood frames, to show that 𝐋{\bf L} is sound and strongly complete with respect to the class of neighborhood frames satisfying (n)(n). The soundness is clear, since the class of neighborhood frames satisfying (n)(n) is contained in \mathbb{C}.

For the completeness, by supposition, every 𝐋{\bf L}-consistent set, say Γ\Gamma, is satisfiable in a model based on the frame in \mathbb{C}. That is, there exists a model =S,N,V\mathcal{M}=\langle S,N,V\rangle where S,N\langle S,N\rangle\in\mathbb{C} and a state sSs\in S such that ,sΓ\mathcal{M},s\vDash\Gamma. Now, applying Prop. 4.10, we obtain that u+,sΓ\mathcal{M}^{u^{+}},s\vDash\Gamma for u+=S,Nu+,V\mathcal{M}^{u^{+}}=\langle S,N^{u^{+}},V\rangle, where Nu+(s)=N(s){S}N^{u^{+}}(s)=N(s)\cup\{S\}. Note that the definition of Nu+N^{u^{+}} is well defined, since in Prop. 4.10, Σs\Sigma_{s} is an arbitrary subset of UsU_{s} and SUsS\in U_{s} (as sSs\in S) thus {S}Us\{S\}\subseteq U_{s}, we can define Σs\Sigma_{s} to be {S}\{S\}. Moreover, u+\mathcal{M}^{u^{+}} possesses (n)(n). Also, (n)(n) does not broken the previous properties. Therefore, Γ\Gamma is also satisfiable in a neighborhood model satisfying (n)(n). ∎

Corollary 5.30.

The following soundness and completeness results hold:

  1. 1.

    𝐄𝐖{\bf E^{W}} is sound and strongly complete with respect to the class of (n)(n)-frames;

  2. 2.

    𝐌𝐖{\bf M^{W}} is sound and strongly complete with respect to the class of (mn)(mn)-frames;

  3. 3.

    𝐄𝐂𝐖{\bf EC^{W}} is sound and strongly complete with respect to the class of (cn)(cn)-frames.

6 Adding public announcements

Now we extend the previous results to the dynamic case: public announcements. Syntactically, we add the construct [φ]φ[\varphi]\varphi into the previous languages, where the formula [ψ]φ[\psi]\varphi is read “φ\varphi is the case after each truthfully public announcement of ψ\psi”. Semantically, we adopt the intersection semantics proposed in [20]. In details, given a monotone neighborhood model =S,N,V\mathcal{M}=\langle S,N,V\rangle and a state sSs\in S,

,s[ψ]φ,sψ implies ψ,sφ\begin{array}[]{lll}\mathcal{M},s\vDash[\psi]\varphi&\Longleftrightarrow&\mathcal{M},s\vDash\psi\text{ implies }\mathcal{M}^{\cap\psi},s\vDash\varphi\\ \end{array}

where ψ\mathcal{M}^{\cap\psi} is the intersection submodel ψ\mathcal{M}^{\cap\psi^{\mathcal{M}}}, and the notion of intersection submodels is defined as below.

Definition 6.1.

[20, Def. 3] Let =S,N,V\mathcal{M}=\langle S,N,V\rangle be a monotone neighborhood model, and XX is a nonempty subset of SS. Define the intersection submodel X=X,NX,VX\mathcal{M}^{\cap X}=\langle X,N^{\cap X},V^{X}\rangle induced from XX, where

  • NX(s)={PXPN(s)}N^{\cap X}(s)=\{P\cap X\mid P\in N(s)\} for every sXs\in X,

  • VX(p)=V(p)XV^{X}(p)=V(p)\cap X for every pPp\in\textbf{P}.

Proposition 6.2.

[20, Prop. 2] The frame property (m)(m) is preserved under taking the intersection submodel. That is, if \mathcal{M} is a monotone neighborhood model with the domain SS, then for any XSX\subseteq S, the intersection submodel X\mathcal{M}^{\cap X} is also monotone.

We obtain the following reduction axioms for (,W)\mathcal{L}(\bullet,W) and its sublanguages ()\mathcal{L}(\bullet), (W)\mathcal{L}(W).

AP[ψ]p(ψp)AA[ψ][χ]φ[ψ[ψ]χ]φAN[ψ]¬φ(ψ¬[ψ]φ)A[ψ]φ(ψ[ψ]φ)AC[ψ](φχ)([ψ]φ[ψ]χ)AW[ψ]Wφ(ψW[ψ]φ)\begin{array}[]{lllll}\texttt{AP}&[\psi]p\leftrightarrow(\psi\to p)&&\texttt{AA}&[\psi][\chi]\varphi\leftrightarrow[\psi\land[\psi]\chi]\varphi\\ \texttt{AN}&[\psi]\neg\varphi\leftrightarrow(\psi\to\neg[\psi]\varphi)&&\texttt{A}\bullet&[\psi]\bullet\varphi\leftrightarrow(\psi\to\bullet[\psi]\varphi)\\ \texttt{AC}&[\psi](\varphi\land\chi)\leftrightarrow([\psi]\varphi\land[\psi]\chi)&&\texttt{AW}&[\psi]W\varphi\leftrightarrow(\psi\to W[\psi]\varphi)\\ \end{array}

From the reduction axioms, we can see that, every formula of (,W)\mathcal{L}(\bullet,W) (and thus its sublanguages) with public announcement operators can be rewritten as a formula without public announcements via finite many of steps. Thus the addition of public announcements does not increase the expressivity of the languages in question. Moreover,

Theorem 6.3.

Let Λ\Lambda be a system of ()\mathcal{L}(\bullet) (resp. (W)\mathcal{L}(W), (,W)\mathcal{L}(\bullet,W)). If Λ\Lambda is sound and strongly complete with respect to the class of monotone neighborhood frames, then so is Λ\Lambda plus AP, AN, AC, AA and A\texttt{A}\bullet (resp. plus AP, AN, AC, AA and AW, plus AP, AN, AC, AA, A\texttt{A}\bullet and AW) under intersection semantics.

Proof.

We only need to show the validity of A\texttt{A}\bullet and AW. The proof for the validity of other reduction axioms can be found in [20, Thm. 1]. This then will give us the soundness. Moreover, the completeness can be shown via a standard reduction method, see [33]. Let =S,N,V\mathcal{M}=\langle S,N,V\rangle be any monotone neighborhood model and sSs\in S.

For A\texttt{A}\bullet:

Suppose that ,s[ψ]φ\mathcal{M},s\vDash[\psi]\bullet\varphi and ,sψ\mathcal{M},s\vDash\psi, to show that ,s[ψ]φ\mathcal{M},s\vDash\bullet[\psi]\varphi, that is to show ,s[ψ]φ\mathcal{M},s\vDash[\psi]\varphi and ([ψ]φ)N(s)([\psi]\varphi)^{\mathcal{M}}\notin N(s). By supposition, we have ψ,sφ\mathcal{M}^{\cap\psi},s\vDash\bullet\varphi, then ψ,sφ\mathcal{M}^{\cap\psi},s\vDash\varphi and φψNψ(s)\varphi^{\mathcal{M}^{\cap\psi}}\notin N^{\cap\psi}(s). From ψ,sφ\mathcal{M}^{\cap\psi},s\vDash\varphi it follows that ,s[ψ]φ\mathcal{M},s\vDash[\psi]\varphi. We have also ([ψ]φ)N(s)([\psi]\varphi)^{\mathcal{M}}\notin N(s): if not, namely ([ψ]φ)N(s)([\psi]\varphi)^{\mathcal{M}}\in N(s), then ([ψ]φ)ψNψ(s)([\psi]\varphi)^{\mathcal{M}}\cap\psi^{\mathcal{M}}\in N^{\cap\psi}(s). Since ([ψ]φ)ψφψ([\psi]\varphi)^{\mathcal{M}}\cap\psi^{\mathcal{M}}\subseteq\varphi^{\mathcal{M}^{\cap\psi}}, by (m)(m), we derive that φψNψ(s)\varphi^{\mathcal{M}^{\cap\psi}}\in N^{\cap\psi}(s): a contradiction.

Conversely, assume that ,sψ[ψ]φ\mathcal{M},s\vDash\psi\to\bullet[\psi]\varphi, to prove that ,s[ψ]φ\mathcal{M},s\vDash[\psi]\bullet\varphi. For this, suppose that ,sψ\mathcal{M},s\vDash\psi, it remains to show that ψ,sφ\mathcal{M}^{\cap\psi},s\vDash\bullet\varphi, equivalently, ψ,sφ\mathcal{M}^{\cap\psi},s\vDash\varphi and φψNψ(s)\varphi^{\mathcal{M}^{\cap\psi}}\notin N^{\cap\psi}(s). By assumption and supposition, we obtain that ,s[ψ]φ\mathcal{M},s\vDash\bullet[\psi]\varphi, then ,s[ψ]φ\mathcal{M},s\vDash[\psi]\varphi and ([ψ]φ)N(s)([\psi]\varphi)^{\mathcal{M}}\notin N(s). From ,s[ψ]φ\mathcal{M},s\vDash[\psi]\varphi and ,sψ\mathcal{M},s\vDash\psi, it follows that ψ,sφ\mathcal{M}^{\cap\psi},s\vDash\varphi. Moreover, φψNψ(s)\varphi^{\mathcal{M}^{\cap\psi}}\notin N^{\cap\psi}(s): otherwise, φψ=Pψ\varphi^{\mathcal{M}^{\cap\psi}}=P\cap\psi^{\mathcal{M}} for some PN(s)P\in N(s), and then P(S\ψ)φψP\subseteq(S\backslash\psi^{\mathcal{M}})\cup\varphi^{\mathcal{M}^{\cap\psi}}, and thus by (m)(m), we infer that (S\ψ)φψN(s)(S\backslash\psi^{\mathcal{M}})\cup\varphi^{\mathcal{M}^{\cap\psi}}\in N(s), that is, ([ψ]φ)N(s)([\psi]\varphi)^{\mathcal{M}}\in N(s): a contradiction.

Now for AW:

Suppose that ,s[ψ]Wφ\mathcal{M},s\vDash[\psi]W\varphi and ,sψ\mathcal{M},s\vDash\psi, to show that ,sW[ψ]φ\mathcal{M},s\vDash W[\psi]\varphi, that is to show ([ψ]φ)N(s)([\psi]\varphi)^{\mathcal{M}}\in N(s) and ,s[ψ]φ\mathcal{M},s\nvDash[\psi]\varphi. By supposition, we derive that ψ,sWφ\mathcal{M}^{\cap\psi},s\vDash W\varphi, that is, φψNψ(s)\varphi^{\mathcal{M}^{\cap\psi}}\in N^{{\cap\psi}}(s) and ψ,sφ\mathcal{M}^{\cap\psi},s\nvDash\varphi. From φψNψ(s)\varphi^{\mathcal{M}^{\cap\psi}}\in N^{{\cap\psi}}(s), it follows that φψ=Pψ\varphi^{\mathcal{M}^{\cap\psi}}=P\cap\psi^{\mathcal{M}} for some PN(s)P\in N(s), and then P(S\ψ)φψP\subseteq(S\backslash\psi^{\mathcal{M}})\cup\varphi^{\mathcal{M}^{\cap\psi}}. By (m)(m), we get (S\ψ)φψN(s)(S\backslash\psi^{\mathcal{M}})\cup\varphi^{\mathcal{M}^{\cap\psi}}\in N(s), that is, ([ψ]φ)N(s)([\psi]\varphi)^{\mathcal{M}}\in N(s). Moreover, from ,sψ\mathcal{M},s\vDash\psi and ψ,sφ\mathcal{M}^{\cap\psi},s\nvDash\varphi, it follows immediately that ,s[ψ]φ\mathcal{M},s\nvDash[\psi]\varphi.

Conversely, assume that ,sψW[ψ]φ\mathcal{M},s\vDash\psi\to W[\psi]\varphi, to prove that ,s[ψ]Wφ\mathcal{M},s\vDash[\psi]W\varphi. For this, suppose that ,sψ\mathcal{M},s\vDash\psi, it suffices to demonstrate that ψ,sWφ\mathcal{M}^{\cap\psi},s\vDash W\varphi, which means that φψNψ(s)\varphi^{\mathcal{M}^{\cap\psi}}\in N^{\cap\psi}(s) and ψ,sφ\mathcal{M}^{\cap\psi},s\nvDash\varphi. By assumption and supposition, we derive that ,sW[ψ]φ\mathcal{M},s\vDash W[\psi]\varphi. This entails that ([ψ]φ)N(s)([\psi]\varphi)^{\mathcal{M}}\in N(s) and ,s[ψ]φ\mathcal{M},s\nvDash[\psi]\varphi. From ([ψ]φ)N(s)([\psi]\varphi)^{\mathcal{M}}\in N(s) it follows that ([ψ]φ)ψNψ(s)([\psi]\varphi)^{\mathcal{M}}\cap\psi^{\mathcal{M}}\in N^{\cap\psi}(s). As ([ψ]φ)ψφψ([\psi]\varphi)^{\mathcal{M}}\cap\psi^{\mathcal{M}}\subseteq\varphi^{\mathcal{M}^{\cap\psi}}, by (m)(m), we gain φψNψ(s)\varphi^{\mathcal{M}^{\cap\psi}}\in N^{\cap\psi}(s). Besides, from ,s[ψ]φ\mathcal{M},s\nvDash[\psi]\varphi, it follows directly that ψ,sφ\mathcal{M}^{\cap\psi},s\nvDash\varphi, as desired. ∎

For the sake of simplicity, we use 𝐌[]{\bf M^{\circ[\cdot]}} for the system that consists of 𝐌{\bf M^{\circ}} plus the above reduction axioms involving \bullet, and 𝐌𝐖[]{\bf M^{W[\cdot]}} for the system that consists of 𝐌𝐖{\bf M^{W}} plus the above reduction axioms involving WW.

It is shown in [7, Prop. 38] that Moore sentences are unsuccessful and self-refuting, that is, [p]¬p[\bullet p]\neg\bullet p is provable in 𝐊[]{\bf K^{\bullet[\cdot]}} (namely, the minimal Kripke logic of ()\mathcal{L}(\bullet) plus the above reduction axioms involving \bullet). However, this does not apply to the monotone case.

Proposition 6.4.

[p]¬p[\bullet p]\neg\bullet p is not provable in 𝐌[]{\bf M^{\circ[\cdot]}}.

Proof.

We have the following proof sequences:

[p]¬p(p¬[p]p)AN(p¬(p[p]p))A(p¬(p(pp)))AP(p¬(pp))PL\begin{array}[]{llll}[\bullet p]\neg\bullet p&\leftrightarrow&(\bullet p\to\neg[\bullet p]\bullet p)&\texttt{AN}\\ &\leftrightarrow&(\bullet p\to\neg(\bullet p\to\bullet[\bullet p]p))&\texttt{A}\bullet\\ &\leftrightarrow&(\bullet p\to\neg(\bullet p\to\bullet(\bullet p\to p)))&\texttt{AP}\\ &\leftrightarrow&(\bullet p\to\neg\bullet(\bullet p\to p))&\texttt{PL}\\ \end{array}

Thus we only need to show the unprovability of p¬(pp)\bullet p\to\neg\bullet(\bullet p\to p) in 𝐌{\bf M^{\circ}}. By completeness of 𝐌{\bf M^{\circ}}, it remains to show that this formula is not valid over the class of (m)(m)-frames. To see this, just consider an (m)(m)-model =S,N,V\mathcal{M}=\langle S,N,V\rangle, where S={s}S=\{s\}, N(s)=N(s)=\emptyset, and V(p)={s}V(p)=\{s\}. It is easy to see that ,sp\mathcal{M},s\vDash p and pN(s)p^{\mathcal{M}}\notin N(s), thus ,sp\mathcal{M},s\vDash\bullet p. Moreover, ,spp\mathcal{M},s\vDash\bullet p\to p and (pp)N(s)(\bullet p\to p)^{\mathcal{M}}\notin N(s), and hence ,s(pp)\mathcal{M},s\vDash\bullet(\bullet p\to p), and therefore ,sp¬(pp)\mathcal{M},s\nvDash\bullet p\to\neg\bullet(\bullet p\to p). Also, \mathcal{M} possesses (m)(m). This establishes the required result. ∎

One may show that [p]¬p[\bullet p]\neg\bullet p is provable in 𝐄𝐍{\bf EN^{\circ}} plus the reduction axioms for \bullet operator, since in 𝐄𝐍{\bf EN^{\circ}}, p¬(pp)\bullet p\to\neg\bullet(\bullet p\to p) is provable, whose proof is similar as in [7, Prop. 38] (note that \circ\top is interderivable with the rule φφ\dfrac{\varphi}{\circ\varphi} in the presence of the rule RE\texttt{RE}\circ).

Similar to the case in the minimal Kripke logic for ()\mathcal{L}(\bullet), in 𝐌[]{\bf M^{\circ[\cdot]}}, the negations of Moore sentences are all successful formulas.

Proposition 6.5.

[¬p]¬p[\neg\bullet p]\neg\bullet p is provable in 𝐌[]{\bf M^{\circ[\cdot]}}.

Proof.

The proof is similar to that of [7, Prop. 39] except that we are now in the much weaker system. In this system, we have the following proof sequences:

[¬p]¬p(¬p¬[¬p]p)AN(¬p¬(¬p[¬p]p))A(¬p¬(¬p(¬pp)))AP(¬p¬(¬pp))PL(p(pp))Def. of \begin{array}[]{llll}[\neg\bullet p]\neg\bullet p&\leftrightarrow&(\neg\bullet p\to\neg[\neg\bullet p]\bullet p)&\texttt{AN}\\ &\leftrightarrow&(\neg\bullet p\to\neg(\neg\bullet p\to\bullet[\neg\bullet p]p))&\texttt{A}\bullet\\ &\leftrightarrow&(\neg\bullet p\to\neg(\neg\bullet p\to\bullet(\neg\bullet p\to p)))&\texttt{AP}\\ &\leftrightarrow&(\neg\bullet p\to\neg\bullet(\neg\bullet p\to p))&\texttt{PL}\\ &\leftrightarrow&(\circ p\to\circ(\circ p\to p))&\text{Def.~{}of~{}}\circ\\ \end{array}

Notice that p(pp)\circ p\to\circ(\circ p\to p) is provable in 𝐌{\bf M^{\circ}}. First, as p(pp)\vdash p\to(\circ p\to p), by rule RM\texttt{RM}\circ (Prop. 5.1), pp(pp)\vdash\circ p\land p\to\circ(\circ p\to p). Moreover, p¬p(pp)\vdash\circ p\land\neg p\to\circ(\circ p\to p): to see this, we consider its contraposition, that is, (pp)(pp)\bullet(\circ p\to p)\to(\circ p\to p), which is just an instance of axiom E\circ\texttt{E}. ∎

Interestingly, public announcements cannot change one’s false belief about a fact. More precisely, if you have a false belief about pp and someone responds with “you are wrong about pp”, then you still have the false belief.

Proposition 6.6.

[Wp]Wp[Wp]Wp is provable in 𝐌𝐖[]{\bf M^{W[\cdot]}}.

Proof.

We observe the following proof sequences:

[Wp]Wp(WpW[Wp]p)AW(WpW(Wpp))AP\begin{array}[]{llll}[Wp]Wp&\leftrightarrow&(Wp\to W[Wp]p)&\texttt{AW}\\ &\leftrightarrow&(Wp\to W(Wp\to p))&\texttt{AP}\\ \end{array}

Moreover, WpW(Wpp)Wp\to W(Wp\to p) is provable in 𝐌𝐖{\bf M^{W}}. To see this, note that p(Wpp)\vdash p\to(Wp\to p), then by rule RMW (Prop. 5.16), we derive that Wp¬(Wpp)W(Wpp)\vdash Wp\land\neg(Wp\to p)\to W(Wp\to p), that is, WpWp¬pW(Wpp)\vdash Wp\land Wp\land\neg p\to W(Wp\to p). Now by WE, we obtain that WpW(Wpp)\vdash Wp\to W(Wp\to p). ∎

7 Conclusion and Future work

In this paper, we investigated logics of unknown truths and false beliefs under neighborhood semantics. More precisely, we compared the relative expressivity of the two logics, proposed notions of \bullet-morphisms and WW-morphisms with applications to frame definability, a general soundness and completeness result and some related results in the literature in a relative easy way, and axiomatized the two logics over various neighborhood frames, and finally, we extended the results to the case of public announcements, where by adopting the intersection semantics we found suitable reduction axioms and thus complete proof systems, which again has good applications to Moore sentence and some others.

An interesting question is to explore the notions of bisimulations for logics of unknown truths and false beliefs, for which notions of \bullet-morphisms and WW-morphisms might give us some inspirations. Moreover, a related research direction would be neighborhood bimodal logics with contingency and accident.

References

  • [1] R. Ariew, D. Garber (Eds., and Trans.). G. W. Leibniz: Philosophical Essays. Indianapolis: Hackett Publishing Company, 1989.
  • [2] Aristotle. De Interpretatione (On Interpretation). In R. McKeon, editor, The Basic Works of Aristotle. Random House, New York, 1941.
  • [3] P. Balbiani and J. Fan. A complete axiomatization of Euclidean strong non-contingency logic. In Proceedings of 12th Tbilisi Symposium of Language, Logic and Computation (TbiLLC), Lagodekhi, Georgia, pages 43–48, 2017.
  • [4] B. Brogaard and J. Salerno. Fitch’s paradox of knowability. In Edward N. Zalta, editor, The Stanford Encyclopedia of Philosophy. Metaphysics Research Lab, Stanford University, fall 2019 edition, 2019.
  • [5] B. F. Chellas. Modal Logic: An Introduction. Cambridge University Press, 1980.
  • [6] J. Fan. Logics of essence and accident. arXiv preprint arXiv:1506.01872, unpublished manuscript, 2015.
  • [7] J. Fan. Bimodal logics with contingency and accident. Journal of Philosophical Logic, 48:425–445, 2019.
  • [8] J. Fan. A family of neighborhood contingency logics. Notre Dame Journal of Formal Logic, 60(4):683–699, 2019.
  • [9] J. Fan. Logics of (in)sane and (un)reliable beliefs. Under submission, 2019.
  • [10] J. Fan. Strong noncontingency: on the modal logics of an operator expressively weaker than necessity. Notre Dame Journal of Formal Logic, 60(3):407–435, 2019.
  • [11] J. Fan. Symmetric contingency logic with unlimitedly many modalities. Journal of Philosophical Logic, 48(5):851–866, 2019.
  • [12] J. Fan and H. van Ditmarsch. Neighborhood contingency logic. In M. Banerjee and S. Krishna, editors, Logic and Its Application, volume 8923 of Lecture Notes in Computer Science, pages 88–99. Springer, 2015.
  • [13] F. B. Fitch. A logical analysis of some value concepts. The Journal of Symbolic Logic, 28(2):135–142, 1963.
  • [14] R. French and L. Humberstone. Partial confirmation of a conjecture on the boxdot translation in modal logic. The Australasian Journal of Logic, 7:56–61, 2009.
  • [15] D. Gilbert and G. Venturi. Neighborhood semantics for logics of unknown truths and false beliefs. The Australasian Journal of Logic, 14(1):246–267, 2017.
  • [16] D. R. Gilbert and G. Venturi. Reflexive-insensitive modal logics. The Review of Symbolic Logic, 9(1):167–180, 2016.
  • [17] F. H. Heinemann. Truths of reason and truths of fact. The Philosophical Review, 57(5):458–480, 1948.
  • [18] J. Hintikka. Knowledge and Belief. Cornell University Press, Ithaca, NY, 1962.
  • [19] W. Holliday and T. Icard. Moorean phenomena in epistemic logic. In L. Beklemishev, V. Goranko, and V. Shehtman, editors, Advances in Modal Logic 8, pages 178–199. College Publications, 2010.
  • [20] M. Ma and K. Sano. How to update neighborhood models. In International Workshop on Logic, Rationality and Interaction, pages 204–217. Springer, 2013.
  • [21] J. Marcos. Logics of essence and accident. Bulletin of the Section of Logic, 34(1):43–56, 2005.
  • [22] R. Montague. Universal grammar. Theoria, 36:373–398, 1970.
  • [23] G. E. Moore. A reply to my critics. In P.A. Schilpp, editor, The Philosophy of G.E. Moore, pages 535–677. Northwestern University, Evanston IL, 1942. The Library of Living Philosophers (volume 4).
  • [24] J. Perner, S. R. Leekam, and H. Wimmer. Three-year-olds’ difficulty with false belief: The case for a conceptual deficit. British journal of developmental psychology, 5(2):125–137, 1987.
  • [25] D. Scott. Advice on modal logic. Philosophical Problems in Logic: Some Recent Developments, pages 143–173, 1970.
  • [26] C. G. Small. Reflections on Gödel’s ontological argument. In W. Deppert and M. Rahnfeld, editors, Klarheit in Religionsdingen: Aktuelle Beiträge zur Religionsphilosophie, volume Band III of Grundlagenprobleme unserer Zeit, pages 109–144. Leipziger Universitätsverlag, 2001.
  • [27] C. Steinsvold. Completeness for various logics of essence and accident. Bulletin of the Section of Logic, 37(2):93–101, 2008.
  • [28] C. Steinsvold. A note on logics of ignorance and borders. Notre Dame Journal of Formal Logic, 49(4):385–392, 2008.
  • [29] C. Steinsvold. Being wrong: Logics for false belief. Notre Dame Journal of Formal Logic, 52(3):245–253, 2011.
  • [30] C. Steinsvold. The boxdot conjecture and the language of essence and accident. Australasian Journal of Logic, 10:18–35, 2011.
  • [31] J. van Benthem. What one may come to know. Analysis, 64(2):95–105, 2004.
  • [32] J. van Benthem. Logical Dynamics of Information and Interaction. Cambridge University Press, 2011.
  • [33] H. van Ditmarsch, W. van der Hoek, and B. Kooi. Dynamic Epistemic Logic, volume 337 of Synthese Library. Springer, 2007.
  • [34] H. M. Wellman, D. Cross, and J. Watson. Meta-analysis of theory-of-mind development: The truth about false belief. Child development, 72(3):655–684, 2001.