Number words seemingly function both as adjectives attributing cardinality properties to collections, as in Frege’s ‘Jupiter has four moons’, and as names referring to numbers, as in Frege’s ‘The number of Jupiter’s moons is four’. This leads to what Thomas Hofweber calls Frege’s Other Puzzle: How can number words function as modifiers and as singular terms if neither adjectives nor names can serve multiple semantic functions? Whereas most philosophers deny that one of these uses is genuine, we instead argue that (...) number words, like many related expressions, are polymorphic, having multiple uses whose meanings are systematically related via type shifting. (shrink)

In this paper, we outline and critically evaluate Thomas Hofweber’s solution to a semantic puzzle he calls Frege’s Other Puzzle. After sketching the Puzzle and two traditional responses to it—the Substantival Strategy and the Adjectival Strategy—we outline Hofweber’s proposed version of Adjectivalism. We argue that two key components—the syntactic and semantic components—of Hofweber’s analysis both suffer from serious empirical difficulties. Ultimately, this suggests that an altogether different solution to Frege’s Other Puzzle is required.

SNePS, the Semantic Network Processing System 45, 54], has been designed to be a system for representing the beliefs of a natural-language-using intelligent system (a \cognitive agent"). It has always been the intention that a SNePS-based \knowledge base" would ultimatelybe built, not by a programmeror knowledge engineer entering representations of knowledge in some formallanguage or data entry system, but by a human informing it using a natural language (NL) (generally supposed to be English), or by the system reading books or (...) articles that had been prepared for human readers. Because of this motivation, the criteria for the development of SNePS have included: it should be able to represent anything and everything expressible in NL; it should be able to represent generic, as well as speci c information; it should be able to use the generic and the speci c information to reason and infer information implied by what it has been told; it cannot count on any particular order among the pieces of information it is given; it must continue to act reasonably even if the information it is given includes circular de nitions, recursive rules, and inconsistent information. (shrink)

Cognitive agents, whether human or computer, that engage in natural-language discourse and that have beliefs about the beliefs of other cognitive agents must be able to represent objects the way they believe them to be and the way they believe others believe them to be. They must be able to represent other cognitive agents both as objects of beliefs and as agents of beliefs. They must be able to represent their own beliefs, and they must be able to represent beliefs (...) as objects of beliefs. These requirements raise questions about the number of tokens of the belief representation language needed to represent believers and propositions in their normal roles and in their roles as objects of beliefs. In this paper, we explicate the relations among nodes, mental tokens, concepts, actual objects, concepts in the belief spaces of an agent and the agent's model of other agents, concepts of other cognitive agents, and propositions. We extend, deepen, and clarify our theory of intensional knowledge representation for natural-language processing, as presented in previous papers and in light of objections raised by others. The essential claim is that tokens in a knowledge-representation system represent only intensions and not extensions. We are pursuing this investigation by building CASSIE, a computer model of a cognitive agent and, to the extent she works, a cognitive agent herself. CASSIE's mind is implemented in the SNePS knowledge-representation and reasoning system. (shrink)

We present a computational analysis of de re, de dicto, and de se belief and knowledge reports. Our analysis solves a problem first observed by Hector-Neri Castañeda, namely, that the simple rule -/- `(A knows that P) implies P' -/- apparently does not hold if P contains a quasi-indexical. We present a single rule, in the context of a knowledge-representation and reasoning system, that holds for all P, including those containing quasi-indexicals. In so doing, we explore the difference between reasoning (...) in a public communication language and in a knowledge-representation language, we demonstrate the importance of representing proper names explicitly, and we provide support for the necessity of considering sentences in the context of extended discourse (for example, written narrative) in order to fully capture certain features of their semantics. (shrink)

Hofweber (Ontology and the ambitions of metaphysics, Oxford University Press, 2016) argues for a thesis he calls “internalism” with respect to natural number discourse: no expressions purporting to refer to natural numbers in fact refer, and no apparent quantification over natural numbers actually involves quantification over natural numbers as objects. He argues that while internalism leaves open the question of whether other kinds of abstracta exist, it precludes the existence of natural numbers, thus establishing what he calls “restricted nominalism” about (...) natural numbers. We argue that Hofweber’s internalism fails to establish restricted nominalism. Not only is his primary argument for restricted nominalism invalid, the analysis of quantification proposed threatens to collapse internalism into either a traditional form of error theory or realism. (shrink)

Saul Kripke once noted that there is a tight connection between computation and de re knowledge of whatever the computation acts upon. For example, the Euclidean algorithm can produce knowledge of which number is the greatest common divisor of two numbers. Arguably, algorithms operate directly on syntactic items, such as strings, and on numbers and the like only via how the numbers are represented. So we broach matters of notation. The purpose of this article is to explore the relationship between (...) the notations acceptable for computation, the usual idealizations involved in theories of computability, flowing from Alan Turing’s monumental work, and de re propositional attitudes toward numbers and other mathematical objects. (shrink)

This project continues our interdisciplinary research into computational and cognitive aspects of narrative comprehension. Our ultimate goal is the development of a computational theory of how humans understand narrative texts. The theory will be informed by joint research from the viewpoints of linguistics, cognitive psychology, the study of language acquisition, literary theory, geography, philosophy, and artificial intelligence. The linguists, literary theorists, and geographers in our group are developing theories of narrative language and spatial understanding that are being tested by the (...) cognitive psychologists and language researchers in our group, and a computational model of a reader of narrative text is being developed by the AI researchers, based in part on these theories and results and in part on research on knowledge representation and reasoning. This proposal describes the knowledge-representation and natural-language-processing issues involved in the computational implementation of the theory; discusses a contrast between communicative and narrative uses of language and of the relation of the narrative text to the story world it describes; investigates linguistic, literary, and hermeneutic dimensions of our research; presents a computational investigation of subjective sentences and reference in narrative; studies children’s acquisition of the ability to take third-person perspective in their own storytelling; describes the psychological validation of various linguistic devices; and examines how readers develop an understanding of the geographical space of a story. This report is a longer version of a project description submitted to NSF. This document, produced in May 2007, is a L ATEX version of Technical Report 89-07 (Buffalo: SUNY Buffalo Department of Computer Science, August 1989), with slightly.. (shrink)

One prominent criticism of the abstractionist program is the so-called Bad Company objection. The complaint is that abstraction principles cannot in general be a legitimate way to introduce mathematical theories, since some of them are inconsistent. The most notorious example, of course, is Frege’s Basic Law V. A common response to the objection suggests that an abstraction principle can be used to legitimately introduce a mathematical theory precisely when it is stable: when it can be made true on all sufficiently (...) large domains. In this paper, we raise a worry for this response to the Bad Company objection. We argue, perhaps surprisingly, that it requires very strong assumptions about the range of the second-order quantifiers; assumptions that the abstractionist should reject. (shrink)

A core commitment of Bob Hale and Crispin Wright’s neologicism is their invocation of Frege’s Constraint—roughly, the requirement that the core empirical applications for a class of numbers be “built directly into” their formal characterization. According to these neologicists, if legitimate, Frege’s Constraint adjudicates in favor of their preferred foundation—Hume’s Principle—and against alternatives, such as the Dedekind–Peano axioms. In this paper, we consider a recent argument for legitimating Frege’s Constraint due to Hale, according to which the primary empirical application of (...) the naturals is transitive counting, or answering ‘how many’-questions using numerals. We make two claims regarding Hale’s argument. First, it fails to legitimate Frege’s Constraint in virtue of resting on unsupported and highly contentious assumptions. Secondly, even if sound, Hale’s argument would vindicate a version of Frege’s Constraint which fails to adjudicate in favor of Hume’s Principle over alternative characterizations of the naturals. (shrink)

Most philosophers are familiar with the metaphysical puzzle of the statue and the clay. A sculptor begins with some clay, eventually sculpting a statue from it. Are the clay and the statue one and the same thing? Apparently not, since they have different properties. For example, the clay could survive being squashed, but the statue could not. The statue is recently formed, though the clay is not, etc. Godehart Link 1983’s highly influential analysis of the count/mass distinction recommends that English (...) draws a distinction between uncountable “stuff” and countable “things”. There are two mereological relations, related in specific ways. Our primary question here is whether an empirically adequate account of the mass/count distinction really does require distinguishing “things” from “stuff”, and thus postulating two corresponding mereological relations, or if instead positing only one sort of entity and corresponding mereological relation is sufficient, as other semantic theories would have it. This question is meant to be one of what we call natural language mereology. We are asking about the mereological commitments of English, or perhaps competent speakers of English, and not about ultimate reality as such. There is no pretense that we will definitively solve the metaphysical puzzle of the statue and clay. (shrink)