According to the Rationality Constraint, our concept of belief imposes limits on how much irrationality is compatible with having beliefs at all. We argue that empirical evidence of human irrationality from the psychology of reasoning and the psychopathology of delusion undermines only the most demanding versions of the Rationality Constraint, which require perfect rationality as a condition for having beliefs. The empirical evidence poses no threat to more relaxed versions of the Rationality Constraint, which only require only minimal rationality. Nevertheless, (...) we raise problems for all versions of the Rationality Constraint by appealing to more extreme forms of irrationality that are continuous with actual cases of human irrationality. In particular, we argue that there are conceivable cases of “mad belief” in which populations of Lewisian madmen have beliefs that are not even minimally rational. This undermines Lewis’s claim that our ordinary concept of belief is a theoretical concept that is implicitly defined by its role in folk psychology. We argue that introspection gives us a phenomenal concept of belief that cannot be analyzed by applying Lewis’s semantics for theoretical terms. (shrink)

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.

There are multiple formal characterizations of the natural numbers available. Despite being inter-derivable, they plausibly codify different possible applications of the naturals – doing basic arithmetic, counting, and ordering – as well as different philosophical conceptions of those numbers: structuralist, cardinal, and ordinal. Nevertheless, some influential philosophers of mathematics have argued for a non-egalitarian attitude according to which one of those characterizations is more “legitmate” in virtue of being “more basic” or “more fundamental”. This paper addresses two related issues. First, (...) we review some of these non-egalitarian arguments, lay out a laundry list of different, legitimate, notions of relative priority, and suggest that these arguments plausibly employ different such notions. Secondly, we argue that given a metaphysical-cum-epistemological gloss suggested by Frege’s foundationalist epistomology, the ordinals are plausibly more basic than the cardinals. This is just one orientation to relative priority one could take, however. Ultimately, we subscribe to an egalitarian attitude towards these formal characterizations: they are, in some sense, equally “legitimate”. (shrink)

In this chapter we explain what experimental philosophy of science is, how it relates to the philosophy of science, and STS more broadly, and what sorts of contributions is can make to ongoing research in the philosophy of science.

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)