Citations of:
Sense and the computation of reference
Linguistics and Philosophy 28 (4):473  504 (2004)
Add citations
You must login to add citations.


This essay is divided into two parts. In the first part (§2), I introduce the idea of practical meaning by looking at a certain kind of procedural systems — the motor system — that play a central role in computational explanations of motor behavior. I argue that in order to give a satisfactory account of the content of the representations computed by motor systems (motor commands), we need to appeal to a distinctively practical kind of meaning. Defending the explanatory relevance (...) 

In this paper we examine two approaches to the formal treatment of the notion of problem in the paradigm of algorithmic semantics. Namely, we will explore an approach based on MartinLöf’s Constructive Type Theory, which can be seen as a direct continuation of Kolmogorov’s original calculus of problems, and an approach utilizing Tichý’s Transparent Intensional Logic, which can be viewed as a nonconstructive attempt of interpreting Kolmogorov’s logic of problems. In the last section we propose Kolmogorov and CTTinspired modifications to (...) 

We outline a novel theory of natural language meaning, Rich Situated Semantics [RSS], on which the content of sentential utterances is semantically rich and informationally situated. In virtue of its situatedness, an utterance’s rich situated content varies with the informational situation of the cognitive agent interpreting the utterance. In virtue of its richness, this content contains information beyond the utterance’s lexically encoded information. The agentdependence of rich situated content solves a number of problems in semantics and the philosophy of language (...) 

We formulate a Currytyped logic with finegrained intensionality within Turner’s typed predicate logic. This allows for an elegant presentation of a theory that corresponds to Fox and Lappin’s property theory with curry typing, but without the need for a federation of languages. We then consider how the finegrained intensionality of this theory can be given an operational interpretation. This interpretation suggests itself as expressions in the theory can be viewed as terms in the untyped lambdacalculus, which provides a model of (...) 

In Attitude Problems, I gave an account of opacity in the complement of intensional transitive verbs that combined neoDavidsonian eventsemantics with a hiddenindexical account of substitution failure. In this paper, I extend the account to clausal verbs. 



A hyperintensional semantics for natural language is proposed which is agnostic about the question of whether propositions are sets of worlds or worlds are sets of propositions. Montague’s theory of intensional senses is replaced by a weaker theory, written in standard classical higherorder logic, of finegrained senses which are in a manytoone correspondence with intensions; Montague’s theory can then be recovered from the proposed theory by identifying the type of propositions with the type of sets of worlds and adding an (...) 

The paper develops a prooftheoretic semantics for belief reports by extending the constructive typetheoretical formalism presented in Więckowski with a specific kind of setforming operator suited for the representation of belief attitudes. The extended formalism allows us to interpret constructions which involve, e.g., iteration of belief, quantifying into belief contexts, and anaphora in belief reports. Moreover, constructive solutions to canonical instances of the problem of hyperintensionality are suggested. The paper includes a discussion of Ranta’s constructive account of belief reports. 

In this paper we propose a way to deal with natural language inference by implementing Modern Type Theoretical Semantics in the proof assistant Coq. The paper is a first attempt to deal with NLI and natural language reasoning in general by using the proof assistant technology. Valid NLIs are treated as theorems and as such the adequacy of our account is tested by trying to prove them. We use Luo’s Modern Type Theory with coercive subtyping as the formal language into (...) 

In Transparent Intensional Logic we can recognize two distinct notions of computation that loosely correspond to term rewriting and term interpretation as known from lambda calculus. Our goal will be to further explore these two notions and examine some of their properties. 

Aim of the paper is to present a new logic of technical malfunction. The need for this logic is motivated by a simplesounding philosophical question: Is a malfunctioning corkscrew, which fails to uncork bottles, nonetheless a corkscrew? Or in general terms, is a malfunctioning F, which fails to do what Fs do, nonetheless an F? We argue that ‘malfunctioning’ denotes the modifier Malfunctioning rather than a property, and that the answer depends on whether Malfunctioning is subsective or privative. If subsective, (...) 

ABSTRACTWe represent the world in a variety of ways: through percepts, concepts, propositional attitudes, words, numerals, recordings, musical scores, photographs, diagrams, mimetic paintings, etc. Some of these representations are mental. It is customary for philosophers to distinguish two main kinds of mental representations: perceptual representation and conceptual representation. This essay presupposes a version of this dichotomy and explores the way in which a further kind of representation – procedural representation – represents. It is argued that, in some important respects, procedural (...) 