Though Frege was interested primarily in reducing mathematics to logic, he succeeded in reducing an important part of logic to mathematics by defining relations in terms of functions. By contrast, Whitehead & Russell reduced an important part of mathematics to logic by defining functions in terms of relations (using the definite description operator). We argue that there is a reason to prefer Whitehead & Russell's reduction of functions to relations over Frege's reduction of relations to functions. There is an interesting (...) system having a logic that can be properly characterized in relational but not in functional type theory. This shows that relational type theory is more general than functional type theory. The simplification offered by Church in his functional type theory is an over-simplification: one can't assimilate predication to functional application.<br>. (shrink)

There are two broad approaches to theorizing about ontological categories. Quineans use first-order quantifiers to generalize over entities of each category, whereas type theorists use quantification on variables of different semantic types to generalize over different categories. Does anything of import turn on the difference between these approaches? If so, are there good reasons to go type-theoretic? I argue for positive answers to both questions concerning the category of propositions. I also discuss two prominent arguments for a Quinean conception of (...) propositions, concerning their role in natural language semantics and apparent quantification over propositions within natural language. It will emerge that even if these arguments are sound, there need be no deep question about Quinean propositions’ true nature, contrary to much recent work on the metaphysics of propositions. (shrink)

The popular interpretation of token‐reflexivism states that at the level of logical form, indexicals and demonstratives are disguised descriptions that employ complex demonstratives or special quotation‐mark names involving particular tokens of the appropriate expression‐types. In this article I first demonstrate that this interpretation of token‐reflexivism is only one of many, and that it is better to think of token‐reflexivism as denoting a family of distinct theoretical frameworks. Second, I contrast two interpretations of the idea of the token‐reflexive paraphrase of an (...) indexical sentence. The utterance approach claims that token‐reflexive paraphrases involve tokens of entire utterances. The sub‐utterance approach maintains that token‐reflexive paraphrases involve tokens of the particular indexical words used in the utterance. Next, I pose a problem that shows that neither of the two approaches is correct. The problem shows that the only viable version of the token‐reflexive proposition must somehow take into account the referential intentions of the speaker of the context. Therefore I conclude the article by sketching the framework of restricted intentional token‐reflexivism. I argue that it is an attractive semantic theory of distributed utterances that, among other things, enables automatic and intentional indexicals to be distinguished. (shrink)

This paper develops a semantics for a fragment of English that is based on the idea of `impossible possible worlds'. This idea has earlier been formulated by authors such as Montague, Cresswell, Hintikka, and Rantala, but the present set-up shows how it can be formalized in a completely unproblematic logic---the ordinary classical theory of types. The theory is put to use in an account of propositional attitudes that is `hyperfine-grained', i.e. that does not suffer from the well-known problems involved with (...) replacing expressions by logical equivalents. (shrink)