A prominent objection against the logicality of second-order logic is the so-called Overgeneration Argument. However, it is far from clear how this argument is to be understood. In the first part of the article, we examine the argument and locate its main source, namely, the alleged entanglement of second-order logic and mathematics. We then identify various reasons why the entanglement may be thought to be problematic. In the second part of the article, we take a metatheoretic perspective on the matter. (...) We prove a number of results establishing that the entanglement is sensitive to the kind of semantics used for second-order logic. These results provide evidence that by moving from the standard set-theoretic semantics for second-order logic to a semantics which makes use of higher-order resources, the entanglement either disappears or may no longer be in conflict with the logicality of second-order logic. (shrink)

We present an inferentialist account of the epistemic modal operator 'might'. Our starting point is the bilateralist programme. A bilateralist explains the operator 'not' in terms of the speech act of rejection; we explain the operator 'might' in terms of weak assertion, a speech act whose existence we argue for on the basis of linguistic evidence. We show that our account of 'might' provides a solution to certain well-known puzzles about the semantics of modal vocabulary whilst retaining classical logic. This (...) demonstrates that an inferentialist approach to meaning can be successfully extended beyond the core logical constants. (shrink)

The Overgeneration Argument is a prominent objection against the model-theoretic account of logical consequence for second-order languages. In previous work we have offered a reconstruction of this argument which locates its source in the conflict between the neutrality of second-order logic and its alleged entanglement with mathematics. Some cases of this conflict concern small large cardinals. In this article, we show that in these cases the conflict can be resolved by moving from a set-theoretic implementation of the model-theoretic account to (...) one which uses higher-order resources. (shrink)

We develop a novel solution to the negation version of the Frege-Geach problem by taking up recent insights from the bilateral programme in logic. Bilateralists derive the meaning of negation from a primitive *B-type* inconsistency involving the attitudes of assent and dissent. Some may demand an explanation of this inconsistency in simpler terms, but we argue that bilateralism’s assumptions are no less explanatory than those of *A-type* semantics that only require a single primitive attitude, but must stipulate inconsistency elsewhere. Based (...) on these insights, we develop a version of B-type expressivism called *inferential expressivism*. This is a novel semantic framework that characterises meanings by inferential roles that define which *attitudes* one can *infer* from the use of terms. We apply this framework to normative vocabulary, thereby solving the Frege-Geach problem generally and comprehensively. Our account moreover includes a semantics for epistemic modals, thereby also explaining normative terms under epistemic modals. (shrink)

Timothy Smiley’s wonderful paper ‘Rejection’ (1996) is still perhaps not as well known or well understood as it should be. This note first gives a quick presentation of themes from that paper, though done in our own way, and then considers a putative line of objection – recently advanced by Julien Murzi and Ole Hjortland (2009) – to one of Smiley’s key claims. Along the way, we consider the prospects for an intuitionistic approach to some of the issues discussed in (...) Smiley’s paper. (shrink)

According to the iterative conception of set, sets can be arranged in a cumulative hierarchy divided into levels. But why should we think this to be the case? The standard answer in the philosophical literature is that sets are somehow constituted by their members. In the first part of the paper, I present a number of problems for this answer, paying special attention to the view that sets are metaphysically dependent upon their members. In the second part of the paper, (...) I outline a different approach, which circumvents these problems by dispensing with the priority or dependence relation altogether. Along the way, I show how this approach enables the mathematical structuralist to defuse an objection recently raised against her view. (shrink)

ABSTRACTLinguistic evidence supports the claim that certain, weak rejections are less specific than assertions. On the basis of this evidence, it has been argued that rejected sentences cannot be premisses and conclusions in inferences. We give examples of inferences with weakly rejected sentences as premisses and conclusions. We then propose a logic of weak rejection which accounts for the relevant phenomena and is motivated by principles of coherence in dialogue. We give a semantics for which this logic is sound and (...) complete, show that it axiomatizes the modal logic KD45 and prove that it still derives classical logic on its asserted fragment. Finally, we defend previous logics of strong rejection as being about the linguistically preferred interpretations of weak rejections. (shrink)

Mathematical realists have long invoked the categoricity of axiomatizations of arithmetic and analysis to explain how we manage to fix the intended meaning of their respective vocabulary. Can this strategy be extended to set theory? Although traditional wisdom recommends a negative answer to this question, Vann McGee (1997) has offered a proof that purports to show otherwise. I argue that one of the two key assumptions on which the proof rests deprives McGee's result of the significance he and the realist (...) want to attribute to it. I consider two strategies to deal with the problem --- one of which is outlined by McGee himself (2000) --- and argue that both of them fail. I end with some remarks on the prospects for mathematical realism in the light of my discussion. (shrink)

Paul Horwich (1990) once suggested restricting the T-Schema to the maximally consistent set of its instances. But Vann McGee (1992) proved that there are multiple incompatible such sets, none of which, given minimal assumptions, is recursively axiomatizable. The analogous view for set theory---that Naïve Comprehension should be restricted according to consistency maxims---has recently been defended by Laurence Goldstein (2006; 2013). It can be traced back to W.V.O. Quine(1951), who held that Naïve Comprehension embodies the only really intuitive conception of set (...) and should be restricted as little as possible. The view might even have been held by Ernst Zermelo (1908), who,according to Penelope Maddy (1988), subscribed to a ‘one step back from disaster’ rule of thumb: if a natural principle leads to contra-diction, the principle should be weakened just enough to block the contradiction. We prove a generalization of McGee’s Theorem, anduse it to show that the situation for set theory is the same as that for truth: there are multiple incompatible sets of instances of Naïve Comprehension, none of which, given minimal assumptions, is recursively axiomatizable. This shows that the view adumbrated by Goldstein, Quine and perhaps Zermelo is untenable. (shrink)

Some bilateralists have suggested that some of our negative answers to yes-or-no questions are cases of rejection. Mark Textor (2011. Is ‘no’ a force-indicator? No! Analysis 71: 448–56) has recently argued that this suggestion falls prey to a version of the Frege-Geach problem. This note reviews Textor's objection and shows why it fails. We conclude with some brief remarks concerning where we think that future attacks on bilateralism should be directed.

At the most general level, the concept of finitism is typically characterized by saying that finitistic mathematics is that part of mathematics which does not appeal to completed infinite totalities and is endowed with some epistemological property that makes it secure or privileged. This paper argues that this characterization can in fact be sharpened in various ways, giving rise to different conceptions of finitism. The paper investigates these conceptions and shows that they sanction different portions of mathematics as finitistic.

Maddy gave a semi-formal account of restrictiveness by defining a formal notion based on a class of interpretations and explaining how to handle false positives and false negatives. Recently, Hamkins pointed out some structural issues with Maddy's definition. We look at Maddy's formal definitions from the point of view of an abstract interpretation relation. We consider various candidates for this interpretation relation, including one that is close to Maddy's original notion, but fixes the issues raised by Hamkins. Our work brings (...) to light additional structural issues that we also discuss. (shrink)

Anti-realists typically contend that truth is epistemically constrained. Truth, they say, cannot outstrip our capacity to know. Some anti-realists are also willing to make a further claim: if truth is epistemically constrained, classical logic is to be given up in favour of intuitionistic logic. Here we shall be concerned with one argument in support of this thesis - Crispin Wright's Basic Revisionary Argument, first presented in his Truth and Objectivity. We argue that the reasoning involved in the argument, if correct, (...) validates a parallel argument that leads to conclusions that are unacceptable to classicists and intuitionists alike. (shrink)

The non-well-founded set theories described by Aczel (1988) have received attention from category theorists and computer scientists, but have been largely ignored by philosophers. At the root of this neglect might lie the impression that these theories do not embody a conception of set, but are rather of mere technical interest. This paper attempts to dispel this impression. I present a conception of set which may be taken as lying behind a non-well-founded set theory. I argue that the axiom AFA (...) is justified on the conception, which provides, contra Rieger (Mind 109:241–253, 2000), a rationale for restricting attention to the system based on this axiom. By making use of formal and informal considerations, I then make a case that most of the other axioms of this system are also justified on the conception. I conclude by commenting on the significance of the conception for the debate about the justification of the Axiom of Foundation. (shrink)

In set theory, a maximality principle is a principle that asserts some maximality property of the universe of sets or some part thereof. Set theorists have formulated a variety of maximality principles in order to settle statements left undecided by current standard set theory. In addition, philosophers of mathematics have explored maximality principles whilst attempting to prove categoricity theorems for set theory or providing criteria for selecting foundational theories. This article reviews recent work concerned with the formulation, investigation and justification (...) of maximality principles. (shrink)

This is a review of 'The Facts in Logical Space' by Jason Turner.

According to the received view, formalism – interpreted as the thesis that mathematical truth does not outrun the consequences of our maximal mathematical theory – has been refuted by Goedel's theorem. In support of this claim, proponents of the received view usually invoke an informal argument for the truth of the Goedel sentence, an argument which is supposed to reconstruct our reasoning in seeing its truth. Against this, Field has argued in a series of papers that the principles involved in (...) this argument – when applied to our maximal mathematical theory – are unsound. This paper defends the received view by showing that there is a way of seeing the truth of the Goedel sentence which is immune to Field's strategy. (shrink)

Several philosophers have argued that the logic of set theory should be intuitionistic on the grounds that the open-endedness of the set concept demands the adoption of a nonclassical semantics. This paper examines to what extent adopting such a semantics has revisionary consequences for the logic of our set-theoretic reasoning. It is shown that in the context of the axioms of standard set theory, an intuitionistic semantics sanctions a classical logic. A Kripke semantics in the context of a weaker axiomatization (...) is then considered. It is argued that this semantics vindicates an intuitionistic logic only insofar as certain constraints are put on its interpretation. Wider morals are drawn about the restrictions that this places on the shape of arguments for an intuitionistic revision of the logic of set theory. (shrink)

Leon Horsten has recently claimed that the class of mathematical truths coincides with the class of theorems of ZFC. I argue that the naturalistic character of Horsten’s proposal undermines his contention that this claim constitutes an analogue of a thesis that Daniel Isaacson has advanced for PA. I argue, moreover, that Horsten’s defence of his claim against an obvious objection makes use of a distinction which is not available to him given his naturalistic approach. I suggest a way out of (...) the objection which is in line with the naturalistic spirit of Horsten’s proposal but which further weakens the analogy with Isaacson’s Thesis. I conclude by evaluating the prospects for providing an analogue of Isaacson’s Thesis for ZFC. (shrink)