I offer solutions to a puzzle about intentional identity and a related puzzle about empty names. (This is part of a trilogy of papers on content; the other two are’Ontological Commitment’ and ‘On Specifying Content’.).
I develop an account of the sorts of considerations that should go into determining where the limits of possibility lie. (This is part of a series of four closely related papers. The other three are ‘On Specifying Truth-Conditions’, ‘Ontological Commitment’ and ‘An Actualist’s Guide to Quantifying-In’.).
I argue for an account of vagueness according to which the root of vagueness lies not in the type of semantic-value that is best associated with an expression, but in the type of linguistic practice that renders the expression meaningful. I suggest, in particular, that conventions about how to use sentences involving attributions of vague predicates to borderline cases prevail to a lesser degree than conventions about how to use sentences involving attributions of vague predicates to clear cases.
Years ago, when I was young and reckless, I believed that there was such a thing as an allinclusive domain.1 Now I have come to see the error of my ways. The source of my mistake was a view that might be labeled ‘Tractarianism’. Tractarians believe that language is subject to a metaphysical constraint. In order for an atomic sentence to be true, there needs to be a certain kind of correspondence between the semantic structure of the sentence and the (...) ‘metaphysical structure of reality’. More specifically, Tractarianism is the conjunction of the following three claims. (shrink)
Whether or not we achieve absolute generality in philosophical inquiry, most philosophers would agree that ordinary inquiry is rarely, if ever, absolutely general. Even if the quantifiers involved in an ordinary assertion are not explicitly restricted, we generally take the assertion’s domain of discourse to be implicitly restricted by context.1 Suppose someone asserts (2) while waiting for a plane to take off.
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. (shrink)
The seminar is intended as an introduction to vagueness. We'll survey some prominent accounts of vagueness, so that people get a sense of what `accounting for vagueness' is all about, and why it's hard.
Students in this class are expected to complete work on their own. Both problem sets and exams should consist entirely of the student's own work; they must not be copied from other students or any other source. Failure to comply constitutes plagiarism and is a serious violation of class and University policy. Cases of academic dishonesty will be pursued to the fullest extent possible.
The purpose of this paper is to defend a conception of language that does not rely on linguistic meanings, and use it to address the Sorites and Liar paradoxes.
I will argue for localism about credal assignments: the view that credal assignments are well-defined only relative to suitably constrained sets of possibilities. I will motivate the position by suggesting that it is the best way of addressing a puzzle devised by Roger White.
The goal of this paper is to develop a theory of content for vague language. My proposal is based on the following three theses: (1) language-mastery is not rulebased— it involves a certain kind of decision-making; (2) a theory of content is to be thought of instrumentally—it is a tool for making sense of our linguistic practice; and (3) linguistic contents are only locally defined—they are only defined relative to suitably constrained sets of possibilities. CiteULike Connotea Del.icio.us What's this?
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. (shrink)
I propose a way of thinking aboout content, and a related way of thinking about ontological commitment. (This is part of a series of four closely related papers. The other three are ‘On Specifying Truth-Conditions’, ‘An Actualist’s Guide to Quantifying In’ and ‘An Account of Possibility’.).
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. (shrink)
The problem of absolute generality has attracted much attention in recent philosophy. Agustin Rayo and Gabriel Uzquiano have assembled a distinguished team of contributors to write new essays on the topic. They investigate the question of whether it is possible to attain absolute generality in thought and language and the ramifications of this question in the philosophy of logic and mathematics.
Here is an account of logical consequence inspired by Bolzano and Tarski. Logical validity is a property of arguments. An argument is a pair of a set of interpreted sentences (the premises) and an interpreted sentence (the conclusion). Whether an argument is logically valid depends only on its logical form. The logical form of an argument is fixed by the syntax of its constituent sentences, the meanings of their logical constituents and the syntactic differences between their non-logical constituents, treated as (...) variables. A constituent of a sentence is logical just if it is formal in meaning, in the sense roughly that its application is invariant under permutations of individuals.1 Thus ‘=’ is a logical constant because no permutation maps two individuals to one or one to two; ‘∈’ is not a logical constant because some permutations interchange the null set and its singleton. Truth functions, the usual quantifiers and bound variables also count as logical constants. An argument is logically valid if and only if the conclusion is true under every assignment of semantic values to variables (including all non-logical expressions) under which all its premises are true. A sentence is logically true if and only if the argument with no premises of which it is the conclusion is logically valid, that is, if and only if the sentence is true under every assignment of semantic values to variables. An interpretation assigns values to all variables. (shrink)
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$. (shrink)
The aim of this essay is to show that the subject-matter of ontology is richer than one might have thought. Our route will be indirect. We will argue that there are circumstances under which standard first-order regimentation is unacceptable, and that more appropriate varieties of regimentation lead to unexpected kinds of ontological commitment.
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. (shrink)
There is little doubt that a second-order axiomatization of Zermelo-Fraenkel set theory plus the axiom of choice (ZFC) is desirable. One advantage of such an axiomatization is that it permits us to express the principles underlying the first-order schemata of separation and replacement. Another is its almost-categoricity: M is a model of second-order ZFC if and only if it is isomorphic to a model of the form Vκ, ∈ ∩ (Vκ × Vκ) , for κ a strongly inaccessible ordinal.