Gutzmann (2015): Use-Conditional Meaning #
This file formalizes the logic L_TU of [Gut15], chapter 4, and its two case studies,
sentence mood (chapter 5) and German modal particles (chapter 6). An expression of L_TU has
three dimensions, truth-conditional content, active use-conditional content, and the completed
use-conditional propositions; multidimensional application (4.46) applies functions in the first
two and merges the third, and use-conditional elimination (4.54) stores a completed second
dimension in the third, Expr.app and Expr.elim. The lexical extension rules (4.55), (4.56),
and (4.67) build three-dimensional entries from one-dimensional ones, giving a use-conditional
item an identity function as its truth-conditional dimension, Expr.ofModifier. The principle
of non-interaction (4.28) is then a theorem about every derivation, Deriv.eval_t: its
truth-conditional dimension is computed from the lexical items' first dimensions alone. Sentence
mood follows Truckenbrodt's decomposition into a deontic operator (5.85), present in every
matrix clause by the root rule (5.43), an epistemic modifier of it (5.91), present where a
[±wh] feature is visible at LF (5.41), and the hearer knowledge condition (5.99) of
v2-interrogatives; the German clause types compose as in (5.82), (5.93), and (5.100),
ClauseType.mood, so every clause's truth conditions are its content, its use conditions
are the deontic attitude, and a v2-interrogative differs from a vl-interrogative exactly by
hearer knowledge, the Cuban cigar scenario (5.36). Of the modal particles, wohl modifies the
epistemic operator (6.103), so its exclusion from imperatives and root dass-clauses is a type
mismatch: no derivation over their lexicon reaches the epistemic type, Derivable, and the
book's wohl examples are acceptable exactly where one does, wohl_rows; ja (6.122) and denn
(6.133) compose with any mood, and their use conditions in the excluded clause types, (6.129)
and (6.142), are ones the book argues no rational speaker holds. The book's examples are the
rows of Data.Examples.Gutzmann2015.
Truckenbrodt's five clause types are read off the library's clause cells, ClauseType.ofCell:
the finite verb moves to C in a root declarative or interrogative, while a dass-clause or a
deliberative ob- or wh-question used as a root utterance, Evans's insubordination, keeps it
last, and the imperative stands apart, (5.39). On the cells both classify, Truckenbrodt's verb
movement is the verb-second requirement of German.verbSecond, verbInC_iff_required; the
sentence types in which Durrell licenses wohl all have a clause type carrying the epistemic
modifier, wohl_licensed_hasEpistemic; and where Durrell excludes a modal particle from a cell
the book's row there is unacceptable, excluded_rows.
Implementation notes #
The type system (4.45) is taken at the propositional fragment: t is the type of propositions,
the book's ⟨s,t⟩, and entities are omitted, so the typology of chapter 2 and the
expressive-modification examples of chapter 4 are not formalized. The deontic and epistemic
operators quantify over contextually suitable attitude predicates (5.84), (5.90), which a
MoodModel supplies together with the hearer knowledge, common knowledge, assumption, and
reason predicates the particles' lexical entries use. The rationality step that rules out ja
in interrogatives and denn outside v2-interrogatives (section 6.5.2) is not a theorem of the
logic, so their use conditions are derived and the restriction is left to the rows.
References #
The German clause types of chapter 5, Truckenbrodt's, told apart by the position of the finite verb and by the complementizer: root dass-clauses with the verb last, v2-declaratives, v2-interrogatives with the finite verb in C, vl-interrogatives with the verb last, and imperatives.
- dassVL : ClauseType
- v2Declarative : ClauseType
- v2Interrogative : ClauseType
- vlInterrogative : ClauseType
- imperative : ClauseType
Instances For
Equations
- Gutzmann2015.instDecidableEqClauseType x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯
Equations
- Gutzmann2015.instReprClauseType = { reprPrec := Gutzmann2015.instReprClauseType.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 clause type of a cell. The finite verb moves to C in a root declarative or interrogative, a dass-clause or an interrogative used as a root utterance keeps it last, and the imperative stands apart.
Equations
- Gutzmann2015.ClauseType.ofCell Clause.SentenceType.declarative Clause.EmbeddingContext.matrix = some Gutzmann2015.ClauseType.v2Declarative
- Gutzmann2015.ClauseType.ofCell Clause.SentenceType.polar Clause.EmbeddingContext.matrix = some Gutzmann2015.ClauseType.v2Interrogative
- Gutzmann2015.ClauseType.ofCell Clause.SentenceType.alternative Clause.EmbeddingContext.matrix = some Gutzmann2015.ClauseType.v2Interrogative
- Gutzmann2015.ClauseType.ofCell Clause.SentenceType.constituent Clause.EmbeddingContext.matrix = some Gutzmann2015.ClauseType.v2Interrogative
- Gutzmann2015.ClauseType.ofCell Clause.SentenceType.imperative Clause.EmbeddingContext.matrix = some Gutzmann2015.ClauseType.imperative
- Gutzmann2015.ClauseType.ofCell Clause.SentenceType.declarative Clause.EmbeddingContext.insubordinated = some Gutzmann2015.ClauseType.dassVL
- Gutzmann2015.ClauseType.ofCell Clause.SentenceType.polar Clause.EmbeddingContext.insubordinated = some Gutzmann2015.ClauseType.vlInterrogative
- Gutzmann2015.ClauseType.ofCell Clause.SentenceType.alternative Clause.EmbeddingContext.insubordinated = some Gutzmann2015.ClauseType.vlInterrogative
- Gutzmann2015.ClauseType.ofCell Clause.SentenceType.constituent Clause.EmbeddingContext.insubordinated = some Gutzmann2015.ClauseType.vlInterrogative
- Gutzmann2015.ClauseType.ofCell x✝¹ x✝ = none
Instances For
The finite verb has moved to C, (5.39), in the v2 types and in the imperative.
Equations
Instances For
Equations
- Gutzmann2015.instDecidablePredClauseTypeVerbInC Gutzmann2015.ClauseType.v2Declarative = isTrue trivial
- Gutzmann2015.instDecidablePredClauseTypeVerbInC Gutzmann2015.ClauseType.v2Interrogative = isTrue trivial
- Gutzmann2015.instDecidablePredClauseTypeVerbInC Gutzmann2015.ClauseType.imperative = isTrue trivial
- Gutzmann2015.instDecidablePredClauseTypeVerbInC Gutzmann2015.ClauseType.dassVL = isFalse Gutzmann2015.instDecidablePredClauseTypeVerbInC._proof_1
- Gutzmann2015.instDecidablePredClauseTypeVerbInC Gutzmann2015.ClauseType.vlInterrogative = isFalse Gutzmann2015.instDecidablePredClauseTypeVerbInC._proof_2
On the cells both classify, imperatives apart as in (5.39), Truckenbrodt's verb movement is the verb-second requirement of the German fragment.
The cell a row records, a sentence type in a matrix or insubordinated context.
Equations
- One or more equations did not get rendered due to their size.
Instances For
A clause type has the epistemic modifier of the deontic operator where a [±wh] feature is visible at LF (5.41): in every clause type but root dass-clauses and imperatives.
Equations
- Gutzmann2015.ClauseType.dassVL.HasEpistemic = False
- Gutzmann2015.ClauseType.imperative.HasEpistemic = False
- x✝.HasEpistemic = True
Instances For
Equations
- One or more equations did not get rendered due to their size.
Every sentence type in which Durrell licenses wohl has a clause type carrying the epistemic modifier that wohl takes, (6.103).
The logic L_TU, chapter 4 #
Equations
- One or more equations did not get rendered due to their size.
- Gutzmann2015.instDecidableEqUCType.decEq Gutzmann2015.UCType.t Gutzmann2015.UCType.t = isTrue ⋯
- Gutzmann2015.instDecidableEqUCType.decEq Gutzmann2015.UCType.t Gutzmann2015.UCType.u = isFalse Gutzmann2015.instDecidableEqUCType.decEq._proof_3
- Gutzmann2015.instDecidableEqUCType.decEq Gutzmann2015.UCType.t (σ.func τ) = isFalse ⋯
- Gutzmann2015.instDecidableEqUCType.decEq Gutzmann2015.UCType.u Gutzmann2015.UCType.t = isFalse Gutzmann2015.instDecidableEqUCType.decEq._proof_5
- Gutzmann2015.instDecidableEqUCType.decEq Gutzmann2015.UCType.u Gutzmann2015.UCType.u = isTrue ⋯
- Gutzmann2015.instDecidableEqUCType.decEq Gutzmann2015.UCType.u (σ.func τ) = isFalse ⋯
- Gutzmann2015.instDecidableEqUCType.decEq (σ.func τ) Gutzmann2015.UCType.t = isFalse ⋯
- Gutzmann2015.instDecidableEqUCType.decEq (σ.func τ) Gutzmann2015.UCType.u = isFalse ⋯
Instances For
(4.45b) and (4.45e): a type is use-conditional when it is u or a function into a
use-conditional type.
Equations
- Gutzmann2015.UCType.u.IsUC = True
- (σ.func τ).IsUC = τ.IsUC
- Gutzmann2015.UCType.t.IsUC = False
Instances For
Equations
- Gutzmann2015.UCType.u.decIsUC = isTrue trivial
- Gutzmann2015.UCType.t.decIsUC = isFalse Gutzmann2015.UCType.decIsUC._proof_1
- (σ.func τ).decIsUC = τ.decIsUC
The denotation of a type: propositions are sets of worlds, use-conditional propositions sets of contexts.
Equations
- Gutzmann2015.UCType.Denote W C Gutzmann2015.UCType.t = (W → Prop)
- Gutzmann2015.UCType.Denote W C Gutzmann2015.UCType.u = (C → Prop)
- Gutzmann2015.UCType.Denote W C (σ.func τ) = (Gutzmann2015.UCType.Denote W C σ → Gutzmann2015.UCType.Denote W C τ)
Instances For
A three-dimensional expression: a truth-conditional dimension of type σ, an active
use-conditional dimension of type ρ, and the completed use-conditional propositions.
- t : UCType.Denote W C σ
- s : UCType.Denote W C ρ
- u : C → Prop
Instances For
(4.54): unary use-conditional elimination. Once the active dimension is a use-conditional proposition it is merged into the third, and the second becomes a copy of the first.
Instances For
(4.55): a truth-conditional item is copied into the second dimension, with the neutral third.
Equations
- Gutzmann2015.Expr.ofTC a = { t := a, s := a, u := fun (x : C) => True }
Instances For
(4.56) and (4.67): an n-th level use-conditional modifier on ⟨σ, τ⟩ receives the
identity on the n-th level modifier type on σ as its truth-conditional dimension; at
n = 0 this is the extension of a functional expletive use-conditional item.
Equations
- Gutzmann2015.Expr.ofModifier n α = { t := fun (x : Gutzmann2015.UCType.Denote W C (σ.modifier n)) => x, s := α, u := fun (x : C) => True }
Instances For
A derivation in L_TU: lexical items composed by multidimensional application and
use-conditional elimination.
- lex {W C : Type u} {σ ρ : UCType} : Expr W C σ ρ → Deriv W C σ ρ
- app {W C : Type u} {σ τ ρ ν : UCType} : Deriv W C (σ.func τ) (ρ.func ν) → Deriv W C σ ρ → Deriv W C τ ν
- elim {W C : Type u} {σ : UCType} : Deriv W C σ UCType.u → Deriv W C σ σ
Instances For
The truth-conditional dimension computed from the lexical items' first dimensions alone.
Equations
- (Gutzmann2015.Deriv.lex x_5).truthShadow = x_5.t
- (f.app a).truthShadow = f.truthShadow a.truthShadow
- d.elim.truthShadow = d.truthShadow
Instances For
(4.28), the principle of non-interaction: the truth-conditional dimension of every derivation is a function of its lexical items' truth-conditional dimensions alone, so use-conditional content never leaks into truth conditions.
Sentence mood, chapter 5 #
The context-dependent attitudes the sentence mood operators and modal particles quantify over: the world of the context, the deontic speaker predicates suitable for a proposition (5.84), the epistemic predicates suitable at a world (5.90), whether the addressee knows whether a proposition holds (5.99), the speaker's belief that it is common knowledge or verifiable (6.122), the assumption operator of wohl (6.110), the common ground, and the proposition that one proposition is the speaker's reason to ask another (6.133).
- world : C → W
- commonGround : C → Set (W → Prop)
Instances For
(5.85): the deontic operator. Some contextually suitable deontic speaker predicate holds of the proposition at the world of the context.
Equations
- Gutzmann2015.deont M p c = ∃ d ∈ M.deonticFor c p, d p (M.world c)
Instances For
(5.90): the epistemic predicate, some contextually suitable epistemic attitude toward the proposition at a world.
Equations
- Gutzmann2015.epis M p w = ∃ e ∈ M.episFor w p, e p w
Instances For
(5.91): the epistemic sentence mood operator, a modifier feeding the epistemically embedded proposition to a mood operator.
Equations
- Gutzmann2015.E M D p = D (Gutzmann2015.epis M p)
Instances For
(5.99): hearer knowledge, a functional expletive item.
Equations
- Gutzmann2015.hknow M p c = M.knowsWhether c p
Instances For
The propositional content as a lexical item, (4.55).
Equations
Instances For
(5.82): the mood of a root dass-clause and of an imperative, the deontic operator alone.
Equations
Instances For
(5.93): the mood of a v2-declarative and of a vl-interrogative: the epistemic modifier applies to the deontic operator, which takes the content.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Chapter 5's compositions for the German clause types: dass-VL clauses and imperatives have the deontic operator alone, since [−wh] on the meaningless dass is invisible at LF (5.41) and imperatives carry no visible feature; declaratives and vl-interrogatives the epistemically modified deontic operator; v2-interrogatives the hearer knowledge condition as well.
Equations
- Gutzmann2015.ClauseType.mood M Gutzmann2015.ClauseType.dassVL = Gutzmann2015.deonticOnly M
- Gutzmann2015.ClauseType.mood M Gutzmann2015.ClauseType.imperative = Gutzmann2015.deonticOnly M
- Gutzmann2015.ClauseType.mood M Gutzmann2015.ClauseType.v2Declarative = Gutzmann2015.deonticEpistemic M
- Gutzmann2015.ClauseType.mood M Gutzmann2015.ClauseType.vlInterrogative = Gutzmann2015.deonticEpistemic M
- Gutzmann2015.ClauseType.mood M Gutzmann2015.ClauseType.v2Interrogative = Gutzmann2015.v2InterrogativeMood M
Instances For
(5.83a) and (5.94): the truth conditions of every clause type are its content.
(5.83b): a root dass-clause or imperative is felicitous when the speaker holds a suitable deontic attitude toward its content.
(5.95) and (5.96): a v2-declarative or vl-interrogative is felicitous when the speaker holds a deontic attitude toward the epistemically embedded content.
(5.100): a v2-interrogative adds that the addressee knows whether the content holds.
(5.43), the root rule: the use conditions of every clause type include a deontic attitude of the speaker.
(5.36), the Cuban cigar scenario: a v2-interrogative is felicitous exactly when the vl-interrogative with the same content is and the addressee knows the answer.
Modal particles, chapter 6 #
(6.122): ja flags its content as common knowledge or verifiable on the spot.
Equations
- Gutzmann2015.jaEntry M p c = M.commonKnowledge c p
Instances For
(6.103) and (6.110): wohl modifies the epistemic operator, embedding the content under the speaker's or hearer's assumption.
Equations
- Gutzmann2015.wohlEntry M E D p = E D (M.assume p)
Instances For
(6.131) and (6.133): denn modifies the hearer knowledge operator, adding that some common ground proposition is known to be the speaker's reason for asking.
Equations
- Gutzmann2015.dennEntry M H p c = (H p c ∧ ∃ q ∈ M.commonGround c, H (M.reasonToAsk q p) c)
Instances For
(6.111) to (6.113): a declarative with wohl, which takes the epistemic modifier, then the deontic operator, then the content.
Equations
- One or more equations did not get rendered due to their size.
Instances For
(6.125) to (6.127): a ja-declarative is felicitous when the speaker wants the hearer to know its content and believes it common knowledge or verifiable.
(6.129): a ja-interrogative would require the speaker to want to know whether its content holds, the hearer to know, and the speaker to believe it common knowledge, which the book argues no reasonable speaker does.
(6.114) and (6.116): a wohl-declarative is true when its content is, and felicitous under a deontic attitude toward the epistemically embedded assumption of the content.
(6.136) and (6.137): a denn-interrogative adds that some common ground proposition is known by the hearer to be the reason for asking.
(6.142): a denn-imperative would require the speaker to want some proposition to be the reason for asking whether its content holds.
Selectional restrictions due to types, section 6.5.1 #
The active-dimension types derivable from a lexicon by multidimensional application and use-conditional elimination, which returns a completed use-conditional proposition to the propositional type.
- lex {L : Set UCType} {σ : UCType} : σ ∈ L → Derivable L σ
- app {L : Set UCType} {σ τ : UCType} : Derivable L (σ.func τ) → Derivable L σ → Derivable L τ
- elim {L : Set UCType} : Derivable L UCType.u → Derivable L UCType.t
Instances For
The active-dimension types of a clause type's mood items: the deontic operator, and the epistemic modifier where a [±wh] feature is visible at LF; hearer knowledge has the deontic operator's type.
Equations
- Gutzmann2015.ClauseType.dassVL.moodTypes = {Gutzmann2015.UCType.t.func Gutzmann2015.UCType.u}
- Gutzmann2015.ClauseType.imperative.moodTypes = {Gutzmann2015.UCType.t.func Gutzmann2015.UCType.u}
- Gutzmann2015.ClauseType.v2Declarative.moodTypes = {Gutzmann2015.UCType.t.func Gutzmann2015.UCType.u, (Gutzmann2015.UCType.t.func Gutzmann2015.UCType.u).modifier 1}
- Gutzmann2015.ClauseType.vlInterrogative.moodTypes = {Gutzmann2015.UCType.t.func Gutzmann2015.UCType.u, (Gutzmann2015.UCType.t.func Gutzmann2015.UCType.u).modifier 1}
- Gutzmann2015.ClauseType.v2Interrogative.moodTypes = {Gutzmann2015.UCType.t.func Gutzmann2015.UCType.u, (Gutzmann2015.UCType.t.func Gutzmann2015.UCType.u).modifier 1}
Instances For
(6.108): no derivation over the lexicon of a dass-clause or imperative with wohl and a proposition reaches the epistemic modifier's type, so wohl has nothing to take.
Section 6.5.1: the epistemic modifier's type is derivable from a clause type's mood items together with wohl and a proposition exactly when the clause type has the epistemic modifier.
The wohl rows of sections 6.2.3 and 6.5.1: a sentence with wohl is acceptable exactly when wohl finds the epistemic modifier's type among its clause type's mood items.
Where Durrell excludes a modal particle from a cell, the book's row in that cell is unacceptable.