A type is conjoinable if it "ends in t" (Definition 4).
Equations
Instances For
Generalized conjunction (Definition 5).
Equations
- Semantics.Montague.Conjunction.genConj Semantics.Montague.Ty.t m = fun (x y : m.interpTy Semantics.Montague.Ty.t) => x && y
- Semantics.Montague.Conjunction.genConj Semantics.Montague.Ty.e m = fun (x x_1 : m.interpTy Semantics.Montague.Ty.e) => x
- Semantics.Montague.Conjunction.genConj Semantics.Montague.Ty.s m = fun (x x_1 : m.interpTy Semantics.Montague.Ty.s) => x
- Semantics.Montague.Conjunction.genConj (a ⇒ τ_1) m = fun (f g : m.interpTy (a ⇒ τ_1)) (x : m.interpTy a) => Semantics.Montague.Conjunction.genConj τ_1 m (f x) (g x)
Instances For
Generalized disjunction.
Equations
- Semantics.Montague.Conjunction.genDisj Semantics.Montague.Ty.t m = fun (x y : m.interpTy Semantics.Montague.Ty.t) => x || y
- Semantics.Montague.Conjunction.genDisj Semantics.Montague.Ty.e m = fun (x x_1 : m.interpTy Semantics.Montague.Ty.e) => x
- Semantics.Montague.Conjunction.genDisj Semantics.Montague.Ty.s m = fun (x x_1 : m.interpTy Semantics.Montague.Ty.s) => x
- Semantics.Montague.Conjunction.genDisj (a ⇒ τ_1) m = fun (f g : m.interpTy (a ⇒ τ_1)) (x : m.interpTy a) => Semantics.Montague.Conjunction.genDisj τ_1 m (f x) (g x)
Instances For
@cite{partee-rooth-1983} Key Facts #
@cite{partee-rooth-1983}
- Fact 6a:
φ ∩ ψ = λz[φ(z) ∩ ψ(z)] - Fact 6b:
[φ ∩ ψ](α) = φ(α) ∩ ψ(α) - Fact 6c:
λv.φ ∩ λv.ψ = λv[φ ∩ ψ]