Notes on neighborhood semantics for logics of unknown truths and false beliefs
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 is true but you do not know that , then you have an unknown truth that ; if is false but you believe that , then you have a false belief that , or you are wrong about .
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 , formalized , 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 “ 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 is successful, if it still holds after being announced, in symbol . Otherwise, we say this formula is unsuccessful. Moreover, to say is self-refuting, if its negation always holds after being announced, in symbol .
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 over the class of Euclidean frames, thereby answering an open question posed in [10]. However, since as shown in [10], 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 as a sole modality. There, is read “the agent is wrong about ”, and being wrong about means believing though 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 ” is interpreted as “ is true and the proposition expressed by is not a neighborhood of the evaluated state”, and “it is a false belief that ” as “ is false and the proposition expressed by is a neighborhood of the evaluated state”. Beyond some invariance and negative results, a minimal logic of unknown truths under relational semantics, denoted 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 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 -morphisms and -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 -morphisms and -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 -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 .
Definition 2.1.
The languages involved in the current paper include the following.
is the language of the logic of unknown truths, is the language of the logic of false beliefs, is the language of the logic of unknown truths and false beliefs, and is the language of epistemic/doxastic logic.
Intuitively, is read “it is an unknown truth that ”, that is, “ is true but unknown”, is read “the agent is wrong about ”, or “it is a false belief that ”, that is, “ is false but believed”, and is read “it is known/believed that ”. Other connectives are defined as usual; in particular, is abbreviated as , read “it is known that once it is the case that ”. In a philosophical context, , , and are read “it is accident (or accidentally true) that ”, “it is essential that ”, and “it is necessary that ”, respectively.
All the above-mentioned languages are interpreted over neighborhood models.
Definition 2.2.
A (neighborhood) model is a triple such that, is a nonempty set of states (or called ‘possible worlds’), is a neighborhood function from to , and is a valuation function. Intuitively, means that is a neighborhood of . For any neighborhood model and state in , is called a pointed (neighborhood) model. Without considering the valuation function, we obtain a (neighborhood) frame.
Given a neighborhood model and a state , the semantics of the aforementioned languages is defined inductively as follows.
Where .
It is easily computed that
Thus one may easily verify that , , , which conform to the previous readings of , , , respectively. This indicates that the modalities , , are all definable in the standard modal logic , and therefore is at least as expressive as and also 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 be a neighborhood frame, and be a neighborhood model based on . For each and :
-
is supplemented, or closed under supersets, if and implies . In this case, we also say that is monotone.
-
is closed under (binary) intersections, if and implies .
-
contains the unit, if .
-
contains its core, if .
The function possesses such a property, if has the property for all ; has a property, if has. Frame is a filter, if has , and ; is augmented, if has and . Model has a property, if 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 and . To begin with, we give the definition of expressivity.
Definition 3.1 (Expressivity).
Let and be two logical languages that are interpreted in the same class of models,
-
•
is at least as expressive as , notation: , if for each formula in , there exists a formula in such that for each model in , for each state in , we have that iff .
-
•
is less expressive than , notation: , if and .
-
•
and are equally expressive, if and .
-
•
and are incomparable (in expressivity), if and .
The following two propositions state that the languages and are incomparable over any model classes with the above neighborhood properties.
Proposition 3.2.
On the class of all models, the -models, the -models, the -models, the -models, is not at least as expressive as .
Proof.
Consider the following models, where the only difference is , and an arrow from a state to a set means that is a neighborhood of :
It may be easily checked that both and have , , and .
Moreover, and can be distinguished by an -formula: on the one hand, as , we have ; on the other hand, since and , we infer that .
However, these two pointed models cannot be distinguished by any -formulas. For this, we show a stronger result that for all , for all , iff , that is, . As the two models differs only in the neighborhood of , it suffices to show that iff , that is, iff . The proof goes with induction on , where the only case to treat is .
To begin with, suppose that , then and . By induction hypothesis, and . Since , it must be the case that , that is, , and thus . Therefore, .
Conversely, assume that , then and . As , by induction hypothesis, we infer that and . Therefore, .
Therefore, . ∎
Proposition 3.3.
On the class of all models, the -models, the -models, -models, the -models, is not at least as expressive as .
Proof.
Consider the following models, where the only difference is that :
One may check that and both have , , and .
One the one hand, and can be distinguished by an -formula, just noticing that (as but ) and (since ).
On the other hand, and cannot be distinguished by any -formulas. For this, we prove a stronger result that for all , for all , iff , that is, . As the two models differs only in the neighborhood of , it is sufficient to demonstrate that iff . The proof continues with induction on , in which the only case to fix is .
First, suppose that , then and . Since , by induction hypothesis, we can obtain that and , and thus .
For the other direction, assume that , then and . As , it must be the case that , that is, . Thus . By induction hypothesis, we infer that and , therefore .
Therefore, . ∎
Corollary 3.4.
On the class of all models, the -models, the -models, the -models, the -models, and are incomparable, and thus both logics are less expressive than .
The result below states that is equally expressive as 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.
is equally expressive as on any class of neighborhood models.
Proof.
Since and , we have .
Moreover, we demonstrate that , as follows. Given any neighborhood model and , we have the following equivalences:
This implies that , and therefore is equally expressive as on any class of neighborhood models. ∎
4 Morphisms and their applications
This section proposes notions of morphisms for and , and some of their applications.
4.1 -morphisms
Definition 4.1 (-Morphisms).
Let and be neighborhood models. A function is a -morphism from to , if for all ,
-
(Var)
iff for all ;
-
(-Mor)
for all ,
We say that is a -morphic image of , if there is a surjective -morphism from to .
The following result indicates that the formulas of are invariant under -morphisms.
Proposition 4.2.
Let and be neighborhood models, and let be a -morphism from to . Then for all , for all , we have , that is, .
Proof.
By induction on . The nontrivial case is .
Suppose that , to show that . By supposition, and . By (-Mor), we have that and . By induction hypothesis, this means that and . Thus .
Conversely, assume that , to prove that . By assumption, and . By induction hypothesis, this entails that and . By (-Mor) again, we obtain that and . Therefore, . ∎
The notion of -morphisms can be applied to the following result in a relative easy way. Note that and defined on [15, p. 254] are, respectively, the special cases of and defined below when . Thus our result below is an extension of [15, Thm. 1.10].
Proposition 4.3.
Let . For each and , we have
and
where and , where and , in which .
Proof.
By Prop. 4.2, it is sufficient to show that such that is a -morphism from to , and also a -morphism from to .
The condition (Var) is clear. For (Mor), we need to show that
and
The “” of (1) and “” of (2) follows directly from the fact that .
Moreover, given , according to the definition of , we have , thus . This follows that “” of (1) and “” of (2). ∎
Note that in the above proposition, as is defined in terms of , thus given any two points , may be different from . This point will be used frequently in the proofs below.
Now coming back to Prop. 3.2, instead of directly proving that -formulas cannot distinguish between and , we can resort to Prop. 4.3, by just noticing that where and .555Note that is an arbitrary subset of , and (as ), we thus can set . Similar arguments apply for and other similar definitions of and 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.
It turns out that this corollary is quite useful in exploring the problem of frame (un)definability of . A frame property is said to be definable in a language , if there exists a set of formulas in such that iff has . When , we write simply rather than .
To demonstrate the undefinability of a frame property in a language , we (only) need to construct two frames such that one of them has but the other fails, and any -formula is valid on one frame if and only if it is also valid on the other. The argument is as follows: were defined by a set of -formulas , we would derive that iff has . As any -formula is valid on one frame if and only if it is also valid on the other, this also applies to the set . This implies that one frame has iff the other also has, which is a contradiction.
Proposition 4.5.
The frame properties and are undefinable in .
Proof.
Consider the following frames:
From the above figure, we can see that possesses and but does not, since and but .
Moreover, one may easily verify that in which , then by Coro. 4.4, we obtain that for all , we have iff . ∎
Proposition 4.6.
The frame property is undefinable in .
Proof.
Consider the following frames:
One may check that possesses whereas does not, since but although .
Besides, where and . Then by Coro. 4.4, we derive that iff for all . ∎
Although the properties of , and are undefinable in , the property is definable in the language. This can be explained via Coro. 4.4 as follows: since for all in , must be in , thus it must be the case that , and this makes a suitable definition of in showing the undefinability as in Props. 4.5 and 4.6 unavailable.
Proposition 4.7.
The frame property is definable in .
Proof.
We show that is defined by Let .
Suppose that has , to show that . For this, for any model based on and , we need to show that , which amounts to showing that (because and ). And is immediate by supposition.
Conversely, assume that does not have , then there exists such that , that is, . We have also , and thus , therefore . ∎
4.2 -morphisms
Definition 4.8 (-morphisms).
Let and be neighborhood models. A function is a -morphism from to , if for all ,
-
(Var)
iff for all ;
-
(-Mor)
for all ,
We say that is a -morphic image of , if there is a surjective -morphism from to .
Proposition 4.9.
Let and be neighborhood models, and let be a -morphism from to . Then for all , for all , we have , that is, .
Proof.
By induction on , where the only nontrivial case is .
Suppose that , to show that . By supposition, and . By (-Mor), and . By induction hypothesis, we infer that and , and thus .
Conversely, assume that , to prove that . By assumption, and . By induction hypothesis, we derive that and . Then by (-Mor) again, we get and , and therefore . ∎
The models and defined in [15, p. 262] are, respectively, the special cases of those defined in the following proposition, when . Therefore, the following proposition extends the result in [15, Thm. 2.8].
Proposition 4.10.
Let . For all and , we have
and
where and , where and for .
Proof.
By Prop. 4.9, it suffices to show that such that is a -morphism from to , and also a -morphism from to .
The condition (Var) is clear. For (-Mor), we only need to show that
and
The “” of (1) and “” of (2) are straightforward since .
Moreover, if , then , thus . This gives us “” of (1) and “” of (2). ∎
Similar to the case in Prop. 4.3, here is defined in terms of , thus given any two points , may be different from .
Now coming back to Prop. 3.3, without showing directly -formulas cannot distinguish between and , we can appeal to Prop. 4.10, by noting that where and .666Note that since is an arbitrary subset of , and (as ), then we can set . Similar arguments also holds for and other definitions of and in other situations below. Prop. 4.10 will be also useful in proving a general completeness result (see Thm. 5.29).
Corollary 4.11.
Similar to Coro. 4.4, Coro. 4.11 can also be applied to proving the results of frame (un)definability in .
Proposition 4.12.
The frame properties and are undefinable in .
Proof.
Consider the following frames:
One may check that has and , but does not, since but although .
Moreover, where . Then by Coro. 4.11, we conclude that for all , ∎
Proposition 4.13.
The frame properties and are undefinable in .
Proof.
Consider the following frames:
One may check that has and , but fails, since and but .
Moreover, where and . Then by Coro. 4.11, we conclude that for all , ∎
We conclude this part with another application of the notion of -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 , we define its transitive closure inductively as , with and , where
for every , and
for .
Fact 4.15.
[15, Fact 2.13] For all , if , then .
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 -morphisms.
Proposition 4.16.
Let be a model based on a frame and the corresponding one based on . For all and , we have
5 Axiomatizations
We now axiomatize and over various neighborhood frames.
5.1 Axiomatizations for
The following lists the axioms and inference rules that are needed in this part.
All axioms and inference rules arise in the literature, with distinct names, except for , which is derivable from axiom (K1.2) in [21], that is, . Rather, a stronger rule (denoted ), has usually been used to replace axiom (see e.g. [27, 16, 15]). But we prefer axioms to rules of inference. As we will see below, given (and propositional calculus), the rule is also derivable from .
Proposition 5.1.
is derivable from .
Proof.
We have the following proof sequences in :
∎
If we consider all axioms and rules above, we obtain a logic called in [27, 16, 15].777More precisely, the system contains the rule instead of the axiom , and skips the rule since it is then derivable from and (see [16, Prop. 3.2]). is the minimal logic for 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, is also (sound and) strongly complete with respect to the class of augmented frames [15]. Moreover, since every augmented model is a filter, thus also characterizes the class of filters. From now on, for the sake of consistency on notation, we denote the logic by here. As neighborhood semantics can handle logics weaker than the minimal relational logic, it is then natural to ask what logics weaker than look like. Here is a table that summarizes and its weaker logics and the corresponding classes of frames which determine them.888It is worth remarking that is indispensable in any proof system in the table. To see this, define a new semantics which interprets all formulas of the form as (so that is interpreted as ), then one can see that under the new semantics, is not valid, but any subsystem of in the table is sound. This entails that is not derivable in any such subsystem, and thus is indispensable in any proof system in the table.
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.
is provable in .
Proof.
Notice that we have the following proof sequences in .
∎
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 in a system , denoted , as the set of maximal consistent sets of that contains ; in symbol, . We skip the subscript and simply write whenever the system is clear. If a set of states is not a proof set in for any formula, then we say it is a non-proof set relative to .
Definition 5.3.
The canonical model for is the triple , where
-
•
,
-
•
,
-
•
.
Lemma 5.4.
For all , for all , we have , that is, .
Proof.
By induction on . The nontrivial case is , that is, we only need to show that iff .
First, suppose that , to prove that , which by induction hypothesis is equivalent to showing that and . By supposition and axiom , we infer that . As , we have , and then according to the definition of .
Conversely, suppose that , to show that . Assume that , viz., , then by induction hypothesis, , namely, . By supposition, we infer that . Then from the definition of , it follows that . Now by induction hypothesis again, we conclude that . Therefore, . ∎
We also need to show that is well-defined.
Lemma 5.5.
If and , then .
Proof.
Suppose that and , to show that . By supposition, we obtain and . By , it follows that . Therefore, . ∎
Now it is a routine work to show the following.
Theorem 5.6.
is sound and strongly complete with respect to the class of all neighborhood frames.
Theorem 5.7.
is sound and strongly complete with respect to the class of -frames.
Proof.
For soundness, we need to show the validity of over the class of -frames. For this, let be a -model, , and suppose that , to show that . Assume that , it suffices to show that . By supposition, it follows that implies , and implies . By assumption, and , and thus and . An application of gives us , that is, , as desired.
For completeness, define w.r.t. as in Def. 5.3. It suffices to show that is closed under conjunctions. For this, let be arbitrary, and suppose that and , to show that . By supposition, there are such that and , then and . From this and axiom , it follows that , and thus , viz. . ∎
Theorem 5.8.
is sound and strongly complete with respect to the class of -frames.
Proof.
For the completeness, define w.r.t. as in Def. 5.3. It suffices to show that for all , . This follows immediately from the axiom and the fact that . ∎
Corollary 5.9.
is sound and strongly complete with respect to the class of -frames.
Now we deal with the completeness of . As in the case of monotone modal logic, the canonical neighborhood function 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 be a neighborhood model. We say that is the supplementation of , if for all , .
Given any neighborhood model, its supplementation is supplemented. Also, for all . Moreover, the supplementation preserves the properties and .
Fact 5.11.
Let be a neighborhood frame. If has , then so does ; if has , then so does .
Proof.
Suppose that has . Let and , if , then and for some , thus . From and the supposition, it follows that . Therefore, . This means that has also .
Assume that has . Then for all . Since , thus for all . This entails that has also . ∎
Theorem 5.12.
is sound and strongly complete with respect to the class of -frames.
Proof.
For soundness, by the soundness of (Thm. 5.6), it suffices to show that the axiom preserves validity over -frames.
Suppose for any -model and that , to prove that . By supposition, we obtain that and . Since , by , it follows that , and therefore .
For completeness, define w.r.t. as in Def. 5.3, and consider the supplementation of , that is, . By definition of supplementation, possesses .
It suffices to show that for all , for all ,
“” follows directly from the fact that .
For “”, suppose that , then for some . Since , there must be a such that , and then . We have also , then . Note that the rule is derivable in (Prop. 5.1), thus we have , thus , as desired. ∎
Theorem 5.13.
is sound and strongly complete with respect to the class of -frames.
Proof.
Theorem 5.14.
is sound and strongly complete with respect to the class of -frames.
Proof.
Theorem 5.15.
is sound and strongly complete with respect to the class of filters.
Proof.
As for the completeness, define and w.r.t. as in Thm. 5.14. By Thm. 5.14, it suffices to show that has . 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 (denoted there) has and ; rather, they only show that (denoted there) does have, which though does not directly give us the completeness in question. ∎
5.2 Axiomatizations for
To axiomatize over various neighborhood frames, we list the following axioms and rules of inference.
Similar to the axiomatizations for , all axioms and inference rules listed above also arise in the literature, with different names. The axiom WM is derivable from a rule (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 .
Proof.
We have the following proof sequences in .
∎
It is shown that the proof system consisting of all axioms and inference rules for , denoted 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 there) and [15] (called 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 look like. Below is a table summarizing and its weaker logics and the corresponding frame classes that determine them.
Note that WE is indispensable in and its weaker systems in the above table. To see this, consider an auxiliary semantics which interprets all formulas of the form as , then one may easily verify that the subsystem 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 , and thus WE is indispensable in the weaker systems of .
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.
is derivable in .
Proof.
We have the following proof sequences:
∎
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 be a system excluding WM. A tuple is the canonical neighborhood model for , if
-
•
,
-
•
,
-
•
.
The neighborhood function is well defined.
Lemma 5.19.
Let be a system excluding WM. If and , then .
Proof.
Suppose that and , to prove that . By supposition, and . By REW, we have , and thus . ∎
Lemma 5.20.
Let be a system excluding WM. For all , for all , we have , that is, .
Proof.
By induction on , where the nontrivial case is .
Suppose that , to show that . By supposition and axiom WE, we derive that , viz., , then by IH, we obtain . It suffices to show that , which is equivalent to showing that by IH. This follows directly from the fact that .
Conversely, suppose that , to prove that . By supposition and IH, and . This immediately gives us . ∎
Now it is a standard work to show the following.
Theorem 5.21.
is sound and strongly complete with respect to the class of all neighborhood frames.
Proposition 5.22.
is sound and strongly complete with respect to the class of -frames.
Proof.
For the soundness, by Thm. 5.21, it suffices to show the validity of WC. For this, let and such that . Then and , and and . From and and , it follows that , that is, ; from it follows that . Therefore, .
For the completeness, by Thm. 5.21, it is sufficient to prove that has the property . Suppose that and , then there are such that and . From and , it follows that and . By axiom WC, we obtain , thus , namely . ∎
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 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 be a system including WM. A triple is a canonical neighborhood model for , if
-
•
,
-
•
iff ,
-
•
.
The reader may ask why we do not use this definition for systems excluding WM. This is because it does not work for system (Thm. 5.22), as one may check.
Note that Def. 5.23 does not specify the function completely; in addition to the proof sets that satisfy this definition, may also contain non-proof sets relative to . Therefore, each of such logics has many canonical neighborhood models.
We need also show that is well defined.
Lemma 5.24.
Let be a system including WM. If and , then .
Proof.
Suppose that and , to prove that . By supposition, and . By REW, we have , and thus . ∎
Lemma 5.25.
Let be a canonical neighborhood model for any system extending . Then for all , for all , we have , that is, .
Proof.
By induction on , where the nontrivial case is .
Suppose that , to show that . By supposition and axiom WE, we derive that , viz., , then by IH, we obtain . It suffices to show that , which is equivalent to showing that by IH. This follows directly from the fact that .
Conversely, suppose that , to prove that . By supposition and IH, and , which implies that . Therefore, . ∎
Given any system extending , the minimal canonical neighborhood model for , denoted , is defined such that . Similar to the cases in monotone modal logic and , due to the existence of non-proof sets, the canonical neighborhood function 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.
is sound and strongly complete with respect to the class of -frames.
Proof.
For the soundness, by Thm. 5.21, it remains to show the validity of WM. For this, let be an -model and .
Suppose that , to demonstrate that . By supposition, we have , that is to say, . Since , we have . By , we derive that . Therefore, .
For the completeness, define the supplementation of and denote it . By definition of supplementation, possesses . Thus the remainder is to prove that is indeed a canonical neighborhood model for . That is, for every , for every , we have
The proof is as follows.
‘’: This follows immediately from the fact that .
‘’: Suppose that , then there exists such that . Since , there must be a such that . By , we have . From it follows that . Note that the rule RMW is derivable in (Prop. 5.16). Thus an application of RMW gives us , that is, . From it also follows that , and then , and therefore , as required. ∎
It is shown in [15, Thm. 2.2, Coro. 2.7] that (denoted 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 is said to be negatively supplemented if for all and , if , and , then . 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 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, does this job as well.
Corollary 5.27.
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 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 w.r.t. as in Thm. 5.26, by Thm. 5.26, it suffices to prove that has , which follows directly by Fact 5.11 if possesses . But to show possesses , 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 w.r.t. the class of relational frames. Since it is shown that 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 is complete with respect to the class of filters, and hence also complete with respect to the class of -frames.
Conjecture 5.28.
is sound and strongly complete with respect to the class of filters, and also to the class of -frames.
We close this section with a general soundness and completeness result. For those systems including WM, as , thus , and hence , then by Fact 5.11, we obtain that , which means that possesses .
However, for those systems excluding WM, as (by axiom W1), by Def. 5.18, we infer that . Thus the canonical model for such systems does not have . 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 be a system of . If is determined by a certain class of neighborhood frames, then it is also determined by the class of neighborhood frames satisfying .
Proof.
Suppose that is determined by a certain class of neighborhood frames, to show that is sound and strongly complete with respect to the class of neighborhood frames satisfying . The soundness is clear, since the class of neighborhood frames satisfying is contained in .
For the completeness, by supposition, every -consistent set, say , is satisfiable in a model based on the frame in . That is, there exists a model where and a state such that . Now, applying Prop. 4.10, we obtain that for , where . Note that the definition of is well defined, since in Prop. 4.10, is an arbitrary subset of and (as ) thus , we can define to be . Moreover, possesses . Also, does not broken the previous properties. Therefore, is also satisfiable in a neighborhood model satisfying . ∎
Corollary 5.30.
The following soundness and completeness results hold:
-
1.
is sound and strongly complete with respect to the class of -frames;
-
2.
is sound and strongly complete with respect to the class of -frames;
-
3.
is sound and strongly complete with respect to the class of -frames.
6 Adding public announcements
Now we extend the previous results to the dynamic case: public announcements. Syntactically, we add the construct into the previous languages, where the formula is read “ is the case after each truthfully public announcement of ”. Semantically, we adopt the intersection semantics proposed in [20]. In details, given a monotone neighborhood model and a state ,
where is the intersection submodel , and the notion of intersection submodels is defined as below.
Definition 6.1.
[20, Def. 3] Let be a monotone neighborhood model, and is a nonempty subset of . Define the intersection submodel induced from , where
-
•
for every ,
-
•
for every .
Proposition 6.2.
[20, Prop. 2] The frame property is preserved under taking the intersection submodel. That is, if is a monotone neighborhood model with the domain , then for any , the intersection submodel is also monotone.
We obtain the following reduction axioms for and its sublanguages , .
From the reduction axioms, we can see that, every formula of (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 be a system of (resp. , ). If is sound and strongly complete with respect to the class of monotone neighborhood frames, then so is plus AP, AN, AC, AA and (resp. plus AP, AN, AC, AA and AW, plus AP, AN, AC, AA, and AW) under intersection semantics.
Proof.
We only need to show the validity of 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 be any monotone neighborhood model and .
For :
Suppose that and , to show that , that is to show and . By supposition, we have , then and . From it follows that . We have also : if not, namely , then . Since , by , we derive that : a contradiction.
Conversely, assume that , to prove that . For this, suppose that , it remains to show that , equivalently, and . By assumption and supposition, we obtain that , then and . From and , it follows that . Moreover, : otherwise, for some , and then , and thus by , we infer that , that is, : a contradiction.
Now for AW:
Suppose that and , to show that , that is to show and . By supposition, we derive that , that is, and . From , it follows that for some , and then . By , we get , that is, . Moreover, from and , it follows immediately that .
Conversely, assume that , to prove that . For this, suppose that , it suffices to demonstrate that , which means that and . By assumption and supposition, we derive that . This entails that and . From it follows that . As , by , we gain . Besides, from , it follows directly that , as desired. ∎
For the sake of simplicity, we use for the system that consists of plus the above reduction axioms involving , and for the system that consists of plus the above reduction axioms involving .
It is shown in [7, Prop. 38] that Moore sentences are unsuccessful and self-refuting, that is, is provable in (namely, the minimal Kripke logic of plus the above reduction axioms involving ). However, this does not apply to the monotone case.
Proposition 6.4.
is not provable in .
Proof.
We have the following proof sequences:
Thus we only need to show the unprovability of in . By completeness of , it remains to show that this formula is not valid over the class of -frames. To see this, just consider an -model , where , , and . It is easy to see that and , thus . Moreover, and , and hence , and therefore . Also, possesses . This establishes the required result. ∎
One may show that is provable in plus the reduction axioms for operator, since in , is provable, whose proof is similar as in [7, Prop. 38] (note that is interderivable with the rule in the presence of the rule ).
Similar to the case in the minimal Kripke logic for , in , the negations of Moore sentences are all successful formulas.
Proposition 6.5.
is provable in .
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:
Notice that is provable in . First, as , by rule (Prop. 5.1), . Moreover, : to see this, we consider its contraposition, that is, , which is just an instance of axiom . ∎
Interestingly, public announcements cannot change one’s false belief about a fact. More precisely, if you have a false belief about and someone responds with “you are wrong about ”, then you still have the false belief.
Proposition 6.6.
is provable in .
Proof.
We observe the following proof sequences:
Moreover, is provable in . To see this, note that , then by rule RMW (Prop. 5.16), we derive that , that is, . Now by WE, we obtain that . ∎
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 -morphisms and -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 -morphisms and -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.