Inquisitive Semantics: Foundations of Information States and Propositions
In the study of logic and linguistics, inquisitive semantics provides a framework for understanding how language conveys not just facts, but also questions and issues. At its core, this system distinguishes between the information a statement provides and the specific questions it raises.
Core Concepts: Information States and Propositions
To understand inquisitive semantics, we must first define the information state (also known as a classical proposition). An information state is defined as a set of possible worlds. These states serve as the building blocks for more complex logical structures.
An inquisitive proposition is a nonempty, downward-closed set of these information states. These propositions are used to encode two distinct types of content: informational content and inquisitive content.
Informational Content
Informational content refers to the region of logical space covered by the information states within a proposition. For example, if an inquisitive proposition consists of the set containing a single world {w} and the empty set ∅, it encodes the fact that {w} is the actual world. If it contains {w}, {v}, and ∅, it encodes that the actual world is either w or v.
The informational content of an inquisitive proposition P, denoted as info(P), is isolated by pooling all its constituent information states: info(P) = {w | w ∈ t for some t ∈ P}.
Inquisitive Content and Alternatives
While informational content tells us what is true, inquisitive content tells us what is being questioned. This is encoded via alternatives, which are the maximal elements of the inquisitive proposition.
Consider the proposition { {w}, {v}, ∅ }. This has two alternatives: {w} and {v}. Consequently, it conveys that the world is either w or v, while simultaneously raising the issue of which one it is. In contrast, the proposition { {w, v}, {w}, {v}, ∅ } conveys the same informational content but raises no issue because it contains only one maximal alternative.
[no illustration]
Logical Framework and Connectives
Inquisitive propositions form a Heyting algebra when ordered by the subset relation. This mathematical structure allows them to provide a semantics for the connectives of propositional logic.
Within a model M = ⟨W, V⟩—where W is the set of possible worlds and V is a valuation function—the logical operators are defined as follows:
- Atomic propositions [ [ p ] ]: The set of states where every world in the state satisfies p.
- Negation [ [ ¬ φ ] ]: The relative pseudocomplement, consisting of states that have no intersection with any state in [ [ φ ] ].
- Conjunction [ [ φ ∧ ψ ] ]: The meet, represented by the intersection of the two propositions (P ∩ Q).
- Disjunction [ [ φ ∨ ψ ] ]: The join, represented by the union of the two propositions (P ∪ Q).
Special Operators: ! and ?
Inquisitive semantics introduces two specific abbreviations to manipulate the nature of the propositions: the !-operator and the ?-operator.
The !-Operator (Bang)
Defined as !φ ≡ ¬¬φ, the !-operator cancels any issues raised by the formula it applies to while leaving the informational content unchanged. It transforms a proposition that raises a question into one that simply states the information as a fact.
The ?-Operator (Question Mark)
Defined as ?φ ≡ φ ∨ ¬φ, the ?-operator trivializes the information expressed but converts states that would render the issue unresolvable into states that resolve it.
For example, if a proposition φ contains {w1}, {w2}, and ∅, it suggests the world is either w1 or w2. If we discover the actual world is in the state {w3, w4}, the original issue is unresolvable. However, the proposition [ [ ? φ ] ] would include {w3, w4} and all its subsets, effectively incorporating the resolution of the issue.
[no illustration]
Key Facts
- Information State: A set of possible worlds.
- Inquisitive Proposition: A nonempty, downward-closed set of information states.
- Alternatives: The maximal elements of an inquisitive proposition that define its inquisitive content.
- Algebraic Structure: Inquisitive propositions form a Heyting algebra.
- !-Operator: Removes issues (questions) while preserving informational content.
- ?-Operator: Trivializes information and handles unresolvable states.
| Component | Definition/Formula | Primary Function |
|---|---|---|
| Information State | Set of possible worlds | Basic unit of logical space |
| Informational Content | info(P) = {w | w ∈ t for some t ∈ P} | Defines what is logically true |
| Inquisitive Content | Maximal elements (Alternatives) | Defines the question/issue raised |
| !-Operator | !φ ≡ ¬¬φ | Cancels issues/questions |
| ?-Operator | ?φ ≡ φ ∨ ¬φ | Trivializes information |
Frequently Asked Questions
What is the difference between informational and inquisitive content?
Informational content describes the set of possible worlds that could be the actual world. Inquisitive content, defined by the alternatives (maximal elements), describes the specific choice or question being raised among those possibilities.
What does it mean for a set of information states to be downward-closed?
In this context, it means that if a certain information state is part of the inquisitive proposition, all of its subsets must also be included in that proposition.
How does the !-operator change a proposition?
The !-operator removes the "question" aspect of a proposition. It keeps the same informational content but ensures that no nontrivial issues are raised, effectively turning a question into a statement.
What is the role of the Heyting algebra in this system?
The Heyting algebra provides the mathematical foundation that allows inquisitive propositions to be used as a semantics for propositional logic, specifically defining how meet, join, and relative pseudocomplements operate.
How does the ?-operator handle unresolvable issues?
The ?-operator expands the proposition to include states that would otherwise make the issue unresolvable, converting them into states that resolve the issue, while simultaneously trivializing the original information.