Sense and the Computation of Reference  

Oleh:

Muskens, Reinhard

Jenis: Article from Journal - ilmiah internasional
Dalam koleksi: Linguistics and Philosophy=> ada di SpringerLink 1997(vol.1) - Mutakhir; JSTOR vol. 28 no. 4 (Aug. 2005), page 473-504.
Fulltext: Vol. 28, No. 4, pp. 473-504.pdf (3.31MB)

Isi artikel

The paper shows how ideas that explain the sense of an expression as a method or algorithm for finding its reference, preshadowed in Frege's dictum that sense is the way in which a referent is given, can be formalized on the basis of the ideas in Thomason (1980). To this end, the function that sends propositions to truth values or sets of possible worlds in Thomason (1980) must be replaced by a relation and the meaning postulates governing the behaviour of this relation must be given in the form of a logic program. The resulting system does not only throw light on the properties of sense and their relation to computation, but also shows circular behaviour if some ingredients of the Liar Paradox are added. The con nection is natural, as algorithms can be inherently circular and the Liar is explained as expressing one of those. Many ideas in the present paper are closely related to those in Moschovakis (1994), but receive a considerably lighter formalization.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali