Quine and Davidson employ proxy functions to demonstrate that the use of language (behaviouristically conceived) is compatible with indefinitely many radically different reference relations. They also believe that the use of language (behaviouristically conceived) is all that determines reference. From this they infer that reference is indeterminate, i.e. that there are no facts of the matter as to what singular terms designate and what predicates apply to. Yet referential indeterminacy yields rather dire consequences. One thus does wonder whether one can (...) hold on to a Quine--Davidson stance in semantics-cum-metaphysics and still avoid embracing referential indeterminacy. I argue that one can. Anyone adhering to the behaviouristic account pivotal to the Quine--Davidson stance is bound to acknowledge certain facts about verbal behaviour -- that some utterances are tied to situations, that some utterances are tied to segments in situations, that some predicates have non-contextualised conditions of application, and that use involves causal dependencies. The restrictions from these facts ensure that only reference relations generated by means of rather exceptional proxy functions are compatible with verbal behaviour. I conclude that this allows one to rebuff the Quine--Davidson argument for the indeterminacy of reference, as it were, from within. I moreover tentatively conclude that the line of thought laid out provides good reason for just about anyone to hold that there are facts about reference after all. (shrink)

I propose a comprehensive account of negation as a modal operator, vindicating a moderate logical pluralism. Negation is taken as a quantifier on worlds, restricted by an accessibility relation encoding the basic concept of compatibility. This latter captures the core meaning of the operator. While some candidate negations are then ruled out as violating plausible constraints on compatibility, different specifications of the notion of world support different logical conducts for negations. The approach unifies in a philosophically motivated picture the following (...) results: nothing can be called a negation properly if it does not satisfy Contraposition and Double Negation Introduction; the pair consisting of two split or Galois negations encodes a distinction without a difference; some paraconsistent negations also fail to count as real negations, but others may; intuitionistic negation qualifies as real negation, and classical Boolean negation does as well, to the extent that constructivist and paraconsistent doubts on it do not turn on the basic concept of compatibility but rather on the interpretation of worlds. (shrink)

Quotation has been much studied in philosophy. Given that quotation allows one to diagonalize out of any grammar, there have been comparatively few attempts within the linguistic literature to develop an account within a formal linguistic theory. Nonetheless, given the ubiquity of quotation in natural language, linguists need to explicate the formal mechanisms it employs. The central claim of this paper is that once one assumes a dialogical perspective on language such as provided by the KoS (KoS is not an (...) acronym, despite emphasizing a Konversationally Oriented Semantics) framework, formalized in a rich type theory like Type Theory with Records, much of the mystery evaporates. In particular, one can utilize as denotations for quotative constructions entities that are independently motivated for dialogue processing—utterance types and locutionary propositions, Austinian propositions about speech events. (shrink)

This article makes a number of points about reference, both speaker reference and linguistic reference. The bottom line is simple: reference ain't easy — at least not nearly as easy as commonly supposed. Much of what speakers do that passes for reference is really something else, and much of what passes for linguistic reference is really nothing more than speaker reference. Referring is one of the basic things we do with words, and it would be a good idea to understand (...) what that involves and requires before worrying about the linguistic means by which this is done. (shrink)

This paper offers a unified, quantificational treatment of incomplete descriptions like ‘the table’. An incomplete quantified expression like ‘every bottle’ (as in “Every bottle is empty”) can feature in true utterances despite the fact that the world contains nonempty bottles. Positing a contextual restriction on the bottles being talked about is a straightforward solution. It is argued that the same strategy can be extended to incomplete definite descriptions across the board. ncorporating the contextual restrictions into semantics involves meeting a complex (...) array of desiderata, yet the apparently simpler pragmatic alternative faces severe problems and is therefore a nonstarter. (shrink)

This article proposes a theoretical framework for external representation based problem solving. The Tic‐Tac‐Toe and its isomorphs are used to illustrate the procedures of the framework as a methodology and test the predictions of the framework as a functional model. Experimental results show that the behavior in the Tic‐Tac‐Toe is determined by the directly available information in external and internal representations in terms of perceptual and cognitive biases, regardless of whether the biases are consistent with, inconsistent with, or irrelevant to (...) the task. It is shown that external representations are not merely inputs and stimuli to the internal mind and that they have much more important functions than mere memory aids. A representational determinism is suggested—the form of a representation determines what information can be perceived, what processes can be activated, and what structures can be discovered from the specific representation. (shrink)

This paper surveys important work done in relevant logic in the past 10 years.

Formal semantics is an approach to SEMANTICS1, the study of meaning, with roots in logic, the philosophy of language, and linguistics, and since the 1980’s a core area of linguistic theory. Characteristics of formal semantics to be treated in this article include the following: Formal semanticists treat meaning as mind-independent (though abstract), contrasting with the view of meanings as concepts “in the head” (see I-LANGUAGE AND E-LANGUAGE and MEANING EXTERNALISM AND INTERNALISM); formal semanticists distinguish semantics from knowledge of semantics (Lewis (...) 1975, Cresswell 1978), which has consequences for the notion of semantic COMPETENCE. A central part of the meaning of a sentence on this approach is its TRUTH CONDITIONS, and most although not all formal semantics is model-theoretic, relating linguistic expressions to model-theoretically constructed semantic values cast in terms of truth, REFERENCE, and possible worlds. This sets formal semantics apart from approaches which view semantics as relating a sentence just to a representation on another linguistic “level” (LOGICAL FORM) or a representation in an innate LANGUAGE OF THOUGHT. The formal semanticist could accept such representations as an aspect of semantics but would insist on asking what the model-theoretic semantic interpretation of the given representationlanguage is (Lewis 1970). Formal semantics is centrally concerned with COMPOSITIONALITY at the SYNTAX-SEMANTICS INTERFACE, how the meanings of larger constituents are built up from the meanings of their parts on the basis of their syntactic structure, and with the relation between compositional SENTENCE MEANING and meaning in discourse. (shrink)

The philosophy of information (PI) is a new area of research with its own field of investigation and methodology. This article, based on the Herbert A. Simon Lecture of Computing and Philosophy I gave at Carnegie Mellon University in 2001, analyses the eighteen principal open problems in PI. Section 1 introduces the analysis by outlining Herbert Simon's approach to PI. Section 2 discusses some methodological considerations about what counts as a good philosophical problem. The discussion centers on Hilbert's famous analysis (...) of the central problems in mathematics. The rest of the article is devoted to the eighteen problems. These are organized into five sections: problems in the analysis of the concept of information, in semantics, in the study of intelligence, in the relation between information and nature, and in the investigation of values. (shrink)

A distinction is drawn between situations as indices required for semantically evaluating sentences and situations as denotations resulting from such evaluation. For atomic sentences, possible worlds may serve as indices, and events as denotations. The distinction is extended beyond atomic sentences according to formulae-as-types and applied to implicit quantifier domain restrictions, intensionality and conditionals.

In this paper we consider the theory of predicate logics in which the principle of Bivalence or the principle of Non-Contradiction or both fail. Such logics are partial or paraconsistent or both. We consider sequent calculi for these logics and prove Model Existence. For L4, the most general logic under consideration, we also prove a version of the Craig-Lyndon Interpolation Theorem. The paper shows that many techniques used for classical predicate logic generalise to partial and paraconsistent logics once the right (...) set-up is chosen. Our logic L4 has a semantics that also underlies Belnap’s [4] and is related to the logic of bilattices. L4 is in focus most of the time, but it is also shown how results obtained for L4 can be transferred to several variants. (shrink)

Stojnić et al. (2013, 2017) argue that the reference of demonstratives is fixed without any contribution from the extra-linguistic context. On their `prominence/coherence' theory, the reference of a demonstrative expression depends only on its context-independent linguistic meaning. Here, we argue that Stojnić et al.’s striking claims can be maintained in only the thinnest technical sense. Instead of eliminating appeals to the extra-linguistic context, we show how the prominence/coherence theory merely suppresses them. Then we ask why one might be tempted to (...) try and offer such a view. Since we are rather sympathetic to the motivations we find, we close by sketching a more plausible alternative. (shrink)

This paper contains an argument to the effect that possible worlds semantics renders semantic knowledge impossible, no matter what ontological interpretation is given to possible worlds. The essential contention made is that possible worlds semantic knowledge is unsafe and this is shown by a parallel with the preface paradox.

I provide an analysis of sentences of the form ‘To be F is to be G’ in terms of exact truth-maker semantics—an approach that identifies the meanings of sentences with the states of the world directly responsible for their truth-values. Roughly, I argue that these sentences hold just in case that which makes something F is that which makes it G. This approach is hyperintensional, and possesses desirable logical and modal features. These sentences are reflexive, transitive and symmetric, and, if (...) they are true, then they are necessarily true, and it is necessary that all and only Fs are Gs. I close by defining an asymmetric and irreflexive notion of analysis in terms of the reflexive and symmetric one. (shrink)

The main chapters of this thesis develop and defend a version of two-dimensional semantics that provides an account of Kripkean a posteriori necessity.

Semantics in the Montagovian tradition combines two basic tenets. One tenet is that the semantic value of a sentence is an intension, a function from points of evaluations into truth-values. The other tenet is that the semantic value of a composite expression is the result of applying the function denoted by one component to arguments denoted by the other components. Many philosophers object to intensional semantics on the grounds that intensionally equivalent sentences do not substitute salva veritate into attitude ascriptions. (...) They propose instead that the semantic values of sentences must be structured propositions. In rejecting intensional semantics, philosophers who endorse structured propositions also usually reject functional compositionality, undermining both tenets of the Montagovian programme. I defend a semantic theory that incorporates both structured propositions and functional compositionality. I argue that this semantic theory can preserve many explanatory benefits of Montague semantics. Finally, I show how treating composition functional application can resolve core problems internal to a theory of structured propositions. (shrink)

The meanings of donkey sentences cannot be captured using a procedure which, like Montague’s, uses the existential quantifiers of classical logic to translate indefinites and the variables to translate pronouns. The treatment of these examples requires meanings which depend on the context in which sentences appear, and thus necessitates a logic which models this context to some extent. If context is represented as the information conveyed in discourse, and the meanings of pronouns are enriched to depend on this information, the (...) result is the E-Type approach (ETA) adapted by Heim (1990) from proposals in Evans (1980) and Cooper (1979). If the context is represented as a list of potential referents, and the meanings of indefinites are enriched to introduce new referents into this list, the result is a compositional formulation like Groenendijk and Stokhof’s (1990) of the discourse representation theory (DRT) of Kamp (1981) and Heim (1982). Either tack suffices to capture the way in which the referents of he and it systematically correspond to the alternative possibilities described by the antecedent. Disjunction offers a parallel way of introducing alternatives in the antecedent of a conditional, as shown in (2). (shrink)

In this paper I argue that the self-referential component which Searle rightly detects in the truth-conditions of perceptual judgments comes from the perceptual ‘mode' and is not an aspect of the ‘content' of the judgment, contrary to Searle's claim.

According to the computational theory of mind , to think is to compute. But what is meant by the word 'compute'? The generally given answer is this: Every case of computing is a case of manipulating symbols, but not vice versa - a manipulation of symbols must be driven exclusively by the formal properties of those symbols if it is qualify as a computation. In this paper, I will present the following argument. Words like 'form' and 'formal' are ambiguous, as (...) they can refer to form in either the syntactic or the morphological sense. CTM fails on each disambiguation, and the arguments for CTM immediately cease to be compelling once we register that ambiguity. The terms 'mechanical' and 'automatic' are comparably ambiguous. Once these ambiguities are exposed, it turns out that there is no possibility of mechanizing thought, even if we confine ourselves to domains where all problems can be settled through decision-procedures. The impossibility of mechanizing thought thus has nothing to do with recherché mathematical theorems, such as those proven by Gödel and Rosser. A related point is that CTM involves, and is guilty of reinforcing, a misunderstanding of the concept of an algorithm. (shrink)

In this paper, we present a new semantic framework designed to capture a distinctly cognitive or epistemic notion of meaning akin to Fregean senses. Traditional Carnapian intensions are too coarse-grained for this purpose: they fail to draw semantic distinctions between sentences that, from a Fregean perspective, differ in meaning. This has led some philosophers to introduce more fine-grained hyperintensions that allow us to draw semantic distinctions among co-intensional sentences. But the hyperintensional strategy has a flip-side: it risks drawing semantic distinctions (...) between sentences that, from a Fregean perspective, do not differ in meaning. This is what we call the ‘new problem’ of hyperintensionality to distinguish it from the ‘old problem’ that faced the intensional theory. We show that our semantic framework offers a joint solution to both these problems by virtue of satisfying a version of Frege’s so-called ‘equipollence principle’ for sense individuation. Frege’s principle, we argue, not only captures the semantic intuitions that give rise to the old and the new problem of hyperintensionality, but also points the way to an independently motivated solution to both problems. (shrink)

Relations computed by finite-state transducers are applied to interpret temporal propositions in terms of strings representing finite contexts or situations. Carnap–Montague intensions mapping indices to extensions are reformulated as relations between strings that can serve as indices and extensions alike. Strings are related according to information content, temporal span and granularity, the bounds on which reflect the partiality of natural language statements. That partiality shapes not only strings-as-extensions (indicating what statements are about) but also strings-as-indices (underlying truth conditions).

About twenty-five years ago, Charles Parsons published a paper that began by asking why we still discuss the Liar Paradox. Today, the question seems all the more apt. In the ensuing years we have seen not only Parsons’ work (1974), but seminal work of Saul Kripke (1975), and a huge number of other important papers. Too many to list. Surely, one of them must have solved it! In a way, most of them have. Most papers on the Liar Paradox offer (...) some explanation of the behavior of paradoxical sentences, and most also offer some extension for the predicate ‘true’ that they think is adequate, at least in some restricted setting. But if this is a solution, then the problem we face is far from a lack of solutions; rather, we have an overabundance of conflicting ones. Kripke’s work alone provides us with uncountably many different extensions for the truth predicate. Even if it so happens that one of these is a conclusive solution, we do not seem to know which one, or why. We should also ask, given that we are faced with many technically elegant but contradictory views, if they are really all addressing the same problem. What we lack is not solutions, but a way to compare and evaluate the many ones we have. (shrink)

This dissertation investigates the ways in which natural language restricts the domains of quantifiers. Adverbs of quantification are analyzed as quantifying over situations. The domain of quantifiers is pragmatically constrained: apparent processes of "semantic partition" are treated as pragmatic epiphenomena. The introductory Chapter 1 sketches some of the background of work on natural language quantification and begins the analysis of adverbial quantification over situations. Chapter 2 develops the central picture of "semantic partition" as a side-effect of pragmatic processes of anaphora (...) resolution. I argue that the apparent effects of topic/focus articulation and presuppositional information on the interpretation of quantifiers are not the result of a direct and local mechanism of sentence grammar. Instead, I develop an analysis where the link is established via the anaphoric dependence of quantifier domains on the discourse context. Chapter 3 discusses the analysis of conditional clauses as quantifier restrictors, concentrating on the question whether conditional clauses restrict quantifiers directly or indirectly. A treatment is explored which has if-clauses constrain the value of the hidden domain variable of the restricted quantifier. Chapter 4, on unless-clauses, and Chapter 5, on only if- and even if-clauses, present some issues in the compositional analysis of complex conditional clauses. These chapters significantly expand the data coverage of the theory of A-quantification. Building on previous work of mine on exceptives, I analyze unless-clauses as exceptive operators on A-quantifiers. The analysis of only if-clauses, treated as conditional clauses that combine if with the focus adverb only, unearthes some interesting new properties. Chapter 6, finally, examines the phenomenon of donkey-anaphora in the light of the results of the previous chapters. I show that a solution to the proportion problem may become possible once we combine the situation-semantic approach to adverbial quantification with the pragmatic theory developed in Chapter 2 and further elaborated in the analysis of donkey anaphora in complex conditionals. (shrink)

Proper names seem simple on the surface. Indeed, anyone unfamiliar with philosophical debates about them might wonder what the fuss could possibly be about. It seems obvious why we need them and what we do with them, and that is to talk about particular persons, places, and things. You don't have to be as smart as Mill to think that proper names are simply tags attached to individuals. But sometimes appearances are deceiving.

Two main methods for analysing de re readings of definite descriptions in intensional contexts coexist: that of evaluating the description in the actual world, whether by means of scope, actuality operators, or non-local world binding, and that of substituting another description, usually one expressing a salient or ‘vivid’ acquaintance relation to an attitude holder, prior to evaluation. Recent work on so-called descriptive indexicals suggests that contrary to common assumptions, both methods are needed, for different ends. This paper aims to show (...) that there is indeed a division of labour between the two methods of analysis and to identify criteria for choosing among alternative ways to model the second, substitutional method. (shrink)

This paper revisits the question of whether propositions in situation semantics must be persistent [Kratzer (1989). Linguistics and Philosophy, 12, 607–653]. It shows that ignoring persistence causes empirical problems for theories which use quantification over minimal situations as a solution for donkey anaphora [Elbourne (2005). Situations and individuals. Cambridge, Mass.: MIT Press]. At the same time, modifying these theories to incorporate persistence makes them incompatible with the use of situations for contextual restriction [Kratzer (2004). Ms., University of Massachusetts].

Situations serving as partial worlds as well as events in natural language semantics are constructed from a type-theoretic interpretation of firstorder formulae and (after a type reduction) temporal formulae. Limitations of the Russell-Wiener-Kamp derivation of time from events are discussed and overcome to give a more widely applicable account of temporal granularity. Finite situations are formulated as strings of observations, conceptualized to persist inertially (in the absence of forces).

One of the most promising aspects of Perry 's Reflexive-Referential Theory is its capacity to generate a variety of contents that may be associated with a single utterance, contents that may be used for various explanatory purposes. My concern in this paper is that, as it stands, RRT generates too many contents. The problem is not just that most of those contents will be explanatorily idle, but rather, that nothing in the actual RRT explains why those contents cannot play the (...) roles that their minimally different “neighbors” can play. In Section 1, I discuss two kinds of example that motivate RRT and its multiplicity of contents; the first comes close enough to some of Perry's own examples, but the second is original, and may be therefore viewed as an application of RRT to a problem that has not been discussed by Perry himself. In Section 2, I will show how these examples give rise, in turn, to problems of overgeneration. In other words, just as RRT is able to derive contents that may be used to account for the cases that need explanation, it ought to be able to derive analogous contents that, in turn, give counterintuitive, if not outright wrong predictions. In Section 3, I will tentatively outline a line of response that Perry could take. The overall direction of the paper is thus optimistic, since the problems raised may be viewed as pointing to ways of improving RRT, rather than undermining it. (shrink)

cal practice: the enterprise of specifying information about the world for use in computer systems. Knowledge representation as a field also encompasses conceptual results that call practitioners’ attention to important truths about the world, mathematical results that allow practitioners to make these truths precise, and computational results that put these truths to work. This chapter surveys this practice and its results, as it applies to the interpretation of natural language utterances in implemented natural language processing systems. For a broader perspective (...) on such technical practice, in all its strengths and weaknesses, see (Agre 1997). Knowledge representation offers a powerful general tool for the science of language. Computational logic, a prototypical formalism for representing knowledge about the world, is also the model for the level of logical form that linguists use to characterize the grammar of meaning (Larson and Segal 1995). And researchers from (Schank and Abelson 1977) to (Shieber 1993) and (Bos to appear) have relied crucially on such representations, and the inference methods associated with them, in articulating accounts of semantic relations in language, such as synonymy, entailment, informativeness and contradiction. The new textbooks (Blackburn and Bos 2002a, Blackburn and Bos 2002b) provide an excellent grounding in this research, and demonstrate how deeply computational ideas from knowledge representation can inform pure linguistic study. In this short chapter, I must leave much of.. (shrink)

Despite its strengths, Leech et al.'s model fails to address the important benefits that derive from self-explanation and task feedback in analogical reasoning development. These components encourage explicit, self-reflective processes that do not necessarily link to knowledge accretion. We wonder, therefore, what mechanisms can be included within a connectionist framework to model self-reflective involvement and its beneficial consequences.

Leech et al.'s model proposes representing relations as primed transformations rather than as structured representations (explicit representations of relations and their roles dynamically bound to fillers). However, this renders the model unable to explain several developmental trends (including relational integration and all changes not attributable to growth in relational knowledge). We suggest looking to an alternative computational model that learns structured representations from examples.

Ontology is the study of what there is, what kinds of things make up reality. Ontology seems to be a very difficult, rather speculative discipline. However, it is trivial to conclude that there are properties, propositions and numbers, starting from only necessarily true or analytic premises. This gives rise to a puzzle about how hard ontological questions are, and relates to a puzzle about how important they are. And it produces the ontologyobjectivity dilemma: either (certain) ontological questions can be trivially (...) answered using only uncontroversial premises, or the uncertainties of ontology are really a threat to the truth of basically everything we say or believe. The main aim of this dissertation is to resolve these puzzles and to shed some light on the discipline of ontology. I defend a view inspired by Carnap’s internal-external distinction about what there is, but one according to which both internal and external questions are fully factual and meaningful. In particular, I argue that the trivial arguments are valid, but they do not answer any ontological questions. Furthermore, I propose an account of the function of our talk about properties, propositions and natural numbers. According to this account our talk about them has no ontological presuppositions for its literal and objective truth. This avoids the ontology-objectivity dilemma, and solves the puzzles about ontology. To do this I look at quantification and noun phrases in general, and at their relation to ontology. I argue that quantifiers are semantically underspecified in a certain respect, and play two different roles in communication. I discuss the relation between syntactic form and information structure, the function of certain non-referential, non-quantificational noun phrases, the uses of bare number determiners, and how arithmetic truths are learned and taught. The more metaphysical issues discussed include: inexpressible properties, logicism about arithmetic, nominalism, Carnap’s view about ontology, the problem of universals, the relationship between ontology and objectivity, different projects within ontology, non-existent.... (shrink)

A formula is (materially) valid iff all its instances are true sentences; and an axiomatic system is called (materially) sound and complete iff it proves all and only valid formulas. These are 'natural' concepts of validity and completeness, which were, however, in the course of the history of modern logic, stealthily replaced by their formal descendants: formal validity and completeness. A formula is formally valid iff it is true under all interpretations in all universes; and an axiomatic system is called (...) formally sound and complete iff it proves all and only formulas valid in this sense. Though the step from material to formal validity and completeness may seem to be merely an unproblematic case of explication, I argue that it is not; and that mistaking the latter concepts for the former ones may lead to serious conceptual confusions. (shrink)