Citation: Kempson, Ruth and Meyer-Viol, Wilfried and Dibble, Rodger and Gabbay, Dov (1997) Indefinites as Epsilon Terms: A Labelled Deduction Account.
![[img]](https://sas-space.sas.ac.uk/style/images/fileicons/application_pdf.png)
UNSPECIFIED
Abstract
This paper gives an account of indefinites as epsilon terms within a model of utterance processing as a task of labelled deduction, in which partially specified inputs are progressively resolved during the interpretation process. The formal tools used are labelled deduction (Gabbay), the epsilon calculus (Meyer-Viol 1995), and a tree-logic (LOFT - Blackburn & Meyer-Viol 1994) which characterises the structure as it is incrementally built. The system has been partly implemented in SWI-Prolog as part of a longer-term project and the model is a transition system which defines the steps which license movement from state to state.Article
Metadata
| Additional Information: | Citation: In H. Bunt and R. Muskens (eds.), "Computing Meaning Vol 1 : Current Issues in Computational Semantics, (Studies in Linguistics & Philosophy Vol 73)". |
|---|---|
| Creators: | Kempson, Ruth and Meyer-Viol, Wilfried and Dibble, Rodger and Gabbay, Dov and |
| Subjects: | Philosophy |
| Keywords: | Dynamic syntax, Indefinites |
| Divisions: | Institute of Philosophy |
| Collections: | London Philosophy Papers |
| Dates: |
|
| Comments and Suggestions: | Description/Provenance: Submitted by Mark McBride (mark.mcbride@sas.ac.uk) on 2008-01-12T20:44:12Z
No. of bitstreams: 1
R_Kempson_Indefinites.pdf: 248625 bytes, checksum: 46e0e39cded16128bdfe6da7ae4e5ce7 (MD5);
Description/Provenance: Made available in DSpace on 2008-01-12T20:44:12Z (GMT). No. of bitstreams: 1
R_Kempson_Indefinites.pdf: 248625 bytes, checksum: 46e0e39cded16128bdfe6da7ae4e5ce7 (MD5)
Previous issue date: 1997. Date accessioned: 2008-01-12T20:44:12Z; Date available: 2008-01-12T20:44:12Z; Date issued: 1997. |