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$

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

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

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.