13.07.2015 Views

Aspect in Ancient Greek - Nijmegen Centre for Semantics

Aspect in Ancient Greek - Nijmegen Centre for Semantics

Aspect in Ancient Greek - Nijmegen Centre for Semantics

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

186 Appendix A: The language of Compositional DRTA.8 ReductionsThe semantics of the language (A.5) ensures a number of equivalences. LetFV be the function that gives the free variables of a well-<strong>for</strong>med expressionand let µ β [ξ α ↦→ν α ] stand <strong>for</strong> the expression that results from replac<strong>in</strong>g <strong>in</strong> µ allfree occurrences of the variable ξ by the expression ν. Then:(i)(ii)λξ α µ β (ν α ) M,f = µ β [ξ α ↦→ν α ] M,f , if FV (λξµ(ν)) = FV (µ[ξ↦→ν])λξ α µ β M,f = λυ α µ β [ξ α ↦→υ α ] M,f , if FV (λξµ) = FV (λυµ[ξ↦→υ]) (idem<strong>for</strong> ∃ or ∀ <strong>in</strong>stead of λ)The syntactic operations correspond<strong>in</strong>g to (i) and (ii) are called lambdaconversion(λ) and renam<strong>in</strong>g bound variables (RBV), respectively.A.9 ExampleLet’s now work out one of the examples (cf. (105)):(206) λQ[tTT ≺ n ⊕Q(t TT)](λPλt[eτ(e) ·⊃ t ⊕P(e)](λe p k<strong>in</strong>ge ))As mentioned, I treat τ as a predicate now, which gives:(207) λQ[tTT ≺ n ⊕Q(t TT)](λPλt[e t ′e τ t ′t ′ ·⊃ t⊕P(e)](λe p k<strong>in</strong>ge))Let’s first treat the parts (208) to (210) separately and then comb<strong>in</strong>e them:(208) λQ[tTT ≺ n ⊕Q(t TT)](209) λPλt[e t ′e τ t ′t ′ ·⊃ t⊕P(e)](210) λe p k<strong>in</strong>geFirst (208):

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!