Article/Publication Details

Anaphora and Restricted Quantification

(Original title: Anafora a obmedzená kvantifikácia)
Filozofia, 2007, vol. 62, No 4, pp. 324-328.
File to download: PDF*
BibTex EndNote Tagged EndNote XML RIS

Document Statistics:

Number of visits: 804
Number of visits today: 0
Last visit: 09.11.2019 - 00:21
PDF downloads: 397

Abstract

The aim of the paper is to analyze different approaches to anaphora with restricted quantifiers. An important point is distinguishing the anaphoric process, which is in fact structured, from the outcomes of that process. Requirements which we put on anaphora (referential dependence and extensional identity of semantic values of antecedent and anaphoric expressions, together with preserving the meaning of analyzed sentences) cannot be met by equipping the classical semantic theories of anaphora (e.g. the analyses of Keenan or Neale). Anaphora is then explained as an algorithmic process in which the semantic value of the anaphoric expression is a higher-order structured function. This function can also be represented as an algorithm consisting of two main sub-algorithms: a calling procedure of picking up the semantic value of a restricted quantifier (also interpreted as a special kind of algorithm) and an execution procedure containing the semantic value already selected. The result is that semantic values/structured functions of anaphoric expressions depend on semantic values of antecedent expressions without violating the principle of preserving the meaning. Given the identity of extensional relevant algorithmic parts, also the extensions of these functions are the same.

*The article is subject to copyright.