**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.^{[1]}^{[2]} It was originally developed by Ivano Ciardelli, Jeroen Groenendijk, Salvador Mascarenhas, and Floris Roelofsen.^{[3]}^{[4]}^{[5]}^{[6]}^{[7]}

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 encodes the information that {*w*} is the actual world. The inquisitive proposition encodes that the actual world is either or .

An inquisitive proposition encodes inquisitive content via its maximal elements, known as *alternatives*. For instance, the inquisitive proposition has two alternatives, namely and . Thus, it raises the issue of whether the actual world is or while conveying the information that it must be one or the other. The inquisitive proposition 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 .

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 , which amounts to . Similarly, any two propositions *P* and *Q* have a meet and a join, which amount to and respectively. Thus inquisitive propositions can be assigned to formulas of as shown below.

Given a model where *W* is a set of possible worlds and *V* is a valuation function:

The operators ! and ? are used as abbreviations in the manner shown below.

Conceptually, the !-operator can be thought of as cancelling the issues raised by whatever it applies to while leaving its informational content untouched. For any formula , the inquisitive proposition expresses the same information as , but it may differ in that it raises no nontrivial issues. For example, if is the inquisitive proposition *P* from a few paragraphs ago, then is the inquisitive proposition *Q*.

The ?-operator trivializes the information expressed by whatever it applies to, while converting information states that would establish that its issues are unresolvable into states that resolve it. This is very abstract, so consider another example. Imagine that logical space consists of four possible worlds, *w*_{1}, *w*_{2}, *w*_{3}, and *w*_{4}, and consider a formula such that contains {*w*_{1}}, {*w*_{2}}, and of course . This proposition conveys that the actual world is either *w*_{1} or *w*_{2} and raises the issue of which of those worlds it actually is. Therefore, the issue it raises would not be resolved if we learned that the actual world is in the information state {*w*_{3}, *w*_{4}}. Rather, learning this would show that the issue raised by our toy proposition is unresolvable. As a result, the proposition contains all the states of , along with {*w*_{3}, *w*_{4}} and all of its subsets.