Fitchean Ignorance and First-order Ignorance:
A Neighborhood Look
Abstract
In a seminal work [15], Fine classifies several forms of ignorance, among which are Fitchean ignorance, first-order ignorance, Rumsfeld ignorance, and second-order ignorance. It is shown that there is interesting relationship among some of them, which includes that in , all higher-order ignorance are reduced to second-order ignorance. This is thought of as a bad consequence by some researchers. It is then natural to ask how to avoid this consequence. We deal with this issue in a much more general framework. In detail, we treat the forms of Fitchean ignorance and first-order ignorance as primitive modalities and study them as first-class citizens under neighborhood semantics, in which Rumsfeld ignorance and second-order ignorance are definable. The main contributions include model-theoretical results such as expressivity and frame definability, and axiomatizations. Last but not least, by updating the neighborhood models via the intersection semantics, we extend the results to the dynamic case of public announcements, which gives us some applications to successful formulas.
Keywords: Fitchean ignorance, first-order ignorance, contingency, accident, unknown truths, expressivity, frame definability, axiomatizations, intersection semantics, successful formulas
1 Introduction
Ignorance has been a hotly discussed theme in epistemology and many other fields since Socrates, who professed ignorance in e.g. the Apology [1]. Just as there has been no consensus on the definition of knowledge, there has been no consensus on the definition of ignorance. Instead, there has been at least three views in the literature: the standard view, the new view, and the logical view.111The terminology ‘the standard view’ is introduced in [25], ‘the new view’ is from [29], whereas the term ‘the logical view’ comes from [5]. The standard view thinks that ignorance is merely the negation of propositional knowledge, the new view thinks that ignorance is the lack of true belief,222For the discussion on the standard and new view, see [20] and references therein. whereas the logical view thinks that ignorance means neither knowing nor knowing not [34, 35, 33, 13, 14, 27].333To the best of our knowledge, the first to evidently investigate ignorance from the logical view is [34] — also see its extended journal version [35], which though includes an unsound transitive axiomatization, as shown in [14, pp. 102–103].
Recently there has been a flurry of research on ignorance. Various forms of ignorance are proposed in the literature, such as pluralistic ignorance [26, 2, 30], circumscriptive ignorance [18], chronological ignorance [32], factive ignorance [19], relative ignorance [16], disjunctive ignorance [10]. In a seminal paper [15], instead of discussing the definition of ignorance, Fine classifies several forms of ignorance, among which are ‘ignorance of (the fact that)’ (also called ‘Fitchean ignorance’ there), ‘first-order ignorance (whether)’, ‘Rumsfeld ignorance’ and ‘second-order ignorance’. One is ignorant of (the fact that) , if is the case but one does not know it. One is (first-order) ignorant whether , if one neither knows nor knows its negation. One is Rumsfeld ignorant of , if one is ignorant of the fact that one is ignorant whether . One is second-order ignorant whether , if one is ignorant whether one is ignorant whether .
As Fine [15] shows, there is interesting relationship among some of the forms. For instance, within the context of the system , second-order ignorance implies first-order ignorance; second-order ignorance implies Rumsfeld ignorance, and vice versa; one does not know one is Rumsfeld ignorant; one does not know one is second-order ignorant. However, all these results are based on the context of . It is then natural to ask what relationship among these forms there is in other contexts, based on the following reasons: firstly, although knowledge is usually based on (for instance in [17]), ignorance is not — it is argued on the new view that ignorance is not not-knowing (e.g. [29]); secondly, in the first explicitly logical studies on ignorance [34, 35], the semantic condition is arbitrary, without any restriction; moreover, in , all higher-order ignorance are reduced to second-order ignorance — this is called the black hole of ignorance in [15] and a quite problematic phenomenon in [3, p. 1060].
One may easily check that the latter two forms are definable with the former two ones. It is the former two forms that are our focus here.444Fitchean ignorance and first-order ignorance correspond to important metaphysical concepts — accident (or ‘accidental truths’) and contingency, respectively. For the history of the bimodal logic of contingency and accident and the importance of the two metaphysical concepts, we refer to [7] and the reference therein. It is important to distinguish these two forms. For instance, the Fitchean ignorance satisfies the so-called Factivity Principle (that is, if an agent is ignorant of then is true), but the first-order ignorance does not.555In a recent work [3, p. 7], the authors seem to think that ignorance has only one form, and say that ignorance should satisfy Factivity Principle since knowledge does. Moreover, since the operators of the two forms and their duals are not normal, the logic of Fitchean ignorance and first-order ignorance is not normal. As is well known, neighborhood semantics has been a standard semantics tool for non-normal modal logics since its introduction in 1970 [24, 31, 4, 28]. In the current paper, we will investigate the logical properties of the two forms of ignorance and their relationship under the neighborhood semantics. As we will show, there is interesting relationship among first-order ignorance, second-order ignorance, and Rumsfeld ignorance. For example, under any condition, Rumsfeld ignorance implies first-order ignorance, and second-order ignorance plus first-order ignorance implies Rumsfeld ignorance, whereas under the condition , Rumsfeld ignorance implies second-order ignorance, and thus Rumsfeld ignorance amounts to second-order ignorance plus first-order ignorance. However, similar to the case for relational semantics [7], the situation may become quite involved if we study the two notions in a unified framework under the neighborhood semantics. For instance, we will be confronted with a difficulty in axiomatizing the bimodal logic, since we have only one neighborhood function to deal with two modal operators uniformly, which makes it hard to find suitable interaction axioms.
The remainder of the paper is organized as follows. After briefly reviewing the syntax and the neighborhood semantics of the bimodal logic of Fitchean ignorance and first-order ignorance and also some related logics (Sec. 2), we compare the relative expressivity (Sec. 3) and investigate the frame definability of the bimodal logic (Sec. 4). We axiomatize the bimodal logic over various classes of neighborhood frames (Sec. 5). By updating the neighborhood models via the intersection semantics, we find suitable reduction axioms and thus reduce the public announcements operators to the bimodal logic, which gives us good applications to successful formulas (Sec. 6), where, as we shall show, any combination of , , , and via conjunction (or, via disjunction) is successful under the intersection semantics. Finally, we conclude with some future work in Sec. 7.
2 Syntax and Neighborhood Semantics
This section introduces the languages and their neighborhood semantics involved in this paper.
Fix a nonempty set P of propositional variables, and let . In what follows, is the language of standard epistemic logic, is the language of the logic of (first-order) ignorance, is the language of the logic of Fitchean ignorance666 is also called ‘the logic of essence and accident’ or ‘the logic of unknown truths’, see e.g. [23, 33]., and is the language of the bimodal logic of Fitchean ignorance and first-order ignorance. We will mainly focus on . For the sake of simplicity, we only exhibit the single-agent languages, but all our results also apply to multi-agent cases.
Definition 1 (Languages).
is read “one knows that ”, is read “one is (first-order) ignorant whether ”, and is read “one is ignorant of (the fact that) ”, or “ is an unknown truth”. In the metaphysical setting, and are read, respectively, “it is contingent that ” and “it is accidental that ”. Among other connectives, , , and abbreviate, respectively, , , and , read “it is epistemically possible that ”, “ one knows whether ”, and “one is non-ignorant of ”.
Note that the forms of ‘Rumsfeld ignorance (of )’ and ‘second-ignorance (whether )’ can be defined as, respectively, and .
The above languages are interpreted over neighborhood models.
Definition 2 (Neighborhood structures).
A (neighborhood) model is a triple , where is a nonempty set of states (also called ‘points’ or ‘possible worlds’, is a neighborhood function from to , and is a valuation function. A (neighborhood) frame is a model without a valuation; in this case, we say that the model is based on the frame. A pointed model is a pair of a model with a point in it. Given an , an element of is called ‘a neighborhood of ’.
The following list of neighborhood properties come from [12, Def. 3].
Definition 3 (Neighborhood properties).
Let be a frame, and be a model based on . Let and . We define various neighborhood properties as follows.
-
•
: contains the unit, if .
-
•
: contains its core, if .
-
•
: is closed under intersections, if implies .
-
•
: is supplemented, or closed under supersets, if and implies .
-
•
: is closed under complements, if implies .777The property provides a new perspective for , see [6] for details.
-
•
: implies .
-
•
: implies .
-
•
: implies .
-
•
: implies .
-
•
: implies .
The function possesses such a property, if for all , has the property. (and ) has a property, if has. In particular, we say that (and ) is monotone, if has . (and ) is a quasi-filter, if has and ; (and ) is a filter, if has also .
Also, in what follows, we will use to denote the class of -models, and similarly for , etc. We use for the class of all neighborhood models.
Definition 4 (Semantics).
Let be a model. Given a pointed model , the truth condition of formulas is defined recursively as follows:
where denotes the truth set of in , in symbols, ; given a set , denotes the complement of with respect to .
We say that is true in , if ; we say that is valid on a model , notation: , if for all in , we have ; we say that is valid on a frame , notation: , if for all based on , we have ; we say that is valid over a class of frames, notation: , if for all in , we have ; we say that is satisfiable over the class , if . Similar notions go to a set of formulas.
For the sake of reference, we also list the semantics of the aforementioned defined modalities as follows:
3 Expressivity
In this section, we compare the relative expressivity of and other languages introduced before, over various classes of neighborhood models. Some expressivity results over the class of relational models have been obtained in [7] and [9].
To make our presentation self-contained, we introduce some necessary technical terms.
Definition 5.
Let and be two languages that are interpreted on the same class of models , where ranges over classes of models which are models for and for .
-
•
is at least as expressive as over , notation: , if for all , there exists such that for all and all in , we have that iff .
-
•
and are equally expressive over , notation: , if and .
-
•
is less expressive than over , notation: , if but .
-
•
and are incomparable in expressivity over , notation: , if and .
It turns out that over the class of -models and the class of -models, is at least as expressive as (Prop. 10 and Prop. 11), whereas is not at least as expressive as over the class of models possessing either of other eight neighborhood properties (Prop. 6-Prop. 8).
Proposition 6.
, where .
Proof.
Consider the following models, which comes from [12, Prop. 2]. An arrow from a state to a set means that is a neighborhood of (Idem for other arrows).
It has been shown in [12, Prop. 2] that both and satisfy , , and , and and cannot be distinguished by .
However, both pointed models can be distinguished by an . To see this, note that and , and thus , whereas , as . ∎
Proposition 7.
, where .
Proof.
Consider the following models, which comes from [12, Prop. 3]:
It has been shown in [12, Prop. 3] that both and satisfy and , and and cannot be distinguished by .
However, both pointed models can be distinguished by an . To see this, note that and , and thus , whereas , as . ∎
Proposition 8.
, where .
Proof.
Consider the following models, which is a revision of the figures in [12, Prop. 4]:
Firstly, and satisfy and . In what follows we only show the claim for ; the proof for the case is analogous.
-
-
For : Suppose that . Then or . Notice that . Similarly, we can demonstrate that holds for .
-
-
For : Assume that . Then or . Notice that . A similar argument goes for .
Secondly, and cannot be distinguished by , that is to say, for all , we have that iff . The proof goes by induction on , where the only nontrivial case is . By semantics, we have the following equivalences:
In either case, the penultimate line of the proof merely states that cannot be interpreted on the related model: its denotation is not one of all possible subsets of the domain. We conclude that iff .
Finally, we show that and can be distinguished by . To see this, note that , and thus . However, since , we have . ∎
Remark 9.
The reader may ask whether the figure in [12, Prop. 4] (as below) applies to the above proposition.
The answer is negative. This is because the pointed models and in this figure cannot be distinguished by either. To see this, note that iff and , which by the construction of implies that and and , which is impossible. It then follows that . A similar argument can show that . Therefore, iff .
Proposition 10.
.
Proof.
It suffices to show that is valid over the class of -models. Let be a -model and . Suppose that , it remains only to prove that . By supposition, we have and . We have also : otherwise, by , , that is, : a contradiction. Thus , and therefore . The converse is clear from the semantics. ∎
Proposition 11.
.
Proof.
It suffices to show that over the class of -models. The proof is almost the same as that in Prop. 10, except that (that is, ) is obtained from and the property . ∎
Conversely, on the class of -models and the class of -models, is at least as expressive as (Prop. 15 and Prop. 16), whereas on the class of models possessing either of other eight neighborhood properties, is not at least as expressive as (Prop. 12-Prop. 14). As a corollary, on the class of -models and the class of -models, , , and are equally expressive, whereas over the class of models possessing the eight neighborhood properties in question, and are both less expressive than (Coro. 17).
Proposition 12.
, where .
Proof.
Consider the following models:
It is straightforward to check that both and satisfy , , , , and . In what follows, we show that and both have the property .
-
-
For : suppose that . Then or . This implies that . Similarly, we can show that holds for .
-
-
For : assume that . Then or . If , then ; if , then . Now assume that . Then or . If , then ; if , we can also show that .
Moreover, and cannot be distinguished by . Here we use the notion of -morphisms introduced in [11, Def. 4.1].888Recall that the notion of -morphisms is defined as follows. Let and be neighborhood models. A function is a -morphism from to , if for all , (Var) iff for all , (-Mor) for all , . It is then demonstrated in [11, Prop. 4.1] that the formulas of are invariant under -morphisms. In details, let and be neighborhood models, and let be a -morphism from to . Then for all , for all , we have that iff . Define a function such that and . We prove that is a -morphism from to . The condition (Var) follows directly from the valuations. For the condition (-Mor), we first prove that it holds for : assume that and , then it must be that . Then we have and . The converse is similar. In a similar way, we can show that (-Mor) also holds for . Then by [11, Prop. 4.1] (see also fn. 8), we have iff for all .
However, these pointed models can be distinguished by . This is because (as and ) and (as ). ∎
Proposition 13.
.
Proof.
Consider the following models:
Firstly, both and have .
-
-
For : Suppose that . Then , and so . Now assume that . Then or . If , then ; if , then .
-
-
For : Suppose that . Then or . Either case implies that . Now assume that . Then or . Again, either case implies that .
Secondly, similar to the proof of the corresponding part in Prop. 12, we can show that and cannot be distinguished by .
It remains only to show that and can be distinguished by . The proof for this is analogous to that in Prop. 12. ∎
Proposition 14.
.
Proof.
Consider the following models:
Firstly, both and possess the property . Since for all , , the property is possessed vacuously by Similarly, is also possessed vacuously by . It remains only to show that both and have .
-
-
For : suppose that , then or . Either case implies that .
-
-
For : assume that , then . This follows that .
Secondly, and cannot be distinguished by . Again, this can be shown as the corresponding part in Prop. 12.
Finally, and can be distinguished by . On one hand, and , thus . On the other hand, , thus . ∎
Proposition 15.
.
Proof.
We claim that over the class of -models, .
First, we show that .
Let be any model and . Suppose that . Then and , that is, . We have either or . If , since , we infer that ; if , since , we derive that . Therefore, . Since is arbitrary, this establishes the validity of .
Conversely, we prove that over the class of -models, .
Suppose that be a -model and . Assume that . Then or . If , then . By , we have , so . If , then , namely . By again, we obtain , and thus . Therefore, . ∎
Proposition 16.
.
Proof.
We claim that over the class of -models, . The proof is almost the same as that in Prop. 15, except that in the proof of the validity of , is obtained as follows: if , then and , thus , namely , and then by , we infer that , namely , so ; similarly, we can show that if then . ∎
With the above results in mind, we have the following result, which extends the expressivity results over Kripke models in [7].
Corollary 17.
Where , , and , where . Where , , where .
Moreover, over the class of -models and the class of -models, and are equally expressive (Prop. 20), whereas over the class of models possessing either of other eight neighborhood properties except for , is less expressive than (Prop. 18 and Prop. 19).
Proposition 18.
, where .
Proposition 19.
, where .
Proof.
Consider the following models and , where and .
It should be straightforward to check that both and possess and . Moreover, both models also possess , shown as follows. Since for all , we have , one may easily see that has . Similarly, we can show that has . Besides,
-
-
has : suppose that , then or . The first case implies , and the second case implies that , as desired.
-
-
has : assume that , then or . The first case entails that , and the second case entails that , as desired.
Next, we show and cannot be distinguished by . That is, for all , we have iff . The proof proceeds by induction on , where the nontrivial cases are and . The proof for the case is shown as in Remark 9. For the case , we have the following equivalences.
In either case, the penultimate line of the equivalences states that cannot be interpreted on the related model: its denotation is not one of all possible subsets of the domain. We therefore conclude that iff .
Finally, and can be distinguished by . To see this, note that , thus ; however, , and thus . ∎
Proposition 20.
, where .
We do not know whether is less expressive than over the class of -models. We conjecture the answer is positive. We leave it for future work.
We summarize the results in this section as follows.
4 Frame Definability
We have shown in the previous section that is more expressive than and (at the level of models). It may then be natural to ask whether a similar situation holds at the level of frames. Recall that it is shown in [12, Prop. 7] that all frame properties in Def. 3, in particular , are undefinable in . In what follows, we shall show that all frame properties in question except for are undefinable in , thus is also more expressive than and at the level of frames. First, we need some related notion.
Definition 21.
Let be a set of -formulas, and a neighborhood property. We say that defines , if for all frames , has if and only if . If is a singleton, say , we will write rather than . We say that is definable in , if there exists a set of -formulas that defines it.
Proposition 22.
The frame property is definable in .
Proof.
[11] has shown that is defined in , by . Therefore, is also definable in , by . ∎
Proposition 23.
The frame properties , , , , and are undefinable in .
Proof.
Consider the following frames , , and 999This come from [12, Prop. 7].:
It has been observed in [12, Prop. 7] that satisfies and but does not. Also, it is straightforward to check that satisfies but does not. Moreover, satisfies , and , whereas does not. To see does not satisfy , note that but . In what follows, we show that for all , iff iff .
Suppose that . Then there exists such that . Define a valuation on as iff for all . By induction on , we show that : iff , where . The nontrivial cases are and . The case can be shown as in [12, Prop. 7]. For the case , notice that iff ( and ) iff ( and ), where the last one is a contradiction, and thus ; a similar argument gives us . We have thus proved . This entails that , and thus . The converse is similar. Therefore, iff .
It remains only to show that iff . Assume that . Then there exists such that . Define a valuation on such that iff for all . By induction on , we show that : iff , where . The nontrivial cases are and . Again, the case can be shown as in [12, Prop. 7]. For the case , just note that iff ( and ) iff ( and and and ) iff false. Thus holds. This implies that , and then . The converse is analogous. Therefore, iff .
If were to be defined by a set of -formulas, say , then as satisfies , we have . Then we should also have , which means that has : a contradiction. Therefore, is undefinable in . Similarly, we can show other frame properties in question are undefinable in . ∎
Proposition 24.
The frame properties and are undefinable in .
Proof.
Consider the following frames and , where and :
Firstly, one may easily see that has . Also, has . Suppose that , to show that . By supposition, or . Either case implies that . Thus has . A similar argument applies to showing that has .
Secondly, does not have , since and but . Moreover, does not have . This is because, for instance, but .
Thirdly, for all , we have that iff . Suppose that . Then there exists and such that . Define to be a valuation on such that iff , and iff . In what follows, we show : for all , iff , and iff , where . We proceed by induction on , where the nontrivial cases are and .
For the case , we have the following equivalences.
In each case, the last line of the above proofs states that cannot be interpreted on the related models, which is impossible. Thus and . Analogously, we can show that and .
For the case , we have the following equivalences.
This shows that iff . Therefore, iff for all .
This gives us that iff for all . We have now completed the proof of .
If were to be defined by a set of -formulas, say , then as has , we would have , thus we should also have , that is, has : a contradiction. Therefore, is not definable in . Similarly, we can obtain the undefinability of in . ∎
Proposition 25.
The frame property is undefinable in .
Proof.
Consider the following frames and , where and :
Firstly, has . Suppose that , to prove that . By supposition, or . Either case implies that . Thus has . A similar argument shows that has .
Secondly, does not . For instance, and .
Thirdly, for all , we have that iff . Suppose that . Then there exists and such that . Define to be a valuation on such that iff , and iff . In what follows, we show : for all , iff , and iff , where . We proceed by induction on , where the nontrivial cases are and .
For the case , we have the following equivalences.
In each case, the last line of the above proofs states that cannot be interpreted on the related models, which is impossible. Thus and . Analogously, we can show that and .
For the case , we have the following equivalences.
Thus iff . Therefore, iff for all .
Therefore, iff for all . This completes the proof of .
If were to be defined by a set of -formulas, say , then as has , we would have , thus we should also have , that is, has : a contradiction. Therefore, is not definable in . ∎
5 Axiomatizations
In this section, we axiomatize over various classes of neighborhood frames.
5.1 Classical logic
5.1.1 Proof system and Soundness
Definition 26.
The classical logic of , denoted , consists of the following axioms and inference rules:
Intuitively, E1 says that one is (first-order) ignorant whether a proposition holds if and only if one is ignorant whether its negation holds; E2 says that one is (Fitchean) ignorant of the fact that only if it is the case that ; E3 describes the relationship between Fitchean ignorance and first-order ignorance: if one is ignorant whether , then either one is ignorant of the fact that or one is ignorant of the fact that is not the case; and concerns the replacement of equivalences for first-order ignorance and Fitchean ignorance, respectively.
It is straightforward by axiom E2 that is provable in , which says that under any condition, Rumsfeld ignorance implies first-order ignorance.
The following result states how to derive Fitchean ignorance, which means that if one is ignorant whether a true proposition holds, then one is ignorant of the proposition. It will be used in several places below (for instance, Lemma 31, Lemma 34, and Prop. 40).
Proposition 27.
. Equivalently, .
Proof.
We have the following proof sequence:
∎
As a corollary, we have , and thus . This means, in Fine [15] terms, second-order ignorance plus first-order ignorance implies Rumsfeld ignorance. On one hand, this is not noticed in Fine [15]; on the other hand, this plus the transitivity entails that second-order ignorance implies Rumsfeld ignorance, a result in the paper in question.
The following result indicates how to derive a proposition from Fitchean ignorance.
Proposition 28.
Proof.
We have the following proof sequence.
∎
Proposition 29.
is sound with respect to the class of all (neighborhood) frames.
Proof.
It suffices to show the validity of axiom E3. This has been shown in the proof of Prop. 15. ∎
5.1.2 Completeness
Definition 30.
The canonical model for is , where
-
-
,
-
-
,
-
-
.
Lemma 31.
For all , for all , we have
That is, .
Proof.
By induction on . The nontrivial cases are and .
For case :
First, suppose that , to show that . By supposition, we have . Then by definition of , we infer that . By supposition again and axiom E1, we have , and thus , and hence , that is, . By induction hypothesis, we have and . Therefore, .
Conversely, assume that (that is, ), to show that . By assumption, and . Since , we have either or . If , then by axiom E2, , and then , viz. , which by induction hypothesis implies that . If , then again by axiom E2, , thus , which by induction hypothesis entails that . We have now shown that either or , and we therefore conclude that .
For case :
First, suppose that , to show that . By supposition and axiom E2, we have . By induction hypothesis, . By supposition and definition of , we infer that , which by induction means that . Therefore, .
Conversely, assume that , to demonstrate that . By assumption, . If , it is obvious that . Otherwise, by induction hypothesis, we have , then . By Prop. 27, , and thus , by induction we obtain , and therefore we have also . ∎
It is then a standard exercise to show the following.
Theorem 32.
is sound and strongly complete with respect to the class of all neighborhood frames.
5.2 Extensions
5.2.1
Define be the smallest extension of with the following axiom, denoted E4:
Intuitively, E4 says that Fitchean ignorance implies first-order ignorance.
From E4 we can easily prove . This turns the canonical model for (Def. 30) into the following simpler one.
Definition 33.
The canonical model for is a triple , where
-
•
-
•
-
•
.
Lemma 34.
For all , for all , we have
That is, .
Proof.
By induction on . The nontrivial cases are and . The case has been shown in [12, Lemma 1]. It suffices to show the case .
Suppose that . Then by axiom E2, we have ; by axiom E4, we derive that , and thus . This follows that . By induction hypothesis, and . Therefore, .
Conversely, assume that , to show that , which by induction hypothesis amounts to showing that or . For this, suppose that , this plus the assumption implies that . Then by Prop. 27, , and therefore . ∎
Proposition 35.
possesses the property .
Proof.
Refer to [12, Thm. 2]. ∎
Now it is a standard exercise to show the following.
Theorem 36.
is sound and strongly complete with respect to the class of -frames.
In the neighborhood context , there is some relationship between Rumsfeld ignorance, second-order ignorance and first-order ignorance. The following is immediate from the axiom E4.
Proposition 37.
is provable in .
This says that under the condition , Rumsfeld ignorance implies second-order ignorance.
Combined with an instance of the axiom E2 () and (see the remark after Prop. 27), it follows that within the neighborhood context , Rumsfeld ignorance amounts to second-order ignorance plus first-order ignorance, and thus Rumsfeld ignorance is definable in terms of first-order ignorance.
5.2.2
Let . From and Prop. 27 it follows that is derivable in .
Theorem 38.
is sound and strongly complete with respect to the class of all -frames.
5.2.3 Monotone logic
Let be the extension of plus the following extra axioms:
Proposition 39.
is provable in .
Proof.
We have the following proof sequence in .
∎
In the above proof, says that if one is ignorant about whether holds, then one is ignorant about whether everything holds.
Proposition 40.
is provable in .
Proof.
We have the following proof sequence in .
∎
Proposition 41.
is sound with respect to the class of all -frames.
Proof.
By soundness of (Prop. 29), it suffices to show the validity of the extra axioms. Let be an arbitrary -model and .
For M1: suppose that . Then and , that is, and . Since and is closed under supersets, we must have . Similarly, we can show that . Therefore, , as desired. Similarly, we can show the validity of M2 and M3.
For M4: assume that . Then . Since , by the property , we have , and therefore . ∎
Definition 42.
Let be an extension of . A triple is a canonical neighborhood model for if
-
•
,
-
•
iff for all ,
-
•
.
We need to show that is well defined.
Proposition 43.
Let as defined in Def. 42. If , then for all iff for all .
Proof.
Suppose that , then , and thus . By , , and , we infer that and , and hence . Therefore, for all iff for all . ∎
Lemma 44.
Let be an arbitrary canonical neighborhood model for any system extending . Then for all , for all , we have
That is, .
Proof.
By induction on . The nontrivial cases are and .
For case :
Suppose that , to show that . By supposition and induction hypothesis, or (that is, ). If , then for all . By letting , then , and thus . If , with a similar argument we can show that , that is, , and we also have .
Conversely, assume that , to prove that . By assumption and induction hypothesis, and , that is, . Then for some , and for some . We consider the following cases.
-
-
and . That is, and . Then by axiom M1, we infer that .
-
-
and . That is, and . By axiom M3, , that is, .
-
-
and . That is, and . Then by axiom M3, we derive that .
-
-
and . That is, and . By axiom M2, we obtain that .
Either case implies that , as desired.
For case .
Suppose that , to show that . By supposition and axiom E2, we obtain , which by induction hypothesis means that . We have also : otherwise, by definition of , we should have for all , which then implies that (by letting ), a contradiction. Then by induction hypothesis, . Therefore, .
Conversely, assume that (that is, ), to prove that . For this, suppose that , by induction hypothesis, we have , and then . By axiom M4, for all . By definition of , we derive that . Then by induction hypothesis again, we conclude that . Therefore, , as desired. ∎
Given an extension of , the minimal canonical neighborhood model for , denoted , is defined such that . Note that is not necessarily supplemented. Therefore, we define a notion of supplementation, which comes from [4].
Definition 45.
Let be a neighborhood model. The supplementation of , denoted , is a triple , in which for every , is the superset closure of ; namely, for each ,
One may easily show that is supplemented, that is, possesses . Also, . Moreover, the properties of being closed under intersections and containing the unit are closed under the supplementation.
Proposition 46.
Let be a neighborhood model and be its supplementation. If possesses , then so does ; if possesses , then so does .
In what follows, we will use to denote the supplementation of , namely , where extends . By the definition of supplementation, is an -model. To show the completeness of over the class of -frames, by Lemma 44, it remains only to show that is a canonical neighborhood model for .
Lemma 47.
Let extends . For every , we have
Proof.
Right-to-Left: Immediate by the definition of and the fact that .
Left-to-Right: Suppose that , to prove that By supposition, for some . Then there must be a such that , and thus for all , and hence . From , it follows that , and then , and thus and by , , and . Therefore, for all . ∎
Based on the previous analysis, we have the following.
Theorem 48.
is sound and strongly complete with respect to the class of all -frames.
We conclude this part with some results which will be used in Section 6. The following result states that if one is ignorant of the fact that either holds or one is ignorant whether holds, then one is either ignorant of the fact that or ignorant whether holds.
Proposition 49.
is provable in .101010In fact, we can show a stronger result: is provable in . But we do not need such a strong result below.
Proof.
By Thm. 48, it suffices to show the formula is valid over the class of -frames. Let be an -model and .
Suppose, for reductio, that and . From the former, it follows that and ; from the latter, it follows that and . This implies that , which plus gives us . Since , by , we conclude that : a contradiction, as desired. ∎
The following result says that if one is ignorant of the fact that either non-ignorance of or non-ignorance whether holds implies that , then one is ignorant of the fact that .
Proposition 50.
is provable in .
Proof.
By Thm. 48, it remains only to prove that the formula is valid over the class of -frames. Let be an -model and .
Assume, for reductio, that and . The former implies and ; the latter entails that . Then , and thus . One may easily verify that . Then by , we conclude that : a contradiction. ∎
5.2.4 Regular logic
Define , where
Proposition 51.
is sound with respect to the class of quasi-filters.
Proof.
Proposition 52.
Let extends . Then the minimal canonical model has the property . As a corollary, its supplementation is a quasi-filter.
Proof.
Suppose that , to show that . By supposition, there exist and such that and , and then for all , and for all . By axioms R1 and R2, we can obtain that for all , which implies that , that is, . ∎
Theorem 53.
is sound and strongly complete with respect to the class of quasi-filters.
5.2.5
Define .
Again, like the case of (Sec. 5.2.2), is derivable from and Prop. 27. This hints us that the inference rule R1 in [7, Def. 12] is actually dispensable. (Fact 13 therein is derivable from axiom A1 and axiom A6. Then by R2, we have implies , and then . Thus we derive R1 there.)
Theorem 54.
is sound and strongly complete with respect to the class of filters.
Proof.
Inspired by the definition of , one may define the canonical relation for the extensions of as follows:
iff for all , if for all , then .
Recall that the original definition of canonical relation given in [7, Def. 18] is as follows:
iff there exists such that , and for all , if , then .
One may ask what the relationship between and is. As we shall see, they are equal to each other. Before this, we need some preparation.
Proposition 55.
Proof.
By Thm. 54, it remains only to show that this formula is valid over the class of filters.
Let be a filter and . Suppose that , to show . By , we have and . By , we infer that or . Since , we derive that . Then by , we get , that is, . If , then as has the property , , viz. . Since possesses the property and , it follows that : a contradiction. This entails that , and thus . Note that and . Using again, we conclude that and , and therefore , as desired. ∎
Proposition 56.
Let be an extension of . Then for all , iff .
Proof.
Suppose that , to show that . By supposition, for all , if for all , then . Letting , we can infer that for some . If , that is, , then by axiom E3, we derive that or . If , then we have . Either case implies that for some . Now suppose for any that . By Prop. 55, we infer that for all . Then by supposition again, we conclude that . Therefore, .
Conversely, assume that , then there exists such that , and for all , if , then . It remains to prove that . For this, suppose for any that for all . By letting , we obtain that ; by letting , we infer that . Thus . Then by , we conclude that , and therefore , as desired. ∎
6 Updating neighborhood models
In this section, we extend the previous results to the dynamic case of public announcements. Syntactically, we add the constructor into the previous languages , and , and denote the obtained extensions by , , , respectively. is read “after every truthfully public announcement of , holds”. Also, as usual, abbreviates . Semantically, we adopt the intersection semantics in the literature (e.g. [37, 21, 22]). In detail, given a monotone neighborhood model and a state ,
where is the intersection submodel , and the notion of intersection submodels is defined as below.
Definition 57.
[21, Def. 3] Let be a monotone model, and a nonempty subset of . Define the intersection model induced from in the following.
-
•
for every , ,
-
•
.
Proposition 58.
[21, Prop. 2] The neighborhood property is preserved under taking the intersection submodel. That is, if is a monotone neighborhood model with the domain , then for any nonempty subset of , the intersection submodel is also monotone.
The following lists the reduction axioms of and its sublanguages and under the intersection semantics.
The following reduction axioms are derivable from the above reduction axioms.
Theorem 59.
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 , plus AP, AN, AC, AA, and ) under intersection semantics.
Proof.
The validity of axioms AP, AN, AC, AA can be found in [21, Thm. 1], [22, Thm. 2, Thm. 3] and [37, Prop. 3.1]. The validity of has been shown in [11], where the axiom is named . The validity of is shown as follows. Let be an -model and .
To begin with, suppose that and , to show that . By supposition, we have , which implies and .
We claim that , that is, and . If , then . As , by , we have : a contradiction. If , then . Note that : for any , , thus and , and hence . By again, : a contradiction again.
We also claim that , that is, and . If , then . As , we infer by that : a contradiction. If , then . Since , by again, we derive that : a contradiction again.
Conversely, assume that , to prove that . For this, we suppose that , it remains only to show that , that is, and . By assumption and supposition, we obtain . This follows that and , and and .
We claim that . Otherwise, that is, , we have for some . This implies that : for any , we would have , since if , then . By , : a contradiction.
We also claim that . Otherwise, that is, , we infer that for some . It then follows that : for any , we have , since if , then , and so . By again, : a contradiction, as desired. ∎
For the sake of reference, we use to denote the extension of with all the above reduction axioms. By dropping from , we obtain the system ; by dropping from , we obtain the system .
In what follows, we will focus on some successful formulas in our languages. A formula is said to be successful, if it still holds after being announced; in symbols, . Recall that is shown to be successful under the relational semantics in [7, Prop. 39] and under the intersection semantics in [11, Prop. 6.5]. We will follow this line of research and say much more. As we shall show, any combination of , , , and via conjunction (or, via disjunction) is successful under the intersection semantics.111111It is shown in [7, Prop. 38] that under Kripke semantics, is self-refuting and is successful.
To begin with, we show that, provably, any combination of , , , and via conjunction is successful under the intersection semantics.
Proposition 60.
is successful under the intersection semantics. That is, is provable in .
Proof.
Straightforward by AP. ∎
Proposition 61.
is successful under the intersection semantics. That is, is provable in .
Proof.
Straightforward by AN and AP. ∎
Proposition 62.
is successful under the intersection semantics. That is, is provable in .
Proof.
Refer to [11, Prop. 6.5]. ∎
Proposition 63.
is successful under the intersection semantics. That is, is provable in .
Proof.
We have the following proof sequence in .
Therefore, is provable in . ∎
Intuitively, means that “after being told that one is not ignorant whether , one is still not ignorant whether .” In other words, one’s non-ignorance about a fact cannot be altered by being announced.
Proposition 64.
is successful under the intersection semantics.
Proof.
Note that is equivalent to , and is successful. ∎
Proposition 65.
is successful under the intersection semantics. That is, is provable in .
Proof.
We have the following proof sequence in .
Therefore, is provable in . ∎
Proposition 66.
is successful under the intersection semantics. That is, is provable in .
Proof.
We have the following proof sequence in .
By Prop. 39, is provable in , so is the last formula in the above proof sequence, and thus is provable in . ∎
Proposition 67.
is successful under the intersection semantics.
Proof.
By E2, is equivalent to . And we have already known from Prop. 61 that is successful. ∎
Proposition 68.
is successful under the intersection semantics. That is, is provable in .
Proof.
We have the following proof sequence in .
Therefore, is provable in . ∎
We have seen that both and are successful. One natural question would be whether their conjunction, viz. , is successful. Note that this does not obviously hold, since for instance, both and are successful, whereas is not, see e.g. [36, Example 4.34].
Proposition 69.
is successful under the intersection semantics. That is, is provable in .
Proof.
By AC, . We show that both and are provable in .
We have the following proof sequence in .
Thus both and are provable in . Therefore, is provable in . ∎
Intuitively, says that after being told that one is neither ignorant whether nor ignorant of , one is still neither ignorant whether nor ignorant of . In short, one’s non-ignorance whether and non-ignorance of a fact cannot be altered by being announced.
The following two propositions can be shown as in Prop. 64.
Proposition 70.
is successful under the intersection semantics.
Proposition 71.
is successful under the intersection semantics.
Proposition 72.
is successful under the intersection semantics. That is, is provable in .
Proof.
By AC, . One may easily verify that is provable in . It remains only to show that both and are provable in the system in question.
We have the following proof sequence in .
By Prop. 40, is provable in , so is the last formula in the above proof sequence, and thus is provable in .
Also, we have the following proof sequence in .
By Prop. 39, is provable in , thus the last formula in the above proof sequence is provable in . Therefore, is provable in .
According to the previous analysis, is provable in . ∎
Proposition 73.
is successful under the intersection semantics. That is, is provable in .
Proof.
Proposition 74.
is successful under the intersection semantics.
Proof.
The proof is similar to that of Prop. 64. ∎
Now we demonstrate that any combination of , , , and via disjunction is successful under the intersection semantics. First, one may show that is provable from the above reduction axioms. For the sake of reference, we denote it AD.
Proposition 75.
is successful under the intersection semantics.
Proof.
Note that is equivalent to , and is successful. ∎
Proposition 76.
is successful under the intersection semantics. That is, is provable in .
Proof.
Just note that is equivalent to , which by E2 is equivalent to . And is successful. ∎
Proposition 77.
is successful under the intersection semantics. That is, is provable in .
Proof.
We have the following proof sequence in .
Therefore, is provable in . ∎
Proposition 78.
is successful under the intersection semantics.
Proof.
By E2, is equivalent to , and Prop. 62 has shown that is successful under the intersection semantics. ∎
Proposition 79.
is successful under the intersection semantics. That is, is provable in .
Proof.
We have the following proof sequence in .
Therefore, is provable in . ∎
Proposition 80.
is successful under the intersection semantics. That is, is provable in .
Proof.
We have the following proof sequence in .
By Prop. 50, is provable in ; by axiom M1 and , we can show the provability of in . Therefore, is provable in . ∎
Intuitively, says that one’s either non-ignorance of or non-ignorance whether a fact cannot be altered by being announced: after being told that one is either not ignorant of or not ignorant whether , one is still either not ignorant of or not ignorant whether .
Next two propositions are shown as in Prop. 75.
Proposition 81.
is successful under the intersection semantics.
Proposition 82.
is successful under the intersection semantics.
Proposition 83.
is successful under the intersection semantics. That is, is provable in .
Proof.
By the proof of Prop. 76, is equivalent to , so is . And is successful. ∎
Proposition 84.
is successful under the intersection semantics.
Proof.
By E2, is equivalent to , and we have shown in Prop. 80 that is successful under the intersection semantics. ∎
Proposition 85.
is successful under the intersection semantics.
Proof.
The proof is similar to that of Prop. 75. ∎
7 Conclusion and Future work
In this paper, we investigated the bimodal logic of Fitchean ignorance and first-order ignorance under the neighborhood semantics. We compared the relative expressivity between and the logic of (first-order) ignorance and the logic of Fitchean ignorance , and between and standard epistemic logic . It turns out that over the class of models possessing or , all of these logics are equally expressive, whereas over the class of models possessing either of other eight neighborhood properties, is more expressive than both and , and over the class of models possessing either of eight neighborhood properties except for , is less expressive than . We explored the frame definability of the bimodal logic, which turns out that all ten frame properties except for are undefinable in . We axiomatized the bimodal logic over various classes of neighborhood frames, which among other results includes the classical logic, the monotone logic, and the regular logic. Last but not least, by updating the neighborhood models via the intersection semantics, we found suitable reduction axioms and thus reduced the public announcement operators to the bimodal logic. This gives us good applications to successful formulas, since as we have shown, any combination of , , and via conjunction (or, via disjunction) is successful under the intersection semantics. We also partly answers open questions raised in [9, 11].
For future work, we hope to know whether is less expressive than over the class of -models. We conjecture the answer is positive, but the model constructions seems hard, where the desired models both needs at least three points. Moreover, as we have seen, the proofs of the expressivity and frame definability results involve nontrivial (if not highly nontrivial) constructions of neighborhood models and frames, we thus also hope to find the bisimulation notion for under the neighborhood semantics.
References
- [1] R. Bett. Socratic ignorance. In Donald R. Morrison, editor, The Cambridge Companion to Socrates, pages 215–236. Cambridge University Press, 2011.
- [2] J. C. Bjerring, J. U. Hansen, and N. J. L. L. Pedersen. On the rationality of pluralistic ignorance. Synthese, 191(11):2445–2470, 2014.
- [3] S. Bonzio, V. Fano, P. Graziani, and M. Pra Baldi. A logical modeling of severe ignorance. Journal of Philosophical Logic, 52:1053–1080, 2023.
- [4] B. F. Chellas. Modal Logic: An Introduction. Cambridge University Press, 1980.
- [5] J. Fan. Removing your ignorance by announcing group ignorance: A group announcement logic for ignorance. Studies in Logic, 9(4):4–33, 2016.
- [6] J. Fan. Neighborhood contingency logic: A new perspective. Studies in Logic, 11(4):37–55, 2018.
- [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. Bimodal logic with contingency and accident: Bisimulation and axiomatizations. Logica Universalis, 2021. https://doi.org/10.1007/s11787-021-00270-9.
- [10] J. Fan. A logic for disjunctive ignorance. Journal of Philosophical Logic, 2021. https://doi.org/10.1007/s10992-021-09599-4.
- [11] J. Fan. Unknown truths and false beliefs: Completeness and expressivity results for the neighborhood semantics. Studia Logica, 110:1–45, 2022. https://doi.org/10.1007/s11225-021-09950-5.
- [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] J. Fan, Y. Wang, and H. van Ditmarsch. Almost necessary. In Advances in Modal Logic, volume 10, pages 178–196, 2014.
- [14] J. Fan, Y. Wang, and H. van Ditmarsch. Contingency and knowing whether. The Review of Symbolic Logic, 8(1):75–107, 2015.
- [15] K. Fine. Ignorance of ignorance. Synthese, 195:4031–4045, 2018. https://doi.org/10.1007/s11229-017-1406-z.
- [16] V. Goranko. On relative ignorance. Filosofiska Notiser, 8(1):119–140, 2021.
- [17] J. Hintikka. Knowledge and Belief. Cornell University Press, Ithaca, NY, 1962.
- [18] K. Konolige. Circumscriptive ignorance. In AAAI, pages 202–204, 1982.
- [19] E. Kubyshkina and M. Petrolo. A logic for factive ignorance. Synthese, pages 1–12, 2019.
- [20] P. Le Morvan and R. Peels. The nature of ignorance: Two views. In R. Peels and M. Blaauw, editors, The epistemic dimensions of ignorance. Cambridge: Cambridge University Press, 2016.
- [21] M. Ma and K. Sano. How to update neighborhood models. In International Workshop on Logic, Rationality and Interaction, pages 204–217. Springer, 2013.
- [22] M. Ma and K. Sano. How to update neighbourhood models. Journal of Logic and Computation, 28(8):1781–1804, December 2018. https://doi.org/10.1093/logcom/exv026.
- [23] J. Marcos. Logics of essence and accident. Bulletin of the Section of Logic, 34(1):43–56, 2005.
- [24] R. Montague. Universal grammar. Theoria, 36:373–398, 1970.
- [25] P. Le Morvan. On ignorance: A reply to Peels. Philosophia, 39(2):335–344, 2011.
- [26] Hubert J O’Gorman and Stephen L Garry. Pluralistic ignorance — a replication and extension. Public Opinion Quarterly, 40(4):449–458, 1976.
- [27] E. J. Olsson and C. Proietti. Explicating ignorance and doubt: A possible worlds approach. The Epistemic Dimensions of Ignorance, 2015.
- [28] E. Pacuit. Neighborhood semantics for modal logic. Springer, 2017.
- [29] R. Peels. Ignorance is Lack of True Belief: A Rejoinder to Le Morvan. Philosophia, 39(2):344–355, 2011.
- [30] C. Proietti and E. J. Olsson. A ddl approach to pluralistic ignorance and collective belief. Journal of Philosophical Logic, 43(2):499–515, 2014.
- [31] D. Scott. Advice on modal logic. Philosophical Problems in Logic: Some Recent Developments, pages 143–173, 1970.
- [32] Y. Shoham. Chronological ignorance. In Proceedings of the Fifth National Conference on Artificial Intelligence, pages 389–393, 1986.
- [33] C. Steinsvold. A note on logics of ignorance and borders. Notre Dame Journal of Formal Logic, 49(4):385–392, 2008.
- [34] W. van der Hoek and A. Lomuscio. Ignore at your peril - towards a logic for ignorance. In Proc. of 2nd AAMAS, pages 1148–1149. ACM, 2003.
- [35] W. van der Hoek and A. Lomuscio. A logic for ignorance. Electronic Notes in Theoretical Computer Science, 85(2):117–133, 2004.
- [36] H. van Ditmarsch, W. van der Hoek, and B. Kooi. Dynamic Epistemic Logic, volume 337 of Synthese Library. Springer, 2007.
- [37] J. Zvesper. Playing with information. PhD thesis, Institute for Logic, Language and Computation, University of Amsterdam, 2010.