Find counter arguments by entering NameVs… or …VsName.
| Disputed term/author/ism | Author Vs Author |
Entry |
Reference |
|---|---|---|---|
| Cresswell, M.J. | Stechow Vs Cresswell, M.J. | I 154 Lambda-Operator/λ-Operator/Stechow: the language used here corresponds pretty much to the λ categorial of Cresswell 1973. Only difference: Cresswell: does not differentiate between syntactic categories and types. The type symbols act at the same time as category symbols. StechowVsCresswell: this is impractical, because different categories can have the same type. For example intransitive verbs as well as nomina are of type ep. Here: we choose a language with meaning*types, so e, p etc. Lambda-Operator/Semantics/Linguistics/Stechow: interprets the motion index. Thus the logical properties of the operator are transferred to the interpretation of the movement. Movement: (on LF) creates a lambda operator that binds its track and thus all the same variables (pronouns) that it commands c. 1. Interpretation: of a closed expression does not depend on the choice of a certain occupancy. This is a consequence of the so-called Def Coincidence Lemma: this means that two expressions, which differ only by free variables, can be interpreted in the same way by suitable assignments. 2. The syntax of the λ language contains the principle of the Def λ conversion, which is our function conversion. The principle says that you can break down a λ operator if you use an expression of the variable type for the variables bound by the operator. This follows from the >transition lemma. (>binding). 3. Bound Renaming/Stechow: if two expressions differ only in the choice of their bound variables, they mean the same thing. ^These are the alphabetical variants. |
A. von Stechow I Arnim von Stechow Schritte zur Satzsemantik www.sfs.uniï·"tuebingen.de/~astechow/Aufsaetze/Schritte.pdf (26.06.2006) |
| |||