Agustin Rayo

I show that any sentence of nth-order (pure or applied) arithmetic can be expressed with no loss of compositionality as a second-order sentence containing no arithmetical vocabulary, and use this result to prove a completeness theorem for applied arithmetic. More specifically, I set forth an enriched second-order language L, a sentence A of L (which is true on the intended interpretation of L), and a compositionally recursive transformation Tr defined on formulas of L, and show that they have the following two properties: (a) in a universe with at least [HEBREW LETTER BET] $_{n-2}$ objects, any formula of nth-order (pure or applied) arithmetic can be expressed as a formula of L, and (b) for any sentence $\ulcorner \phi \urcorner$ of L, $\ulcorner \phi^{Tr} \urcorner$ is a second-order sentence containing no arithmetical vocabulary, and nth $\mathcal{A} \vdash \ulcorner \phi \longleftrightarrow \phi^{Tr} \urcorner$

This paper extracts some of the main theses in the philosophy of mathematics from my book, The Construction of Logical Space. I show that there are important limits to the availability of nominalistic paraphrase functions for mathematical languages, and suggest a way around the problem by developing a method for specifying nominalistic contents without corresponding nominalistic paraphrases. Although much of the material in this paper is drawn from the book — and from an earlier paper — I hope the present discussion will earn its keep by motivating the ideas in a new way, and by suggesting further applications

I have two main objectives. The first is to get a better understanding of what is at issue between friends and foes of higher-order quantification, and of what it would mean to extend a Boolos-style treatment of second-order quantification to third- and higherorder quantification. The second objective is to argue that in the presence of absolutely general quantification, proper semantic theorizing is essentially unstable: it is impossible to provide a suitably general semantics for a given language in a language of the same logical type. I claim that this leads to a trilemma: one must choose between giving up absolutely general quantification, settling for the view that adequate semantic theorizing about certain languages is essentially beyond our reach, and countenancing an open-ended hierarchy of languages of ever ascending logical type. I conclude by suggesting that the hierarchy may be the least unattractive of the options on the table.

George Boolos (1984, 1985) has extensively investigated plural quantifi- cation, as found in such locutions as the Geach-Kaplan sentence There are critics who admire only one another, and he found that their logic cannot be adequately formalized within the first-order predicate calculus. If we try to formalize the sentence by a paraphrase using individual variables that range over critics, or over sets or collections or fusions of critics, we misrepresent its logical structure. To represent plural quantification adequately requires the logical resources of the full second-order predicate calculus.

My thesis consists of three self-contained but interconnected papers. In the first one, 'Word and Objects', I assume that it is possible to quantify over absolutely everything, and show that certain English sentences containing collective predicates resist paraphrase in first-order languages and even in first-order languages enriched with plural quantifiers. To capture such sentences I develop a language containing plural predicates . ;The introduction of plural predicates leads to an extension of Quine's criterion of ontological commitment. I argue that theories containing plural predicates can have plural ontological commitments in addition to singular ones. In this sense, I argue that the subject-matter of ontology is richer than one might have thought. ;Plural predicates turn out to be tremendously fruitful. For example, they provide us with natural formalizations for English plural definite descriptions and generalized quantifiers. They also allow us to state important set theoretic propositions, and give a formal semantics for second-order languages. Such a formal semantics is developed in the second paper, 'Toward a Theory of Second-Order Consequence', which is a collaboration with Gabriel Uzquiano. ;In the third paper, 'Frege's Unofficial Arithmetic', I consider an application of plural predicates to the philosophy of mathematics. By developing a suggestion of the later Frege, I show that any arithmetical predicate can be transformed into a plural predicate in such a way that the arithmetical predicate is true of the number of the Fs just in case the plural predicate is true of the Fs themselves. ;The transformation is important both because it can be put to use by nominalists about arithmetic and neo-Fregeans, and because it provides the foundations for an account of applied arithmetic

In order to predict and explain behavior, one cannot specify the mental state of an agent merely by saying what information she possesses.  Instead one must specify what information is available to an agent relative to various purposes.  Specifying mental states in this way allows us to accommodate cases of imperfect recall, cognitive accomplishments involved in logical deduction, the mental states of confused or fragmented subjects, and the difference between propositional knowledge and know-how

This essay is a study of ontological commitment, focused on the special case of arithmetical discourse. It tries to get clear about what would be involved in a defense of the claim that arithmetical assertions are ontologically innocent and about why ontological innocence matters. The essay proceeds by questioning traditional assumptions about the connection between the objects that are used to specify the truth-conditions of a sentence, on the one hand, and the objects whose existence is required in order for the truth-conditions thereby specified to be satisfied, on the other. This allows one to set forth an assignment of truth-conditions to arithmetical sentences whereby nothing is required of the world in order for the truth-conditions of a truth of pure arithmetic to be satisfied. The essay then argues that such an assignment can be used to account for the a priori knowability of certain arithmetical truths.

La Paradoja de Orayen es dos cosas en una. Primeramente, es un homenaje al filósofo argentino Raúl Orayen (1942–2003). Pocos filósofos hispanoamericanos han gozado de la solidez intelectual y agudeza filosófica de Orayen, y pocos han sido tan queridos. Se trata, pues, de un homenaje bien merecido y que mucho agradecemos los que tuvimos la fortuna de interactuar con Raúl y aprender de él. En segundo lugar, el libro es una contribución a la filosofía hispanoamericana. Alberto Moretti y Guillermo Hurtado tuvieron el acierto de reconocer el valor de un proyecto que la prematura muerte de Orayen dejó inconcluso, y apreciar su potencial para generar discusión filosófica de alto nivel. El resultado es un volumen que recompensará la atención de sus lectores, y dará al trabajo de Orayen justa prominencia en el mundo hispanoamericano.