Where the alternatives for just come from. Roothian alternatives are the standard focus-semantic alternatives; the other sources are what distinguish just from only.
- roothian : AlternativeSource
- granularity : AlternativeSource
- causal : AlternativeSource
- elaboration : AlternativeSource
- normative : AlternativeSource
Instances For
Equations
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- DeoThomas2025.instDecidableEqAlternativeSource x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯
Map each flavor of just to its alternative source.
Equations
- DeoThomas2025.associatedSource Phenomena.Focus.Exclusives.JustFlavor.complementExclusion = DeoThomas2025.AlternativeSource.roothian
- DeoThomas2025.associatedSource Phenomena.Focus.Exclusives.JustFlavor.rankOrder = DeoThomas2025.AlternativeSource.roothian
- DeoThomas2025.associatedSource Phenomena.Focus.Exclusives.JustFlavor.emphatic = DeoThomas2025.AlternativeSource.granularity
- DeoThomas2025.associatedSource Phenomena.Focus.Exclusives.JustFlavor.precisifyingEquality = DeoThomas2025.AlternativeSource.granularity
- DeoThomas2025.associatedSource Phenomena.Focus.Exclusives.JustFlavor.precisifyingProximity = DeoThomas2025.AlternativeSource.granularity
- DeoThomas2025.associatedSource Phenomena.Focus.Exclusives.JustFlavor.minimalSufficiency = DeoThomas2025.AlternativeSource.causal
- DeoThomas2025.associatedSource Phenomena.Focus.Exclusives.JustFlavor.unexplanatory = DeoThomas2025.AlternativeSource.causal
- DeoThomas2025.associatedSource Phenomena.Focus.Exclusives.JustFlavor.unelaboratory = DeoThomas2025.AlternativeSource.elaboration
- DeoThomas2025.associatedSource Phenomena.Focus.Exclusives.JustFlavor.counterexpectational = DeoThomas2025.AlternativeSource.normative
Instances For
A discourse context provides construals of an underspecified question (UQ) together with Quality and Relevance filters.
Construals are Questions (sets of alternative propositions), matching the
paper's definition (30)-(31): questions are sets of propositions that cover
the common ground. This is more faithful than using partitions (QUD),
since the paper explicitly notes that granularity-based construals generally
cannot be ordered by question entailment (fn. 20).
W is the world type.
- construals : List (Core.Question W)
The available construals of UQ_c
- quality : Core.Question W → Bool
Does the speaker have sufficient evidence to answer this question?
- relevance : Core.Question W → Bool
Is this question relevant to the current discourse?
- nonempty : self.construals ≠ []
There must be at least one construal
Instances For
A question is answerable iff it passes both Quality and Relevance (34).
Equations
- DeoThomas2025.answerable ctx q = (ctx.quality q && ctx.relevance q)
Instances For
OPT_c(Q) (@cite{deo-thomas-2025} (35)): the optimal question in a set of construals.
q is the widest answerable construal: it is answerable, it is in the
construal set, and no strictly wider answerable construal exists.
Width is measured by Core.Question.widerThan ((32)), the paper's comparison
of question inquisitivity — explicitly weaker than G&S question entailment
(fn. 20), because granularity-based construals generally cannot be ordered
by entailment strength.
Equations
- DeoThomas2025.isWidestAnswerable ctx q = (q ∈ ctx.construals ∧ DeoThomas2025.answerable ctx q = true ∧ ∀ q' ∈ ctx.construals, DeoThomas2025.answerable ctx q' = true → ¬q'.widerThan q)
Instances For
Classify a discourse context by WHY the widest answerable construal
is optimal. Connects to Phenomena.Focus.Exclusives.ContextType.
- (37a) answerable: all construals are answerable → CQ = widest overall
- (37b) qualityFail: some construal fails Quality (speaker lacks evidence)
- (37c) relevanceFail: some construal fails Relevance (not discourse-relevant)
Equations
- One or more equations did not get rendered due to their size.
Instances For
Only can replace just exactly when the alternatives are Roothian (complement-exclusion and rank-order). Verified against all empirical data.
Quality-failure contexts yield only causal-alternative flavors (unexplanatory, minimal sufficiency).
Relevance-failure contexts yield only elaboration-alternative flavors (unelaboratory).
All 9 JustFlavor constructors are attested in the empirical data.
WXDY's incredulity arises from a normative expectation violation: the situation violates what the speaker considers normal/appropriate. This is the same alternative source as counterexpectational just ("He's just texting during the lecture!").
- WXDY: "What's this fly doing in my soup?" — violates dining norms
- just: "He's just texting during the lecture!" — violates classroom norms
Instances For
WXDY's incongruity and counterexpectational just share the same alternative source: both involve normative expectations being violated.
Partition refinement implies question width #
The paper's central formal insight: finer granularity produces wider questions.
At the partition level, "finer" is QUD.refines (every fine cell ⊆ some coarse
cell), equivalently q.toSetoid ≤ q'.toSetoid in mathlib's Setoid lattice.
At the issue level, "wider" is Core.Question.widerThan (@cite{deo-thomas-2025}
(32): same info, no coarse answer ⊊ fine answer, some fine answer ⊊ coarse
answer). The bridge: toIssue := Core.Question.fromSetoid ∘ QUD.toSetoid
preserves this relationship.
The proof is an order-theoretic one-liner over Setoid: every alternative
of Core.Question.fromSetoid r is either ∅ or an equivalence class of r
(alt_fromSetoid_subset_classes), and the q-class of w₀ is contained in
the q'-class of w₀ by refinement, with v₀ witnessing strict containment.
This replaces a 100-line Bool/List proof that managed indices into
worlds : List W and case-split on properlyContains.
A QUD partitions a meaning space via an equivalence relation; via
QUD.toSetoid and Core.Question.fromSetoid, every QUD induces an
inquisitive content whose alternatives are exactly the QUD's
equivalence classes. The bridge is one-way: not every Core.Question
arises from a QUD (mention-some, intermediate-exhaustive, and
conditional-question alternatives are non-disjoint or non-exhaustive
and so are not representable as the cells of any equivalence
relation — @cite{theiler-etal-2018}).
Equations
Instances For
Strict partition refinement implies issue width.
If q (strictly) refines q' (q is the finer partition), then
toIssue q is wider than toIssue q' as Core.Questions.
The strictness witnesses w₀, v₀ : W share a coarse cell
(q'.r w₀ v₀) but not a fine cell
(¬ q.r w₀ v₀); they witness condition (c).
The proof establishes the three conditions of Core.Question.widerThan:
- (a) Same
info: bothfromSetoid-derived issues haveinfo = univ. - (b) No q'-alternative is properly contained in any q-alternative:
alternatives are classes (or
∅); under refinement, classes only widen as we go from the finer to the coarser setoid, so the reverse containment is impossible. - (c) Some q-alternative properly contained in some q'-alternative:
witnessed by the q-class and q'-class of
w₀, withv₀showing the inclusion is strict.
The full chain: finer granularity → wider question #
Composes the two independently proved steps:
finer_granularity_refines(fromTheories.Semantics.Degree.Granularity): if ε₁ ∣ ε₂, the ε₁-partition refines the ε₂-partitionrefinement_implies_wider(proved above): strict partition refinement → issue width
This is the formal content of the lexical entry (36): just selects the widest answerable construal, which — when alternatives vary by granularity — is the finest one the speaker can answer.
The complete granularity–width chain (@cite{deo-thomas-2025} §3.1.2–3.2).
If ε₁ divides ε₂ (finer grain) and there exist worlds that share a coarse cell but not a fine cell, then the fine-grained question is strictly wider than the coarse-grained question.
This is the general version of Figure 1: any uniform-grain-width scale satisfies the width relation when grain widths are divisible.
The 8-point age scale from Figure 1 (@cite{deo-thomas-2025}).
Equations
- DeoThomas2025.fig1Worlds = [0, 1, 2, 3, 4, 5, 6, 7]
Instances For
Coarse granularity: 2 cells of 4 (e.g., "younger half" vs "older half"). Worlds 0–3 share one answer, worlds 4–7 share another.
Equations
- DeoThomas2025.coarseQ = QUD.ofProject fun (w : Fin 8) => ↑w / 4
Instances For
Fine granularity: 4 cells of 2 (e.g., {0,1}, {2,3}, {4,5}, {6,7}). Each pair of adjacent worlds shares an answer.
Equations
- DeoThomas2025.fineQ = QUD.ofProject fun (w : Fin 8) => ↑w / 2
Instances For
Figure 1's partitions are instances of the general granQUD.
Figure 1 via the general granularity–width theorem. The fine 4-cell partition produces a wider issue than the coarse 2-cell partition over the 8-point domain.
Witnessed by worlds 0 and 2: they share a coarse cell (0/4 = 2/4 = 0) but not a fine cell (0/2 = 0 ≠ 2/2 = 1).