Türk & Hirsch (2026) — Category Match constrains polar question alternatives #
@cite{turk-hirsch-2026} @cite{atlamaz-2023} @cite{fox-katzir-2011} @cite{rooth-1992}
Connects the empirical judgments in PolarAnswers.lean (modal answers
are infelicitous to Turkish polar questions) to the formal explanation
@cite{turk-hirsch-2026} propose: @cite{fox-katzir-2011} category match
over UPOS tags applied to the focus alternatives evoked by the polarity
head Σ_F that hosts Turkish mI.
The puzzle #
Following @cite{atlamaz-2023}'s bidimensional analysis, Turkish mI heads PolP and bears focus (Σ_F). Under @cite{rooth-1992}-style type-theoretic alternative computation, any operator of the same semantic type counts as an alternative — including deontic modals. This yields {p, ¬p, □p}, wrongly predicting □p is a felicitous answer.
The fix #
Category match restricts alternatives to items sharing mI's UPOS tag
PART. Polarity operators (Σ = id, NEG = pnot) are PART; "must"
is AUX. Category match yields {p, ¬p} — the correct polar question.
Scenario #
Four worlds: Ali sleeps/doesn't × deontic must/free.
Four worlds crossing Ali-sleeps with deontic-must.
- sleeps_must : PolarWorld
- sleeps_free : PolarWorld
- nosleep_must : PolarWorld
- nosleep_free : PolarWorld
Instances For
Equations
- Phenomena.Focus.Studies.TurkHirsch2026.instDecidableEqPolarWorld x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
p = "Ali sleeps": holds at the worlds where Ali sleeps.
Equations
Instances For
¬p = "Ali doesn't sleep". Set complement of p.
Instances For
Deontic must, grounded in @cite{kratzer-1977}'s premise-set semantics.
The deontic source maps each world to the propositions encoding the
deontic obligations in force at that world. In the *_must worlds the
obligation "Ali sleeps" is in force; in the *_free worlds nothing is.
`mustP` is then the Bool reflection of `mustInView deonticBase pProp` —
no longer a stipulated 4-row table.
Prop view of p for use with the polymorphic Kratzer machinery
(which lives at type Index → Prop). Just set membership.
Equations
Instances For
The deontic premise set: in must-worlds the obligation pProp is
in force; in free-worlds the premise set is empty.
Equations
- Phenomena.Focus.Studies.TurkHirsch2026.deonticBase Phenomena.Focus.Studies.TurkHirsch2026.PolarWorld.sleeps_must = [Phenomena.Focus.Studies.TurkHirsch2026.pProp]
- Phenomena.Focus.Studies.TurkHirsch2026.deonticBase Phenomena.Focus.Studies.TurkHirsch2026.PolarWorld.nosleep_must = [Phenomena.Focus.Studies.TurkHirsch2026.pProp]
- Phenomena.Focus.Studies.TurkHirsch2026.deonticBase Phenomena.Focus.Studies.TurkHirsch2026.PolarWorld.sleeps_free = []
- Phenomena.Focus.Studies.TurkHirsch2026.deonticBase Phenomena.Focus.Studies.TurkHirsch2026.PolarWorld.nosleep_free = []
Instances For
Kratzer-grounded deontic must: □p as @cite{kratzer-1977} Def 5
(mustInView) over the deontic premise set.
Equations
- One or more equations did not get rendered due to their size.
Instances For
□p = "Ali must sleep" (deontic necessity). The Set reflection of
mustGrounded; equivalence proved by mustP_iff_mustGrounded.
Equations
Instances For
The stipulated table matches the Kratzer-grounded derivation. The over-generation argument below is therefore about a genuine modal proposition, not a hand-tuned function.
A denotation tagged with its UD UPOS category. Study-internal utility used to model @cite{turk-hirsch-2026}'s claim that mI's PART tag licenses only PART-tagged alternatives.
- cat : UD.UPOS
- den : α
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
The lexicon of propositional operators at type ⟨⟨s,t⟩,t⟩.
Polarity heads (Σ, NEG) are tagged PART; the deontic modal is AUX.
This UPOS distinction is what category match exploits.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Type-theoretic alternatives (@cite{rooth-1985} D_τ): all operators regardless of UPOS → {p, ¬p, □p}. Over-generates.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Category-match alternatives: only PART-tagged
operators → {p, ¬p}. Correct.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Type-theoretic question: {p, ¬p, □p} — over-generated.
Equations
Instances For
Category-match question: {p, ¬p} — correct.
Equations
Instances For
The expected polar question: {p, ¬p}.
Equations
Instances For
Category-matched question = standard polar question.
@cite{fox-katzir-2011}'s category match yields the correct {p, ¬p} partition.
catMatchAlternatives filters opLexicon to [p, notP], and the
resulting set-of-alternatives equals the polar {p, notP} literal.
The spurious prediction: □p is an answer to the type-theoretic question. Under @cite{rooth-1992}-style D_τ, "Ali must sleep" is predicted to be a felicitous answer to "Does Ali sleep?" — which is empirically wrong.
The correct prediction: □p is NOT an answer to the polar question. "Ali must sleep" is not a felicitous answer to a yes/no question about whether Ali sleeps.
Category match fixes the over-generation: □p is NOT an answer to the category-matched question.
Type-theoretic question ≠ polar question. The D_τ computation admits □p, which the polar question rejects.
Connect the empirical judgments from PolarAnswers.lean to the
formal model. The data says modal answers are infelicitous;
the theory (category match) explains why: □p is excluded from
the Hamblin alternative set.
The empirical datum: modal answer is infelicitous.
The theory predicts it: □p is not an answer under category match.
The theory would wrongly predict felicity without category match.
Following @cite{rooth-1992}, the A-value of a [FoC]-marked constituent is the set of alternatives of the same semantic type — i.e., exactly the type-theoretic D_τ computation.
@cite{turk-hirsch-2026}'s contribution is showing that this over-generates
for Turkish polar questions, and that category match (@cite{fox-katzir-2011})
is the correct constraint on alternative computation when the focus host
is Σ_F.
Applying [FoC] with type-theoretic A-value yields the over-generating set.
Equations
Instances For
The type-theoretic A-value produces the wrong question denotation.
Restricting the A-value by category match corrects the prediction.
Equations
Instances For
The category-matched A-value produces the correct question denotation.
The fragment exposes only theory-neutral lexical primitives. Here we
add the theory-specific tagging that @cite{turk-hirsch-2026}'s analysis
requires: a UPOS label (for @cite{fox-katzir-2011} category match) and
a Head label (for @cite{laka-1990}-style PolP). These commitments
live in the study file, not the fragment, so the fragment stays
reusable across syntactic theories.
Polarity-head labels assumed by this study (Laka-style ΣP/NEGP).
Lean reserves Σ for sigma types, so the affirmative head's
Lean-side identifier is affirm (the linguistic name "Σ" is
preserved in docstrings).
Instances For
Equations
- Phenomena.Focus.Studies.TurkHirsch2026.instDecidableEqHead x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
The bare semantic operator each head spells out.
Equations
Instances For
The @cite{turk-hirsch-2026} / @cite{atlamaz-2023} analysis: mI is Σ
and tagged PART.
Equations
Instances For
mI's lexical denotation matches the operator its analyzed head spells out — a definitional consistency check between the fragment entry and the head analysis adopted here.
The UPOS tag this study assigns to mI matches the category used in the alternative-restriction computation.