182 Appendix A: The language of Compositional DRTA.4 SyntaxThe set of well-<strong>for</strong>med expressions, Exp:(i)(ii)Basic expressions (of a certa<strong>in</strong> type):a. Con α is the (possibly empty) set of constants of type αb. V ar α is the (<strong>in</strong>f<strong>in</strong>ite) set of variables of type αc. Exp α ⊇ Con α ∪ V ar αComplex expressions:a. If µ, ν ∈ Exp t and ξ ∈ V ar, then ¬µ, [µ∧ν], [µ∨ν], [µ → ν], ∃ξµ, ∀ξµ∈ Exp tb. If µ, ν ∈ Exp α , then [µ = ν] ∈ Exp tc. If µ ∈ Exp α , ν ∈ Exp 〈α,β〉 , then [ν(µ)] ∈ Exp βd. If µ ∈ Exp α , ξ ∈ V ar β , then λξµ ∈ Exp 〈β,α〉(204) Con = ⋃ α Con α, V ar = ⋃ α V ar α, Exp = ⋃ α Exp αI omit superfluous brackets.The constants and variables that I use are given <strong>in</strong> Table A.1. w <strong>in</strong> thistable is a fixed non-logical constant of type 〈r, 〈s,e〉〉. w(v)(i) stands <strong>for</strong> ‘thevalue of register v <strong>in</strong> a state i’.A.5 <strong>Semantics</strong>Semantic values of arbitrary expressions are given relative to an assignmentfunction f that maps variables on objects from the doma<strong>in</strong>: f : V ar → Dwith <strong>for</strong> each ξ ∈ V ar α , f(ξ) ∈ D α .Interpretation is def<strong>in</strong>ed as follows:(205) a. Basic expressions:(i) If µ ∈ Con, then µ M,f = I(µ)(ii) If ξ ∈ V ar, then ξ M,f = f(ξ)b. Complex expressions:(i) ¬µ M,f = 1 iff µ M,f = 0(ii) µ ∧ ν M,f = 1 iff µ M,f = ν M,f = 1(iii) µ ∨ ν M,f = 1 iff µ M,f = 1 or ν M,f = 1(iv) µ → ν M,f = 0 iff µ M,f = 1 and ν M,f = 0(v) ∃ξµ α M,f = 1 iff there is a d ∈ D α s.t. µ M,f[ξ/d] = 1(vi) ∀ξµ α M,f = 1 iff <strong>for</strong> all d ∈ D α µ M,f[ξ/d] = 1(vii) α = β M,f = 1 iff α f = β M,f(viii) β(α) M,f = β M,f (α M,f )(ix) λξ α µ β M,f is the function h : D α → D β s.t. <strong>for</strong> all d ∈ D α ,h(d) = µ M,f[ξ/d]
A.5 <strong>Semantics</strong> 183type name of objects variables constantse entity x 1 , x 2 , –...b eventualities b 1 , b 2 , –...a times a 1 , a 2 –〈a,t〉 sets of times a 1 , a 2 , a TT , a n...r register v 1 , v 2 , u 1 , u 2 , ......r bregister over type b objectcourse– unspecific dis-referents:r 〈a,t〉register over type 〈a,t〉objectse 1 , e 2 , ...– unspecific discoursereferents:t 1 , t 2 , ...specificdiscourse referents:t TT , n,...s state i, j, –...〈b,t〉 static one-place predicate– x cry, p k<strong>in</strong>g ...over eventualities〈〈a,t〉, 〈〈a,t〉,t〉〉 static two-place predicate– ⊂, ≺ ...over times〈b, 〈b,t〉〉 static two-place predicate– ⊏, ...over eventualities〈b, 〈a,t〉〉 static two-place predicateover one eventualityand one time– τ, ...〈r b , 〈s, 〈s,t〉〉〉 dynamic one-placepredicate over eventualitiesP, P ′ ,...〈r 〈a,t〉 , 〈s, 〈s,t〉〉〉 dynamic one-place Q, Q ′ , –predicate over times ...〈r, 〈s,e〉〉 – wTable A.1: Variables and constants of various types–f[ξ/d] is the assignment function that assigns d to ξ and assigns the samevalues as f to all the other variables.