Inquisitive semantics is a framework in logic and natural language semantics. In inquisitive semantics, the semantic content of a sentence captures both the information that the sentence conveys and the issue that it raises. The framework provides a foundation for the linguistic analysis of statements and questions. It was originally developed by Ivano Ciardelli, Jeroen Groenendijk, Salvador Mascarenhas, and Floris Roelofsen.
Basic notions The essential notion in inquisitive semantics is that of an inquisitive proposition.
An information state (alternately a classical proposition) is a set of possible worlds. An inquisitive proposition is a nonempty downward-closed set of information states. Inquisitive propositions encode informational content via the region of logical space that their information states cover. For instance, the inquisitive proposition { { w } , ∅ } {\displaystyle \{\{w\},\emptyset \}} encodes the information that {w} is the actual world. The inquisitive proposition { { w } , { v } , ∅ } {\displaystyle \{\{w\},\{v\},\emptyset \}} encodes that the actual world is either w {\displaystyle w} or v {\displaystyle v} . An inquisitive proposition encodes inquisitive content via its maximal elements, known as alternatives. For instance, the inquisitive proposition { { w } , { v } , ∅ } {\displaystyle \{\{w\},\{v\},\emptyset \}} has two alternatives, namely { w } {\displaystyle \{w\}} and { v } {\displaystyle \{v\}} . Thus, it raises the issue of whether the actual world is w {\displaystyle w} or v {\displaystyle v} while conveying the information that it must be one or the other. The inquisitive proposition { { w , v } , { w } , { v } , ∅ } {\displaystyle \{\{w,v\},\{w\},\{v\},\emptyset \}} encodes the same information but does not raise an issue since it contains only one alternative. The informational content of an inquisitive proposition can be isolated by pooling its constituent information states as shown below.
The informational content of an inquisitive proposition P is info ( P ) = { w ∣ w ∈ t for some t ∈ P } {\displaystyle \operatorname {info} (P)=\{w\mid w\in t{\text{ for some }}t\in P\}} . Inquisitive propositions can be used to provide a semantics for the connectives of propositional logic since they form a Heyting algebra when ordered by the subset relation. For instance, for every proposition P there exists a relative pseudocomplement P ∗ {\displaystyle P^{*}} , which amounts to { s ⊆ W ∣ s ∩ t = ∅ for all t ∈ P } {\displaystyle \{s\subseteq W\mid s\cap t=\emptyset {\text{ for all }}t\in P\}} . Similarly, any two propositions P and Q have a meet and a join, which amount to P ∩ Q {\displaystyle P\cap Q} and P ∪ Q {\displaystyle P\cup Q} respectively. Thus inquisitive propositions can be assigned to formulas of L {\displaystyle {\mathcal {L}}} as shown below. Given a model M = ⟨ W , V ⟩ {\displaystyle {\mathfrak {M}}=\langle W,V\rangle } where W is a set of possible worlds and V is a valuation function:
[ [ p ] ] = { s ⊆ W ∣ ∀ w ∈ s , V ( w , p ) = 1 } {\displaystyle [\![p]\!]=\{s\subseteq W\mid \forall w\in s,V(w,p)=1\}}
[ [ ¬ φ ] ] = { s ⊆ W ∣ s ∩ t = ∅ for all t ∈ [ [ φ ] ] } {\displaystyle [\![\neg \varphi ]\!]=\{s\subseteq W\mid s\cap t=\emptyset {\text{ for all }}t\in [\![\varphi ]\!]\}}
[ [ φ ∧ ψ ] ] = [ [ φ ] ] ∩ [ [ ψ ] ] {\displaystyle [\![\varphi \land \psi ]\!]=[\![\varphi ]\!]\cap [\![\psi ]\!]}
[ [ φ ∨ ψ ] ] = [ [ φ ] ] ∪ [ [ ψ ] ] {\displaystyle [\![\varphi \lor \psi ]\!]=[\![\varphi ]\!]\cup [\![\psi ]\!]}
The operators ! and ? are used as abbreviations in the manner shown below.
! φ ≡ ¬ ¬ φ {\displaystyle !\varphi \equiv \neg \neg \varphi }
… excerpt ends here. Continue reading the full article.
