Docs / Semantics / ArgumentStructure / Control

Control and raising

import Linglib.Semantics.ArgumentStructure.Control · namespace ArgumentStructure

On the analysis of Montague, Bach, Dowty and Chierchia the complement of try, persuade or seem denotes a property, and the predicate denotes a relation R : (E → Φ) → X → Ψ between a property and its other arguments X, with Φ the propositions. What is called control and raising are then two answers to how much of the property the relation reads. Given the argument c : X → E the property is understood of, the relation is raising at c when it reads only the proposition P (c x), and controlled at c when it reads that proposition and the arguments x. A raising relation is controlled, and a controlled one is exactly a relation to a proposition with the property applied to c x, so an analysis on which the complement denotes a proposition describes the controlled relations and no others. A raising relation entails nothing about c x that it does not entail of everything: the argument is not a semantic argument of the relation, as no participant of a raising verb fills the slot it raises into (Diathesis.IsRaising).

A controlled relation reads the property at the argument itself. In Landau's two-tiered theory that is one of two ways control is established, predication, found under predicates that introduce no attitude. Under an attitude predicate the complement is read at a coordinate of the reported context, its author or addressee, as the holder of the attitude represents it: the relation is logophoric at a concept c of centers when it reads the property only through the centers whose value under c has it, which is a relation to a proposition, the one self-ascribed. Self-ascription over a set of alternatives is logophoric, and it is controlled at an argument when the concept takes that argument as its value throughout the alternatives, so that the two readings come apart only where the holder may mistake who the coordinate is.

Implementation notes

IsRaisingAt and IsControlledAt are predicates on the bare relation, as Monotone is on a function, and a relation that reads the whole property satisfies neither. Being controlled is Function.FactorsThrough evaluation at c x, for each x. The argument c is any function of the other arguments, the bearer of a thematic role in Chierchia's sense; the participant in a slot is the case of a projection. Equality in Φ is logical equivalence when propositions are sets of worlds.

References

Declarations

L67–71
L73–76
L81–83

A relation is controlled at c exactly when it is a relation to a proposition, taken at the proposition the property forms with c x.

theorem isControlledAt_iffL85–90
{E : Type u_1} {Φ : Type u_2} {Ψ : Type u_3} {X : Type u_4} {R : (E → Φ) → X → Ψ} {c : X → E} :
IsControlledAt R c ↔ ∃ (R' : Φ → X → Ψ), ∀ (P : E → Φ) (x : X), R P x = R' (P (c x)) x

Built from

L93–99
L101–105
L107–109

What a raising relation entails of the argument it is raising at, it entails of every entity some argument takes there: its meaning does not depend on that argument as such.

theorem IsRaisingAt.le_of_leL111–115
{E : Type u_1} {Φ : Type u_2} {Ψ : Type u_3} {X : Type u_4} {R : (E → Φ) → X → Ψ} {c : X → E} [LE Ψ] (h : IsRaisingAt R c) {α : E → Ψ} (hα : ∀ (P : E → Φ) (x : X), R P x ≤ α (c x)) (P : E → Φ) (x y : X) :
R P x ≤ α (c y)

Built from

Logophoric control

L125–128

A relation is logophoric at c exactly when it is a relation to a proposition, taken at the centers whose value under c has the property.

theorem isLogophoricAt_iffL130–135
{Ψ : Type u_3} {X : Type u_4} {α : Type u_6} {C : Type u_7} {R : (α → Set C) → X → Ψ} {c : C → α} :
IsLogophoricAt R c ↔ ∃ (A : Set C → X → Ψ), ∀ (P : α → Set C) (x : X), R P x = A (Acquaintance.deRe (Part.some ∘ c) P) x

Built from

Self-ascription is controlled at an argument when the concept takes that argument as its value at every alternative: the reading at the coordinate and the reading at the argument agree where the coordinate is not mistaken.

theorem isControlledAt_subset_deReL143–152
{X : Type u_4} {α : Type u_6} {C : Type u_7} {c : C → α} {A : X → Set C} {ctrl : X → α} (h : ∀ (x : X), ∀ q ∈ A x, c q = ctrl x) :
IsControlledAt (fun (P : α → Set C) (x : X) => A x ⊆ Acquaintance.deRe (Part.some ∘ c) P) ctrl

Built from