Our conception of logical space is the set of distinctions we use to navigate the world. Agustn Rayo argues that this is shaped by acceptance or rejection of 'just is'-statements: e.g. 'to be composed of water just is to be composed of H2O'. He offers a novel conception of metaphysical possibility, and a new trivialist philosophy of mathematics.

It would be good to have a Bayesian decision theory that assesses our decisions and thinking according to everyday standards of rationality — standards that do not require logical omniscience (Garber 1983, Hacking 1967). To that end we develop a “fragmented” decision theory in which a single state of mind is represented by a family of credence functions, each associated with a distinct choice condition (Lewis 1982, Stalnaker 1984). The theory imposes a local coherence assumption guaranteeing that as an agent's (...) attention shifts, successive batches of "obvious" logical information become available to her. A rule of expected utility maximization can then be applied to the decision of what to attend to next during a train of thought. On the resulting theory, rationality requires ordinary agents to be logically competent and to often engage in trains of thought that increase the unification of their states of mind. But rationality does not require ordinary agents to be logically omniscient. (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.

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 .

Gödel claimed that Zermelo-Fraenkel set theory is 'what becomes of the theory of types if certain superfluous restrictions are removed'. The aim of this paper is to develop a clearer understanding of Gödel's remark, and of the surrounding philosophical terrain. In connection with this, we discuss some technical issues concerning infinitary type theories and the programme of developing the semantics for higher-order languages in other higher-order languages.

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.

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’.).

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.

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 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.

Modal logicism is the view that a metaphysical possibility is just a non-absurd way for the world to be. I argue that modal logicists should see metaphysical possibility as "open ended'': any given possibilities can be used to characterize further possibilities. I then develop a formal framework for modal languages that is a good fit for the modal logicist and show that it delivers some attractive results.

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)

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 propose a way of thinking about content, and a related way of thinking about ontological commitment.

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. (shrink)

I argue for a conception of essence that does not rely on distinctions of metaphysical fundamentality.

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.

Cameron, Eklund, Hofweber, Linnebo, Russell and Sider have written critical essays on my book, The Construction of Logical Space (Oxford: Oxford University Press, 2013). Here I offer some replies.

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?

Forthcoming in Philosophical Compass. I explain why plural quantifiers and predicates have been thought to be philosophically significant.

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)

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.

I argue that Neo-Fregean accounts of arithmetical language and arithmetical knowledge tacitly rely on a thesis I call [Success by Default]—the thesis that, in the absence of reasons to the contrary, we are justified in thinking that certain stipulations are successful. Since Neo-Fregeans have yet to supply an adequate defense of [Success by Default], I conclude that there is an important gap in Neo-Fregean accounts of arithmetical language and knowledge. I end the paper by offering a naturalistic remedy.

Florio and Shapiro take issue with an argument in ‘Hierarchies Ontological and Ideological’ for the conclusion that the set-theoretic hierarchy is open-ended. Here we clarify and reinforce the argument in light of their concerns.

Dan Greco and Jason Turner wrote two fantastic critiques of my book, The Construction of Logical Space. Greco’s critique suggests that the book can be given a Kuhnian interpretation, with a Carnapian twist. Here I embrace that interpretation. Turner criticizes one of the views I develop in the book. Here I identify an avenue of resistance.

Modal contingentists face a dilemma: there are two attractive principles of which they can only accept one. In this paper I show that the most natural way of resolving the dilemma leads to expressive limitations. I then develop an alternative resolution. In addition to overcoming the expressive limitations, the alternative picture allows for an attractive account of arithmetic and for a style of semantic theorizing that can be helpful to contingentists.

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)

This is a supplementary document to my "Why I am not an Absolutist (Or a First-Orderist)", which is forthcoming in a volume on higher-order logic edited by Peter Fritz and Nick Jones.

I develop a device for simulating quantification over merely possible objects from the perspective of a modal actualist ---someone who thinks that everything that exists actually exists.

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 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 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.

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. (shrink)