Stewart Shapiro

It is a commonplace that the extensions of most, perhaps all, vague predicates vary with such features as comparison class and paradigm and contrasting cases. My view proposes another, more pervasive contextual parameter. Vague predicates exhibit what I call open texture: in some circumstances, competent speakers can go either way in the borderline region. The shifting extension and anti-extensions of vague predicates are tracked by what David Lewis calls the “conversational score”, and are regulated by what Kit Fine calls penumbral connections, including a principle of tolerance. As I see it, vague predicates are response-dependent, or, better, judgement-dependent, at least in their borderline regions. This raises questions concerning how one reasons with such predicates. In this paper, I present a model theory for vague predicates, so construed. It is based on an overall supervaluationist-style framework, and it invokes analogues of Kripke structures for intuitionistic logic. I argue that the system captures, or at least nicely models, how one ought to reason with the shifting extensions (and anti-extensions) of vague predicates, as borderline cases are called and retracted in the course of a conversation. The model theory is illustrated with a forced march sorites series, and also with a thought experiment in which vague predicates interact with so-called future contingents. I show how to define various connectives and quantifiers in the language of the system, and how to express various penumbral connections and the principle of tolerance. The project fits into one of the topics of this special issue. In the course of reasoning, even with the external context held fixed, it is uncertain what the future extension of the vague predicates will be. Yet we still manage to reason with them. The system is based on that developed, more fully, in my Vagueness in Context , Oxford, Oxford University Press, 2006, but some criticisms and replies to critics are incorporated.

The central contention of this book is that second-order logic has a central role to play in laying the foundations of mathematics. In order to develop the argument fully, the author presents a detailed description of higher-order logic, including a comprehensive discussion of its semantics. He goes on to demonstrate the prevalence of second-order concepts in mathematics and the extent to which mathematical ideas can be formulated in higher-order logic. He also shows how first-order languages are often insufficient to codify many concepts in contemporary mathematics, and thus that both first- and higher-order logics are needed to fully reflect current work. Throughout, the emphasis is on discussing the associated philosophical and historical issues and the implications they have for foundational studies. For the most part, the author assumes little more than a familiarity with logic comparable to that provided in a beginning graduate course which includes the incompleteness of arithmetic and the Lowenheim-Skolem theorems. All those concerned with the foundations of mathematics will find this a thought-provoking discussion of some of the central issues in the field today.

A number of authors have recently weighed in on the issue of whether it is coherent to have bound variables that range over absolutely everything. Prima facie, it is difficult, and perhaps impossible, to coherently state the “relativist” position without violating it. For example, the relativist might say, or try to say, that for any quantifier used in a proposition of English, there is something outside of its range. What is the range of this quantifier? Or suppose we ask the relativist if there are some things that cannot appear in the range of any bound variable. The likely response would be along these lines: “No. For each object o, it possible to include o in the range of quantifiers, but one cannot quantify over everything at once.” This sentence contains unrestricted quantifiers, or so it seems, pending some clever move from a relativist. On the other hand, in the context of set theory, the reasoning behind the Burali-Forti paradox strongly suggests that there are well-orderings strictly longer than the collection of all ordinals. And set theorists regularly do transfinite recursions and transfinite reductions along such well-orderings. The relativist simply points out that one can always define new ordinals, and thus expand the range of one’s bound variables. The purpose of this paper is to explore the iterative framework, proposed in Zermelo’s 1930 paper, “Über Grenzzahlen und Mengenbereiche” (“On boundary numbers and domains of sets”), in order to shed light on these issues, and see what is involved in resolving them.

Graham Priest's In Contradiction (Dordrecht: Martinus Nijhoff Publishers, 1987, chapter 3) contains an argument concerning the intuitive, or ‘naïve’ notion of (arithmetic) proof, or provability. He argues that the intuitively provable arithmetic sentences constitute a recursively enumerable set, which has a Gödel sentence which is itself intuitively provable. The incompleteness theorem does not apply, since the set of provable arithmetic sentences is not consistent. The purpose of this article is to sharpen Priest's argument, avoiding reference to informal notions, consensus, or Church's thesis. We add Priest's dialetheic semantics to ordinary Peano arithmetic PA, to produce a recursively axiomatized formal system PA★ that contains its own truth predicate. Whether one is a dialetheist or not, PA★ is a legitimate, rigorously defined formal system, and one can explore its proof‐theoretic properties. The system is inconsistent (but presumably non‐trivial), and it proves its own Gödel sentence as well as its own soundness. Although this much is perhaps welcome to the dialetheist, it has some untoward consequences. There are purely arithmetic (indeed, Π0) sentences that are both provable and refutable in PA★. So if the dialetheist maintains that PA★ is sound, then he must hold that there are true contradictions in the most elementary language of arithmetic. Moreover, the thorough dialetheist must hold that there is a number g which both is and is not the code of a derivation of the indicated Gödel sentence of PA★. For the thorough dialetheist, it follows ordinary PA and even Robinson arithmetic are themselves inconsistent theories. I argue that this is a bitter pill for the dialetheist to swallow

The purpose of this paper is to assess the prospects for a neo‐logicist development of set theory based on a restriction of Frege's Basic Law V, which we call (RV): ∀P∀Q[Ext(P) = Ext(Q) ≡ [(BAD(P) & BAD(Q)) ∨ ∀x(Px ≡ Qx)]] BAD is taken as a primitive property of properties. We explore the features it must have for (RV) to sanction the various strong axioms of Zermelo–Fraenkel set theory. The primary interpretation is where ‘BAD’ is Dummett's ‘indefinitely extensible’.1 Background: what and why?2 Framework3 GOOD candidates, indefinite extensibility4 The framework of (RV) alone, or almost alone5 The axioms6 Brief closing.

There are a number of regions-based accounts of space/time, due to Whitehead, Roeper, Menger, Tarski, the present authors, and others. They all follow the Aristotelian theme that continua are not composed of points: each region has a proper part. The purpose of this note is to show how to recapture ‘points’ in such frameworks via Scottish neo-logicist abstraction principles. The results recapitulate some Aristotelian themes. A second agenda is to provide a new arena to help decide what is at stake when adjudicating issues concerning the identity of neo-logicist abstracts — so-called ‘Caesar questions’.

The purpose of this article is to examine aspects of the development of the concept and theory of computability through the theory of recursive functions. Following a brief introduction, Section 2 is devoted to the presuppositions of computability. It focuses on certain concepts, beliefs and theorems necessary for a general property of computability to be formulated and developed into a mathematical theory. The following two sections concern situations in which the presuppositions were realized and the theory of computability was developed. It is suggested in Section 3 that a central item was the problem of generalizing Gödel's incompleteness theorem. It is shown that this involved both the characterization of recursiveness and the attempt to clarify and formulate the notion of an effective process as it relates to the syntax of deductive systems. Section 4 concerns the decision problems which grew from the Hilbert program. Section 5 is devoted to the development of an informal' technique in the theory of computability often called ?argument by Church's thesis?