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

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

A.1 Introduction 179(202)u 1 . . .u nγ 1. . .γ m⊕u ′ 1 . . .u′ kδ 1. . .δ qM,f=u 1 . . .u n u ′ 1 . . .u′ kγ 1. . .γ mδ 1. . .if u ′ 1, ..., u ′ k do not occur <strong>in</strong> any of γ 1 , ..., γ m .δ qM,fIn what follows I will give a <strong>for</strong>mal description of the language used <strong>in</strong> thisthesis, start<strong>in</strong>g with a specification of its types (A.2). For my purposes, I addtwo more types to Muskens’ (1996) <strong>in</strong>ventory: b <strong>for</strong> eventualities and a <strong>for</strong>moments of time. Then <strong>in</strong> section A.3 I specify the models of the language,<strong>in</strong> particular the structure of the doma<strong>in</strong>s of eventualities and times. This isfollowed by the syntax and semantics of the language <strong>in</strong> sections A.4 and A.5,respectively. We will see that although <strong>in</strong> the ma<strong>in</strong> text I have been speak<strong>in</strong>gabout e, e ′ , e 1 ... as variables over eventualities, they are actually names ofvariable registers <strong>for</strong> eventualities. In the same way are t, t ′ , t 1 ... names ofvariable registers <strong>for</strong> times rather than variables over times. Our familiar P’sand Q’s which I have treated as variables over predicates over eventualities andtimes, respectively, will be shown to also have a more complicated type. Anoverview of my conventions is given <strong>in</strong> Table A.1 on page 183. Section A.6 givesthe axioms that ensure that states and variable registers behave as assignmentsand variables, and those that guarantee that constant registers have a fixed<strong>in</strong>habitant. Section A.7 specifies how DRSs can be viewed as abbreviationsof type-logical expressions. Section A.8 gives the truth preserv<strong>in</strong>g syntacticoperations of lambda conversion and renam<strong>in</strong>g of bound variables. In sectionA.9 I work out one example.In this appendix I deviate from the ma<strong>in</strong> text of this thesis by tak<strong>in</strong>g τ tobe a two-place predicate rather than a function. I do this to avoid unnecessarycomplications with function constants. Because I require functionality <strong>for</strong> thispredicate (AX5), τ nevertheless still behaves like a function.A few prelim<strong>in</strong>ary remarks concern<strong>in</strong>g the typography: as be<strong>for</strong>e, I use atypewriter font <strong>for</strong> expressions <strong>in</strong> the <strong>for</strong>mal object language, <strong>Greek</strong> letters asmeta-variables over object-language expressions, 2 calligraphic and italic symbolsto denote set-theoretic entities and boldface symbols to denote types.2 Sometimes, however, I sloppily use the typewritter font <strong>for</strong> expressions <strong>in</strong> the metalanguage.Compare, <strong>for</strong> example, u and δ <strong>in</strong> (202).

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

Saved successfully!

Ooh no, something went wrong!