Šimík (2024): Polar question semantics and bias: Lessons from Slavic/Czech #
This file formalizes Šimík's survey of polar-question bias in Slavic. A question
form's bias profile is the set of cells, contextual evidence by prior epistemic bias
(after Sudo), in which it is felicitous: Table 2 gives the profile of the four Czech forms,
interrogative and declarative crossed with polarity (czechBiasProfile), and Table 1 the
profile of the Serbian strategies reported from Todorović (serbianBiasProfile).
The Czech cleaning-service scenarios (11)–(18) are typed rows, and the table predicts each
judgment (cleaning_examples_match_table2); declaratives need evidence
(declarative_requires_evidence) and Czech InterNPQ, unlike English high negation, is
felicitous under positive evidence (interNPQ_broader_than_english_outer), while Serbian
high negation is narrower than English (serbian_hnpq_narrower_than_english). The quiz
scenario (24) diagnoses each of ten languages' default strategy: its positive form is the
quiz-felicitous one (default_quiz_felicitous), declaratives never are
(declarative_quiz_infelicitous), and negation triggers bias except under Polish czy
and Macedonian dali (negationTriggersBias_iff). Serbian je li is neutral in Table 1 yet
quiz-infelicitous (jeLi_neutral_yet_quiz_infelicitous), the contrast the chapter
attributes to a covert 'wonder' selecting the question (wonderLF), which denotes the
unique true answer (trueAnswers_polar_existsUnique). Russian razve resolves a conflict
between evidence for the prejacent and a prior against it (razveProfile), invariantly
across inner and outer negation (razveProfile_negation_invariant), and is a root
phenomenon while li embeds (razve_root_li_embedded). The chapter's Czech FALSUM
(falsumCz) presupposes only epistemic possibility of the prejacent, weaker than
Repp's operator, the necessity □[epi ○ conv] (p ∉ cg ·) along the
knowledge and conversational goals of its bearer (falsumCz_eq_one_of_falsum), and licenses
the particle náhodou under outer negation alone (NahodouLicensed, nahodou_examples).
Implementation notes #
Table 2's starred DeclPPQ of the neutral cell, conditioned on a contrastive topic, is
admitted by czechFelicitous and read off the row feature contrastiveTopic. The
language rows carry the paper's own strategy labels; the derived predicates read the
normalized strategy and polarity features. The kin of razve across Slavic are listed
(razveKin) without a profile, as the chapter leaves their semantics open.
References #
Bias and the polarity of the prejacent (§3.1) #
The contextual evidence a conflict-resolving question of the given polarity rests on, which is evidence for the prejacent as asked.
Equations
- Simik2024.evidence s = ↑s
Instances For
The prior epistemic bias a conflict-resolving question of the given polarity double-checks, which is against the prejacent as asked.
Equations
- Simik2024.prior s = -↑s
Instances For
The polarity of a question with the given reading of negation, which is positive without negation and negative with either reading of it.
Equations
- Simik2024.polarityOf none = Polarity.positive
- Simik2024.polarityOf (some val) = Polarity.negative
Instances For
The Czech forms and their bias profile (§3.2, Table 2) #
The chapter's grid of Czech polar-question forms, which crosses interrogative (verb-initial) or declarative word order with polarity.
- interPPQ : CzechPQForm
- interNPQ : CzechPQForm
- declPPQ : CzechPQForm
- declNPQ : CzechPQForm
Instances For
Equations
- Simik2024.instDecidableEqCzechPQForm x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯
Equations
- Simik2024.instReprCzechPQForm = { reprPrec := Simik2024.instReprCzechPQForm.repr }
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- Simik2024.instFintypeCzechPQForm = { elems := { val := ↑Simik2024.CzechPQForm.enumList, nodup := Simik2024.CzechPQForm.enumList_nodup }, complete := Simik2024.instFintypeCzechPQForm._proof_1 }
The position of the negation of each grid cell, in [Rom24]'s forms. The verb-initial InterNPQ preposes its negated verb, a high negation question, and DeclNPQ does not, a low one.
Equations
Instances For
Declarative word order.
Equations
Instances For
Equations
- One or more equations did not get rendered due to their size.
The forms natural in each cell of contextual evidence by prior epistemic bias (Table 2),
with the starred DeclPPQ of the neutral cell left to czechFelicitous.
Equations
- Simik2024.czechBiasProfile SignType.pos SignType.pos = ∅
- Simik2024.czechBiasProfile SignType.pos SignType.zero = {Simik2024.CzechPQForm.declPPQ, Simik2024.CzechPQForm.interNPQ}
- Simik2024.czechBiasProfile SignType.pos SignType.neg = {Simik2024.CzechPQForm.declPPQ}
- Simik2024.czechBiasProfile SignType.zero SignType.pos = {Simik2024.CzechPQForm.interPPQ, Simik2024.CzechPQForm.interNPQ}
- Simik2024.czechBiasProfile SignType.zero SignType.zero = {Simik2024.CzechPQForm.interPPQ}
- Simik2024.czechBiasProfile SignType.zero SignType.neg = ∅
- Simik2024.czechBiasProfile SignType.neg SignType.pos = {Simik2024.CzechPQForm.declNPQ, Simik2024.CzechPQForm.interNPQ}
- Simik2024.czechBiasProfile SignType.neg SignType.zero = {Simik2024.CzechPQForm.declNPQ}
- Simik2024.czechBiasProfile SignType.neg SignType.neg = ∅
Instances For
The forms felicitous in a cell, admitting the unbiased declarative of (18) when a contrastive topic claims the initial position.
Equations
- Simik2024.czechFelicitous ev ob ct = if ct = true ∧ ev = 0 ∧ ob = 0 then insert Simik2024.CzechPQForm.declPPQ (Simik2024.czechBiasProfile ev ob) else Simik2024.czechBiasProfile ev ob
Instances For
The default form is natural exactly without evidence and without a prior against the prejacent.
DeclPPQ needs positive evidence and no prior for the prejacent.
DeclNPQ needs negative evidence and no prior against the prejacent.
InterNPQ conveys a prior for the prejacent, with neutral or conflicting evidence, or else positive evidence without a prior (the explanation-seeking (17)).
Declarative questions are specialized for evidential bias ([Gun02]).
Czech high negation is broader than English, being felicitous under positive evidence, which the evidence condition of [BG00] on outer negation excludes.
The cleaning scenarios (11)–(18) #
The grid form a row instantiates.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The contextual evidence of a row's scenario.
Equations
- Simik2024.evidence? e = e.parse? "evidence" [("forP", 1), ("neutral", 0), ("againstP", -1)]
Instances For
The speaker's prior epistemic bias in a row's scenario.
Equations
- Simik2024.epistemic? e = e.parse? "epistemic" [("forP", 1), ("neutral", 0), ("againstP", -1)]
Instances For
Whether a row's scenario places a contrastive topic clause-initially.
Equations
- Simik2024.contrastiveTopic e = (e.feature? "contrastiveTopic" == some "true")
Instances For
Table 2 predicts the scenarios. A form is judged infelicitous exactly when its cell excludes it, the degraded InterPPQ of (18) counting as admitted.
Default strategies under the quiz scenario (§4.1) #
Equations
- Simik2024.instDecidableEqLanguage 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.
- Simik2024.instReprLanguage.repr Simik2024.Language.czech prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Simik2024.Language.czech")).group prec✝
- Simik2024.instReprLanguage.repr Simik2024.Language.slovak prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Simik2024.Language.slovak")).group prec✝
- Simik2024.instReprLanguage.repr Simik2024.Language.polish prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Simik2024.Language.polish")).group prec✝
- Simik2024.instReprLanguage.repr Simik2024.Language.serbian prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Simik2024.Language.serbian")).group prec✝
- Simik2024.instReprLanguage.repr Simik2024.Language.russian prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Simik2024.Language.russian")).group prec✝
Instances For
Equations
- Simik2024.instReprLanguage = { reprPrec := Simik2024.instReprLanguage.repr }
Equations
- Simik2024.instFintypeLanguage = { elems := { val := ↑Simik2024.Language.enumList, nodup := Simik2024.Language.enumList_nodup }, complete := Simik2024.instFintypeLanguage._proof_1 }
Glottocode, the key of the example rows.
Equations
- Simik2024.Language.czech.glottocode = "czec1258"
- Simik2024.Language.slovak.glottocode = "slov1269"
- Simik2024.Language.upperSorbian.glottocode = "uppe1395"
- Simik2024.Language.slovenian.glottocode = "slov1268"
- Simik2024.Language.ukrainian.glottocode = "ukra1253"
- Simik2024.Language.polish.glottocode = "poli1260"
- Simik2024.Language.serbian.glottocode = "serb1264"
- Simik2024.Language.macedonian.glottocode = "mace1250"
- Simik2024.Language.bulgarian.glottocode = "bulg1262"
- Simik2024.Language.russian.glottocode = "russ1263"
Instances For
Equations
- Simik2024.instDecidableEqStrategy 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
- Simik2024.instReprStrategy = { reprPrec := Simik2024.instReprStrategy.repr }
Equations
- Simik2024.instFintypeStrategy = { elems := { val := ↑Simik2024.Strategy.enumList, nodup := Simik2024.Strategy.enumList_nodup }, complete := Simik2024.instFintypeStrategy._proof_1 }
The chapter's summary classification of each language's default strategy as verb or auxiliary movement, an utterance-initial particle, or a verb-attached particle.
Equations
- Simik2024.Language.czech.defaultStrategy = Simik2024.Strategy.verbMovement
- Simik2024.Language.slovak.defaultStrategy = Simik2024.Strategy.verbMovement
- Simik2024.Language.upperSorbian.defaultStrategy = Simik2024.Strategy.verbMovement
- Simik2024.Language.slovenian.defaultStrategy = Simik2024.Strategy.verbMovement
- Simik2024.Language.ukrainian.defaultStrategy = Simik2024.Strategy.clauseInitialParticle
- Simik2024.Language.polish.defaultStrategy = Simik2024.Strategy.clauseInitialParticle
- Simik2024.Language.serbian.defaultStrategy = Simik2024.Strategy.clauseInitialParticle
- Simik2024.Language.macedonian.defaultStrategy = Simik2024.Strategy.clauseInitialParticle
- Simik2024.Language.bulgarian.defaultStrategy = Simik2024.Strategy.verbAttachedParticle
- Simik2024.Language.russian.defaultStrategy = Simik2024.Strategy.verbAttachedParticle
Instances For
The question particles of each language's fragment.
Equations
- Simik2024.Language.czech.particles = []
- Simik2024.Language.slovak.particles = []
- Simik2024.Language.upperSorbian.particles = []
- Simik2024.Language.slovenian.particles = [Slovenian.QuestionParticles.ali, Slovenian.QuestionParticles.a, Slovenian.QuestionParticles.kaj]
- Simik2024.Language.ukrainian.particles = [Ukrainian.QuestionParticles.cy, Ukrainian.QuestionParticles.xiba]
- Simik2024.Language.polish.particles = [Polish.QuestionParticles.czy, Polish.QuestionParticles.czyzby]
- Simik2024.Language.serbian.particles = [Serbian.QuestionParticles.li, Serbian.QuestionParticles.daLi, Serbian.QuestionParticles.jeLi, Serbian.QuestionParticles.zar]
- Simik2024.Language.macedonian.particles = [Macedonian.QuestionParticles.dali, Macedonian.QuestionParticles.li, Macedonian.QuestionParticles.zar]
- Simik2024.Language.bulgarian.particles = [Bulgarian.QuestionParticles.li, Bulgarian.QuestionParticles.nima]
- Simik2024.Language.russian.particles = [Russian.QuestionParticles.li, Russian.QuestionParticles.razve, Russian.QuestionParticles.neuzeli]
Instances For
The strategy a quiz row instantiates.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The polarity of a quiz row.
Equations
- Simik2024.polarity? e = e.parse? "polarity" [("positive", Polarity.positive), ("negative", Polarity.negative)]
Instances For
The quiz rows (25)–(34) of a language.
Equations
- Simik2024.quizRows l = List.filter (fun (e : Datum) => e.language == l.glottocode && (e.feature? "strategy").isSome) Simik2024.Examples.all
Instances For
Every language's default strategy is quiz-felicitous in its positive form.
Declarative polar questions convey evidential bias and are quiz-infelicitous in every language.
Negation triggers bias in a language when no negated interrogative form is quiz-felicitous.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- Simik2024.instDecidableNegationTriggersBias l = id inferInstance
Every language's quiz rows include a negated interrogative form.
Negation triggers bias everywhere except under Polish czy (30b) and Macedonian dali (32a).
Every fragment particle is recorded in matrix polar questions.
The Serbian strategies and Todorović's bias profile (§4.2.2, Table 1) #
The Serbian strategies of (31) and Table 1, which are the two positive particle strategies, high negation (nije li), and low negation (je l' … nije).
- daLiPPQ : SerbianPQForm
- jeLiPPQ : SerbianPQForm
- hnpq : SerbianPQForm
- lnpq : SerbianPQForm
Instances For
Equations
- Simik2024.instDecidableEqSerbianPQForm x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯
Equations
- Simik2024.instReprSerbianPQForm = { reprPrec := Simik2024.instReprSerbianPQForm.repr }
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.
The fragment marker of each strategy.
Equations
Instances For
The Serbian strategies natural in each cell (Table 1), after [Tod23].
Equations
- Simik2024.serbianBiasProfile SignType.pos SignType.pos = ∅
- Simik2024.serbianBiasProfile SignType.pos SignType.zero = {Simik2024.SerbianPQForm.jeLiPPQ}
- Simik2024.serbianBiasProfile SignType.pos SignType.neg = ∅
- Simik2024.serbianBiasProfile SignType.zero SignType.pos = {Simik2024.SerbianPQForm.jeLiPPQ}
- Simik2024.serbianBiasProfile SignType.zero SignType.zero = {Simik2024.SerbianPQForm.daLiPPQ, Simik2024.SerbianPQForm.jeLiPPQ}
- Simik2024.serbianBiasProfile SignType.zero SignType.neg = {Simik2024.SerbianPQForm.lnpq}
- Simik2024.serbianBiasProfile SignType.neg SignType.pos = {Simik2024.SerbianPQForm.lnpq, Simik2024.SerbianPQForm.hnpq}
- Simik2024.serbianBiasProfile SignType.neg SignType.zero = {Simik2024.SerbianPQForm.lnpq}
- Simik2024.serbianBiasProfile SignType.neg SignType.neg = ∅
Instances For
da li questions are limited to neutral contexts.
je li questions have the broader distribution.
Positive questions are incompatible with negative biases.
High negation resolves a conflict between a prior for the prejacent and evidence against it, and nothing else.
Low negation has the broader distribution among negative questions.
Serbian high negation is narrower than English, since neutral evidence, which the evidence condition of [BG00] on outer negation admits, admits no Serbian HNPQ.
The quiz rows of (31) carry the markers of the Table 1 strategies.
In the quiz-versus-information-seeking contrast, je li is natural in the neutral cell of Table 1 yet infelicitous in the quiz (31b), where da li is felicitous (31a).
Information-seeking questions (§2, §4.2.1) #
The chapter hypothesizes that the strategies that are neutral yet quiz-infelicitous (Serbian je li, Slovenian a, possibly Russian intonation questions) embed the Hamblin question under a covert 'wonder', modelled as 'want to know' applied to the true answer ([Kar77b], [Day96]); a quiz master knows the answer and so cannot want to know it.
A polar question has exactly one true answer at each world.
The speaker wants to know the true answer to the polar question over p (the chapter's
(36)); the embedded (10b) is the same form with the attitude holder in place of the
speaker.
Equations
- Simik2024.wonderLF p wantToKnow x = {w : W | ∃ q ∈ Question.trueAnswers {p, pᶜ} w, w ∈ wantToKnow x q}
Instances For
Russian razve and its kin (§4.2.4) #
The bias profile of a razve question on each reading, which pairs evidence for the prejacent as asked with a prior for its negation (the conflict-resolving profile of §3.1).
Equations
Instances For
The profile of razve negative questions is the same under inner negation (VERUM) and outer negation (FALSUM), with negative evidence and a positive prior.
Razve is compatible with both negations ([RG22]'s LFs (40), diagnosed
by the polarity items in (41)), neuželi with inner negation only. The two readings
double-check the negation of the prejacent, some .negative, and the prejacent itself,
some .positive.
Equations
- Simik2024.razveNegations = {some Polarity.negative, some Polarity.positive}
Instances For
Neuželi lexicalizes VERUM and so tolerates inner negation only.
Equations
Instances For
Razve is a root phenomenon while li is obligatory in subordinated polar questions ([Kor23]), read off the fragment cells.
The kin of razve the chapter lists across Slavic, whose semantics it leaves open.
Equations
- One or more equations did not get rendered due to their size.
Instances For
FALSUM and the Czech outer negation (§3.3.2, §5) #
The chapter's Czech FALSUM (44) is defined when the attitude holder considers the prejacent possible, and true when it is not in the common ground.
Equations
- Simik2024.falsumCz epi cg p = {w : W | ModalLogic.Diamond epi (fun (x : W) => x ∈ p) w}.indicator fun (w : W) => SignType.ofProp (p ∉ cg w)
Instances For
The question (45) over the Czech FALSUM asks whether the prejacent is outside the common ground.
Equations
- Simik2024.falsumCzQuestion cg p = Question.polar {w : W | p ∉ cg w}
Instances For
The commitment of the Czech operator is weak, since its presupposition is epistemic possibility, the dual of necessity, and fails only where the prejacent is necessarily false.
[Rep13]'s FALSUM (22b), □[epi ○ conv] (p ∉ cg ·), makes the Czech operator true
wherever it is defined when the bearer's knowledge-then-goals relation is reflexive, as it is for
reflexive epi and conv; reflexive conv, every world satisfying the bearer's conversational
goals, is an idealization.
Náhodou is licensed by outer negation and by nothing else (43). The two readings of negation
in a polar question (the chapter's (14), after [Lad81] and [Rep13]) are polarities of the
proposition the question double-checks. Inner negation, the classical propositional operator
diagnosed by negative polarity items, double-checks the negation of the prejacent, .negative;
outer negation, the non-propositional FALSUM diagnosed by positive polarity items, the prejacent
itself, .positive.
Equations
- Simik2024.NahodouLicensed pol r = (pol = Polarity.negative ∧ r = Polarity.positive)
Instances For
Equations
- Simik2024.instDecidableNahodouLicensed pol r = id inferInstance
Náhodou needs negation (43e).
Náhodou needs outer negation (43d).
The reading of negation an indefinite diagnoses, the polarity item diagnosing the outer one and the concord item the inner one.
Equations
- Simik2024.indefiniteReading? e = e.parse? "indefinite" [("ppi", Polarity.positive), ("nci", Polarity.negative)]
Instances For
The (43) rows with náhodou are acceptable exactly when the particle is licensed by the polarity and the reading the indefinite diagnoses.