Support and Sets of Situations
 805 Downloads
 1 Citations
Abstract
An alternative conceptual setting of the basic system of inquisitive semantics is presented. A situational interpretation of the proposed formalism is discussed.
Keywords
Inquisitive semantics Situational semantics Truth1 Introduction
Inquisitive semantics is a research program which has originated from an analysis of questions, but currently is evolving towards a general theory of meaning.^{1} In this short paper we propose an alternative conceptual setting of the basic propositional system of inquisitive semantics, labelled \(\mathsf {InqB}\). Inquisitive entailment is retained in the setting, but the concept of model used is more general.
Then we sketch a nonstandard, “situational” interpretation of \(\mathsf {InqB}\).
2 \(\mathsf {InqB}\): The Canonical Account
\(\mathsf {InqB}\) provides a new semantic framework for propositional languages.
Let \(\mathcal {L}_{\mathcal {P}}\) be a propositional language built over a nonempty set of propositional variables \(\mathcal {P}\), where \(\mathcal {P}\) is either finite or countably infinite. The primitive logical constants of the language are: \(\bot , \vee , \wedge , \rightarrow \). Wellformed formulas (wffs) of \(\mathcal {L}_{\mathcal {P}}\) are defined as usual.
On the canonical account of \(\mathsf {InqB}\), \(\mathcal {L}_{\mathcal {P}}\) is supposed to be associated with the set of suitable possible worlds, \(\mathcal {W}_{\mathcal {P}}\), being the model of \(\mathcal {L}_{\mathcal {P}}\). A possible world, in turn, is conceived either as a subset of \(\mathcal {P}\) or as a binary valuation of \(\mathcal {P}\). Regardless of which of these solutions is adopted, \(\mathcal {W}_{\mathcal {P}}\) is uniquely determined. When possible worlds are conceptualized as sets of propositional variables, \(\mathcal {W}_{\mathcal {P}}= \wp (\mathcal {P})\), i.e. the power set of \(\mathcal {P}\). If, however, possible worlds are identified with indices, that is, binary valuations of \(\mathcal {P}\), then \(\mathcal {W}_{\mathcal {P}}\) is the set of all indices.
The intended area of applicability of \(\mathsf {InqB}\) is the information exchange between individuals. It is assumed that the expressions used are interpreted uniformly by the parties involved. This is the main reason for which a language of the considered kind is associated with exactly one model.
2.1 States, Support and Meaning
\(\mathsf {InqB}\) defines the basic semantic categories in terms of support, being a relation between a wff and a set of possible worlds. Sets of possible worlds are called states. They are intuitively interpreted as representing information states. Singleton sets/states correspond to information states of maximal consistent information, while \(\mathcal {W}_{\mathcal {P}}\) corresponds to the ignorant state, i.e. an information state in which no possible world is excluded. \(\emptyset \) represents the absurd state. Formally, a state is a subset of \(\mathcal {W}_{\mathcal {P}}\).
Notation The letters \(A, B, C,D\) are metalanguage variables for wffs of \(\mathcal {L}_{\mathcal {P}}\), and the letters \(X, Y\) are metalanguage variables for sets of wffs of the language. \(\mathtt {p}\) is used below as a metalanguage variable for propositional variables. The letters \(\sigma , \tau \), \(\gamma \), with or without subscripts, will refer to states.
 1.
\(\sigma \succ \mathtt {p}\) iff \(w(\mathtt {p}) = \mathbf {1}\) for any \(w \in \sigma \),
 2.
\(\sigma \succ \bot \) iff \(\sigma = \emptyset \),
 3.
\(\sigma \succ (A \wedge B)\) iff \(\sigma \succ A\) and \(\sigma \succ B\),
 4.
\(\sigma \succ (A \vee B)\) iff \(\sigma \succ A\) or \(\sigma \succ B\),
 5.
\(\sigma \succ (A \rightarrow B)\) iff for each \(\tau \subseteq \sigma \): if \(\tau \succ A\) then \(\tau \succ B\).
The account of meaning offered by inquisitive semantics is twofold. The semantics assigns to a wff its informative content and its inquisitive content. Both concepts are defined in terms of support.
In the general setting of inquisitive semantics the informative content of a wff is defined as the union of all states that support the wff. In the case of \(\mathsf {InqB}\), however, the informative content of a wff \(A\) amounts to the truth set of \(A\), that is, the set of all the worlds from \(\mathcal {W}_{\mathcal {P}}\) in which \(A\) is (classically) true. The inquisitive content of \(A\), in turn, is the family of all the states that support \(A\). A wff \(A\) is inquisitive iff the informative content of \(A\) does not support the wff \(A\). In the case of \(\mathsf {InqB}\) this amounts to the following claim: the informative content of \(A\) does not belong to the inquisitive content of \(A\). The intuition which lies behind the concept of inquisitiveness is: something more than the information the wff provides is needed to settle the issue it raises. Wffs which are not inquisitive are called assertions. As for assertions, their informative contents settle the issues they raise.
\(\mathsf {InqB}\) (and inquisitive semantics in general) enables a differentiation between classical tautologies: some of them are inquisitive, while some others are not. Being a question is a semantic property of a wff: \(A\) is a question iff the truth set of \(A\) equals \(\mathcal {W}_{\mathcal {P}}\). Each question is a classical tautology, but some questions are inquisitive.
2.2 Remarks on Models
As we have mentioned above, on the canonical account the set of propositional variables \(\mathcal {P}\) of \(\mathcal {L}_{\mathcal {P}}\) uniquely determines the set of possible worlds \(\mathcal {W}_{\mathcal {P}}\) associated with the language; this set constitutes the model of \(\mathcal {L}_{\mathcal {P}}\). A moment’s reflection reveals that when \(\mathcal {P}\) is countably infinite, \(\mathcal {W}_{\mathcal {P}}\) is uncountably infinite.^{2} Finite models exist only for languages over finite sets of propositional variables, and countably infinite models do not exist at all. Yet, \(\mathsf {InqB}\) simulates information exchange in terms of elimination of worlds from an (initial) information state. As \(\mathcal {W}_{\mathcal {P}}\) represents the ignorant information state, it follows that, in the case of languages over countably infinite sets of propositional variables, arriving at states of maximal consistent information (which are singleton sets) requires an elimination of uncountably many possible worlds. On the other hand, as long as we stay within the realm of Classical Recursion Theory, there is no recursive function whose domain is an uncountably infinite set. Thus when we deal with a language over infinite set of propositional variables/atoms, there is no algorithmic procedure which leads from the ignorant information state to a state of maximal consistent information. This is a strong philosophical claim stemming from conceptual decisions only.
3 \(\mathsf {InqB}\): An Alternative Account
In this section we propose an alternative conceptual setting of \(\mathsf {InqB}\) within which inquisitive entailment is retained, but the concept of model is generalized.
Definition 1
The set \(W\) will be called the domain of the corresponding \(\iota \)model. \(W\) can be thought of as a set of possible worlds. However, Definition 1 is neutral w.r.t. the controversy what possible worlds are. The only condition imposed on \(W\) is nonemptiness. Thus the cardinality of \(\iota \)models is not determined by the cardinality of \(\mathcal {P}\). Needless to say, there exist \(\iota \)models of any cardinality, and many \(\iota \)models of a given cardinality. Moreover, it is not excluded that \(W\) contains possible worlds which are indistinguishable with respect to the valuation function \(V\).
Remark
We use the term “\(\iota \)model” for clarity only. Structures of the form (1) are often employed in semantics. For example, they are used as models of (propositional) S5.
Let \(\mathcal {M}=\langle W, V \rangle \) be an \(\iota \)model. By a \(\mathcal {M}\)state we mean a subset of \(W\). An expression of the form “\(\sigma \succ _{\mathcal {M}} A\)” reads “\(\mathcal {M}\)state \(\sigma \) supports wff \(A\)”. The support relation \(\succ _{\mathcal {M}}\) is defined by:
Definition 2
 1.
\(\sigma \succ _{\mathcal {M}} \mathtt p \) iff \(V(\mathtt p , w) = \mathbf {1}\) for each \(w \in \sigma \),
 2.
\(\sigma \succ _{\mathcal {M}} \bot \) iff \(\sigma = \emptyset \),
 3.
\(\sigma \succ _{\mathcal {M}} (A \wedge B)\) iff \(\sigma \succ _{\mathcal {M}} A\) and \(\sigma \succ _{\mathcal {M}} B\),
 4.
\(\sigma \succ _{\mathcal {M}} (A \vee B)\) iff \(\sigma \succ _{\mathcal {M}} A\) or \(\sigma \succ _{\mathcal {M}} B\),
 5.
\(\sigma \succ _{\mathcal {M}} (A \rightarrow B)\) iff for each \(\tau \subseteq \sigma \): if \(\tau \succ _{\mathcal {M}} A\) then \(\tau \succ _{\mathcal {M}} B\).
 (neg)

\(\sigma \succ _{\mathcal {M}} \lnot A\) iff for each \(\tau \subseteq \sigma \) such that \(\tau \ne \emptyset : \tau \not \succ _{\mathcal {M}} A\).
Remark
The concept of support is defined similarly as in the standard setting (see page 2); we have only added a relativization to \(\mathcal {M}\).
Note that support by a \(\mathcal {M}\)state does not amount to truth in each world of the state: the clauses for disjunction and implication (as well as for negation) are more demanding. The following holds:
Corollary 1
(Persistence) If \(\sigma \succ _{\mathcal {M}} A\), then \(\tau \succ _{\mathcal {M}} A\) for any \(\tau \subseteq \sigma \).
As a consequence we get:
Corollary 2
If \(\sigma \succ _{\mathcal {M}} A\), then \(\{w\} \succ _{\mathcal {M}} A\) for each \(w \in \sigma \).
The converse of Corollary 2 does not hold.
Since we operate with \(\iota \)models, the respective semantic concepts of \(\mathsf {InqB}\) become relativized to models. For clarity, we begin with:
Definition 3
(Truth in a world of an \(\iota \)model) \(\mathcal {M}, w \models A\) iff \(\{w\} \succ _{\mathcal {M}} A\).
Definition 4
(Truth set in an \(\iota \)model) \(\vert A\vert _{\mathcal {M}}=\{w \in W: \mathcal {M}, w \models A\}\).
Definition 5
One can prove:
Corollary 3
\(\Vert A \Vert _{\mathcal {M}}=\{\sigma \subseteq \vert A \vert _{\mathcal {M}} : \sigma \succ _{\mathcal {M}} A\}\).
Corollary 4
\(\emptyset \in \Vert A \Vert _{\mathcal {M}}\) for any wff A and any \(\iota \)model \(\mathcal {M}\).
For brevity, we introduce:
Definition 6
\(\sigma \succ _{\mathcal {M}} X\) iff \(\sigma \succ _{\mathcal {M}} B\) for each \(B \in X\).
3.1 Inquisitive Entailment
Definition 7
(Inquisitive entailment) \(X \models _{\mathsf {InqB}} A\quad \hbox {iff}\bigcap \limits _{B \in X}\Vert B\Vert \subseteq \Vert A \Vert \).
Let us now prove that inquisitive entailment can be characterized in terms of \(\iota \)models.
Theorem 1
\(X \models _{\mathsf {InqB}} A\) iff for each \(\iota \)model \(\mathcal {M} = \langle W, V \rangle \) and each \(\mathcal {M}\)state \(\sigma \): if \(\sigma \succ _{\mathcal {M}} X\), then \(\sigma \succ _{\mathcal {M}} A\).
Proof
It suffices to prove that a state of an \(\iota \)model supports (in the model) all the wffs in \(X\) but does not support \(A\) if, and only if there exists a subset of \(\mathcal {W}_{\mathcal {P}} \) which supports \(X\) and does not support \(A\)—regardless of whether \( \mathcal {W}_{\mathcal {P}}\) comprises indices or sets of propositional variables.
 (a)
\(f[\sigma ]=\emptyset \) iff \(\sigma =\emptyset \),
 (b)
if \(w \in \sigma \), then \(v_w \in f[\sigma ]\),
 (c)
if \(\tau \subseteq \sigma \), then \(f[\tau ] \subseteq f[\sigma ]\).
Suppose that \(\sigma \not \succ _{\mathcal {M}} (C \rightarrow D)\). Thus there exists a \(\mathcal {M}\)state \(\tau \subseteq \sigma \) such that \(\tau \succ _{\mathcal {M}} C\) and \(\tau \not \succ _{\mathcal {M}} D\). Clearly, \(f[\tau ] \subseteq f[\sigma ]\). Thus, by the induction hypothesis, \(f[\sigma ] \not \succ _{\mathcal {M}^{*}} (C \rightarrow D)\).
The cases of disjunction and conjunction are straightforward.
(\(\Leftarrow \)) Suppose that \(X \not \models _{\mathsf {InqB}} A\). Thus \(\bigcap \nolimits _{B \in X} \Vert B \Vert \not \subseteq \Vert A \Vert \). Hence there exists a subset \(\sigma \) of \(\mathcal {W}_{\mathcal {P}}\) such that \(\sigma \succ X\) and \(\sigma \not \succ A\).
As a consequence of Theorem 1 we get:
Corollary 5
\(\models _{\mathsf {InqB}} A \) iff for each \(\iota \)model \(\mathcal {M}\) and each \(\mathcal {M}\)state \(\sigma \): \(\sigma \succ _{\mathcal {M}} A\).
Thus the conceptual setting proposed in this section is adequate for \(\mathsf {InqB}\): it retains inquisitive entailment and the propositional logic determined by \(\mathsf {InqB}\) is complete w.r.t. the \(\iota \)models semantics.
Remark
As for the standard setting of \(\mathsf {InqB}\), a language of the considered kind is associated with exactly one model, the canonical model (see Section 2 for details). When \(\mathcal {L}_{\mathcal {P}}\) is a language built over a set of propositional variables \(\mathcal {P}\), the model of the language is just \(\mathcal {W}_{\mathcal {P}}\). The proof of Theorem 1 shows that \(\mathcal {W}_{\mathcal {P}}\) corresponds to an \(\iota \)model, \(\mathcal {M}_{\mathcal {P}}\), whose domain is \(\mathcal {W}_{\mathcal {P}}\), and for which we have \(\succ = \,\succ _{\mathcal {M}_{\mathcal {P}}}\), that is, support in the canonical model \(\mathcal {W}_{\mathcal {P}}\) settheoretically equals support in \(\mathcal {M}_{\mathcal {P}}\).^{3} Hence the basic concepts of \(\mathsf {InqB}\), in particular inquisitiveness and informativeness, usually defined in terms of the canonical model, are definable in terms of \(\iota \)models. Note that the domain of \(\mathcal {M}_{\mathcal {P}}\) can be thought of as representing the ignorant information state.
4 A Situational Account of \(\mathsf {InqB}\)
The elements of domains of \(\iota \)models have been so far intuitively construed as possible worlds. The only formal restriction imposed on domains of \(\iota \)models was nonemptiness. Support is a relation between wffs and sets of elements of domains, that is, intuitively, sets of possible worlds. In this section we are going to define the concept of truth of a wff in a possible world in terms of support. Clearly, this requires a new way of thinking about \(\iota \)models and a nonstandard account of possible worlds.
4.1 Intuitions
The domain of an \(\iota \)model is a nonempty set. It is not excluded that the domain contains elements which are indistinguishable w.r.t. the valuation function, \(V\), of the model: it may happen that for some distinct elements, \(w\) and \(w^{\prime }\), of the domain, we have \(V(\mathtt {p}, w)=V(\mathtt {p}, w^{\prime })\) for each propositional variable \(\mathtt {p}\) of the language in question. Now think of elements of the domain of an \(\iota \)model as situations, and of the valuation function \(V\) as follows: “\(V(\mathtt p , w)=\mathbf {1}\)” means “\(\mathtt p \) holds in situation \(w\)”, while the meaning of “\(V(\mathtt p , w)=\mathbf {0}\)” is: “it is not the case that p holds in situation \(w\)”.^{4} We do not attempt to define situations in general. As Devlin (1991, p. 70) puts it, “Situations are just that: situations”. Yet, we tend to think that situations are, at least partially, determined by subjective factors. An agent categorizes the world according to his/her conceptual apparatus, and conceptualizes some phenomena as situations. But which phenomena are conceived as situations and which are not depends on an agent’s decisions, though rarely conscious ones. Our only assumption concerning the realm of situations is: there may exist different situations which, nevertheless, agree on the level of “atomic facts”. Thus situations are not supposed to be determined by the ”atomic facts” that hold in them (by the logical values of propositional variables). This assumption reflects the underlying idea that situations are predominantly epistemic constructs and, as such, are dependant upon an agent’s propositional attitudes and conceptual framework. However, if you are inclined to think of situations in purely ontic terms, the above assumption makes room for an indeterministic perspective.
At a given moment only some situations constitute the “point of reference” of an agent’s cognitive or epistemic activities. The set of such situations can be labelled as “the (epistemic) world of situations the agent lives in (at a given moment)” and identified with a possible world. To be more precise, we construe the domain, \(W\), of an \(\iota \)model \(\langle W, V \rangle \) as a single possible world, \(\widehat{W}\), comprising all the situations from \(W\).^{5} In order to keep things simple \(\mathcal {M}\)states different from \(W\) (i.e. proper subsets of the domain) are not regarded as possible worlds.^{6}
4.2 Truth
What about truth? Let us introduce a certain auxiliary concept.
Definition 8
(Truth in an \(\iota \)model) A wff \(A\) is true in an \(\iota \)model \(\mathcal {M}\) (in symbols: \(\mathcal {M} \models A\)) iff \(\sigma \succ _{\mathcal {M}} A\) for each \(\mathcal {M}\)state \(\sigma \).
Note that the concept of truth in an \(\iota \)model is defined in terms of support. Since Corollary 1 holds, one can easily prove:
Corollary 6
Thus a wff is true in an \(\iota \)model just in case it is supported by the domain of the model. But recall that the (classical) truth of \(A\) in each \(w \in W\) does not warrant that \(W\) supports \(A\): the concept of support is stronger.
The domain, \(W\), of an \(\iota \)model \(\mathcal {M}=\langle W, V\rangle \) corresponds to a single possible world, \(\widehat{W}\) (construed in the sense described above). Let us now assume that truth in \(\widehat{W}\) equals truth in \(\mathcal {M} = \langle W, V\rangle \). We get the following characteristics of the resultant concept of truth:^{7}
Corollary 7
 1.
\(\widehat{W} \models \mathtt {p}\) iff \(\Vert \mathtt {p} \Vert _{\mathcal {M}}=\wp (W)\),
 2.
\(\widehat{W} \models (A \rightarrow B)\) iff \(\Vert A \Vert _{\mathcal {M}} \subseteq \Vert B \Vert _{\mathcal {M}}\),
 3.
\(\widehat{W} \models (A \vee B)\) iff \(\Vert A \Vert _{\mathcal {M}}=\wp (W)\) or \(\Vert B \Vert _{\mathcal {M}}=\wp (W)\),
 4.
\(\widehat{W} \models (A \wedge B)\) iff \(\Vert A \Vert _{\mathcal {M}}=\wp (W)\) and \(\Vert B \Vert _{\mathcal {M}}=\wp (W)\),
 5.
\(\widehat{W} \models \lnot A\) iff \(\Vert A \Vert _{\mathcal {M}}=\{\emptyset \}\).
Clause (1) yields that an atomic sentence/propositional variable p is true in \(\widehat{W}\) iff p holds in each situation being an element of \(W\). (2) states that an implication is true in \(\widehat{W}\) just in case each set of situations included in \(W\) that supports the antecedent also supports the consequent. (3), in turn, says that a disjunction is true in \(\widehat{W}\) iff each set of situations included in \(W\) supports a disjunct, while (4) states that a conjunction is true just in case each set of situations included in \(W\) supports both conjuncts. According to (5), a negation is true in \(\widehat{W}\) iff the empty set is the only set included in \(W\) that supports the negated wff.
Needless to say, it can happen that a wff (even an atom/propositional variable!) is not true in \(\widehat{W}\) and its negation is also not true in \(\widehat{W}\).
So far so good. But the key assumption has been: support is defined as in \(\mathsf {InqB}\). Let us now test the consequences of this assumption against some naturallanguage examples.
It seems that the results of the above considerations comply with intuitions.
4.3 Inquisitive Entailment Again
Inquisitive entailment viewed from the canonical point of view warrants the transmission of support. It can be proven, however, that inquisitive entailment also warrants transmission of truth understood in the abovesketched manner.
Theorem 2
\(X \models _{\mathsf {InqB}} A\) iff \(A\) is true in each \(\iota \)model in which all the wffs in \(X\) are true.
Proof
For conciseness, let “\(\mathcal {M} \models X\)” abbreviate “\(\mathcal {M} \models B\) for each \(B \in X\)”.
(\(\Rightarrow \)) By Theorem 1 and Corollary 6.
5 Concluding Remarks
Inquisitive semantics in general, and \(\mathsf {InqB}\) in particular have been designed as tools of modelling information exchange. This explains some peculiarities of the canonical account of \(\mathsf {InqB}\). A language in question has only one model since the “meanings” of the expressions used are supposed to be uniform. An information state of maximal consistent information is assumed to be reachable by linguistic means, and since states of this kind are modelled as singleton sets of worlds, one has to construe possible worlds in a way that excludes the existence of different worlds which agree on the values of propositional variables. Conceiving possible worlds as indices or sets of propositional variables secures this.
As for the \(\iota \)models semantics for \(\mathsf {InqB}\) proposed in this paper, a language in question has many models, and elements of domains need not be distinguishable in terms of valuations. It is an open problem whether, and if so, how the alternative conceptual setting can be profitably used in the modelling of information exchange. Yet, as we have shown, the \(\iota \)models approach is more general but still retains \(\mathsf {InqB}\)entailment, and, on the other hand, facilitates the use of the formalism outside the realm of its intended applicability.
Footnotes
 1.
For inquisitive semantics see, e.g., Groenendijk and Roelofsen (2009), Ciardelli and Roelofsen (2011), Groenendijk (2011), Ciardelli et al. (2013), Wisniewski and LeszczynskaJasion (in print). For recent developments see: http://sites.google.com/site/inquisitivesemantics/.
 2.
The reasons are simple. First, there exist uncountably many subsets of a countably infinite set. Second, there exists a 1–1 correspondence between indices defined over countably infinite set \(\mathcal {P}\) and countably infinite sequences of logical values, \(\mathbf {1}\) and \(\mathbf {0}\), and there exist uncountably many such sequences.
 3.
When \(\mathcal {W}_{\mathcal {P}}\) comprises indices, the valuation function, \(V\), of \(\mathcal {M}_{\mathcal {P}}\) is defined by: \(V(\mathtt {p}, v)=\mathbf {1}\) iff \(v(\mathtt {p})=\mathbf {1}\). If \(\mathcal {W}_{\mathcal {P}}=\wp ({\mathcal {P}})\), we put \(V(\mathtt {p}, v) = \mathbf {1}\) iff \(\mathtt {p} \in v\).
 4.
Observe that \(V(\mathtt p , w)=\mathbf {0}\) does not yield “\(\lnot \mathtt {p}\) holds in \(w\)’, as \(V\) is defined only for atoms/propositional variables.
 5.
Possible worlds in our sense are thus not situations, but sets of situations. Assuming that we are speaking about wellfounded sets, no possible world is a situation. In order to avoid this consequence one can turn to a set theory that allows for non wellfounded sets (e.g. Aczel’s theory). In this setting \(\widehat{W}\) would be the non wellfounded set which, besides the elements of \(W\), has also \(W\) as a member. It would make no harm to stipulate that \(V(\mathtt {p}, W)=\mathbf {1}\) iff \(V(\mathtt {p}, w)=\mathbf {1}\) for any \(w \in W\) such that \(w \ne W\).
A different version of an uncommitted “situational” semantics in which an assignment of a set of situations to a wff plays the basic role can be found in Wiśniewski (1997); see Wiśniewski (2013), pp. 33–45 for an English translation.
 6.
Of course, each nonempty \(\mathcal {M}\)state different from \(W\) can serve as the domain of another \(\iota \)model and thus determine another world. Our construction is not ontologically loaded.
 7.
Recall that \(\Vert A \Vert _{\mathcal {M}}\) is the set of all \(\mathcal {M}\)states that support \(A\).
 8.
Recall that “\(A\) is not true in \(\widehat{W}\)” means “there is a subset of \(W\) that does not support \(A\)”, and this is not tantamount to “\(\lnot A\) is true in \(\widehat{W}\)”.
 9.
For, suppose that \(\sigma \succ _{\mathcal {M}} (A \rightarrow (B \rightarrow C))\), but \(\sigma \not \succ _{\mathcal {M}} (A \wedge B \rightarrow C)\). Hence for some \(\tau \subseteq \sigma \) : \(\tau \succ _{\mathcal {M}} A\), \(\tau \succ _{\mathcal {M}} B\) and \(\tau \not \succ _{\mathcal {M}} C\). Thus \(\tau \succ _{\mathcal {M}} A\) and \(\tau \not \succ _{\mathcal {M}} (B \rightarrow C)\), that is, \(\sigma \not \succ _{\mathcal {M}} (A \rightarrow (B \rightarrow C))\).
Now suppose that \(\sigma \not \succ _{\mathcal {M}} (A \rightarrow (B \rightarrow C))\). It follows that for some \(\tau \subseteq \sigma \): \(\tau \succ _{\mathcal {M}} A\) and \(\tau \not \succ _{\mathcal {M}} (B \rightarrow C)\). Hence for some \(\tau ^{\prime } \subseteq \tau \): \(\tau ^{\prime } \succ _{\mathcal {M}} B\) and \(\tau ^{\prime } \not \succ _{\mathcal {M}} C\). Therefore \(\tau ^{\prime } \succ _{\mathcal {M}} (A \wedge B)\) and thus \(\sigma \not \succ _{\mathcal {M}} (A \wedge B \rightarrow C)\).
 10.
Let \(\sigma \succ _{\mathcal {M}} ((A \rightarrow B) \rightarrow \mathtt {p})\), but \(\sigma \not \succ _{\mathcal {M}} (\lnot A \rightarrow \mathtt {p}) \wedge (B \rightarrow \mathtt {p})\). Thus: (a) \(\sigma \not \succ _{\mathcal {M}} (\lnot A \rightarrow \mathtt {p})\) or (b) \(\sigma \not \succ _{\mathcal {M}} (B \rightarrow \mathtt {p})\). If (a) holds, then there exists \(\tau \subseteq \sigma \) such that \(\tau \succ _{\mathcal {M}} \lnot A\) and \(\tau \not \succ _{\mathcal {M}} \mathtt {p}\). Hence \(\mathcal {M}, w \not \models \mathtt {p}\) for some \(w \in \tau \), and, simultaneously, \(\mathcal {M}, w \models \lnot A\). Therefore \(\mathcal {M}, w \not \models ((A \rightarrow B) \rightarrow \mathtt {p})\) and hence \(\sigma \not \succ _{\mathcal {M}} ((A \rightarrow B) \rightarrow \mathtt {p})\). As for (b), we reason analogously.
Let \(\sigma \succ _{\mathcal {M}} (\lnot A \rightarrow \mathtt {p}) \wedge (B \rightarrow \mathtt {p})\), but \(\sigma \not \succ _{\mathcal {M}} ((A \rightarrow B) \rightarrow \mathtt {p})\). Hence for some \(\tau \subseteq \sigma \) we have: \(\tau \succ _{\mathcal {M}} (A \rightarrow B)\) and \(\tau \not \succ _{\mathcal {M}} \mathtt {p}\). Thus \(\mathcal {M}, w \not \models \mathtt {p}\) for some \(w \in \tau \). Therefore, by the initial assumption and Corollary 1 we get: \(\mathcal {M}, w \models A\) as well as \(\mathcal {M}, w \models \lnot B\). On the other hand, if \(\tau \succ _{\mathcal {M}} (A \rightarrow B)\) and \(w \in \tau \), then \(\mathcal {M}, w \models (A \rightarrow B)\). A contradiction.
References
 Ciardelli, I., & Roelofsen, F. (2011). Inquisitive logic. Journal of Philosophical Logic, 40, 55–94.CrossRefGoogle Scholar
 Ciardelli, I., Groenendijk, J., & Roelofsen, F. (2013). Towards a logic of information exchange. An inquisitive witness semantics. In N. Bezhanishvili et al. (Eds.). Logic, Language, and Computation. TbiLLC 2011, Kutaisi, Georgia, September 26–30, 2011, Revised selected papers (pp. 51–72). Berlin,Heidelberg: Springer.Google Scholar
 Ciardelli, I., Groenendijk, J., & Roelofsen, F. (2013). On the semantics and logic of declaratives and interrogatives. Synthese,. doi: 10.1007/s1122901303527.Google Scholar
 Devlin, K. (1991). Logic and Information. Cambridge: Cambridge University Press.Google Scholar
 Groenendijk, J. (2011). Erotetic languages and the inquisitive hierarchy. In: J. van der Does, C. Dutilh Novaes (Eds.) This is not a Festschift  Festschrift for Martin Stokhof http://www.vddoes.net/Martin/articles/Jeroen.pdf. Accessed 30 June 2013.
 Groenendijk, J., & Roelofsen, F. (2009). Inquisitive semantics and pragmatics. In J. M. Larrazabal & L. Zubeldia (Eds.), Meaning, Content and Argument, Proceedings of the ILCLI International Workshop on Semantics, Pragmatics and Rhetoric (pp. 41–72). San Sebastian: University of the Basque Country Publication Service.Google Scholar
 Roelofsen, F. (2013). Algebraic foundations for the semantic treatment of inquisitive content. Synthese,. doi: 10.1007/s1122901302824.Google Scholar
 Wiśniewski, A. (1997). Logika a zbiory sytuacji (Logic and sets of situations). In R. Kubicki & P. Zeidler (Eds.), Od logiki do estetyki (pp. 13–25). Wydawnictwo Fundacji Humaniora: Poznań.Google Scholar
 Wiśniewski, A. (2013). Essays in Logical Philosophy. BerlinMünsterWienZürichLondon: LIT Verlag.Google Scholar
 Wiśniewski, A., LeszczyńskaJasion, D. in print. Inferential erotetic logic meets inquisitive semantics. Synthese. doi: 10.1007/s1122901303554
Copyright information
Open AccessThis article is distributed under the terms of the Creative Commons Attribution License which permits any use, distribution, and reproduction in any medium, provided the original author(s) and the source are credited.