Brouwer's demonstration of his Bar Theorem gives rise to provocative questions regarding the proper explanation of the logical connectives within intuitionistic and constructivist frameworks, respectively, and, more generally, regarding the role of logic within intuitionism. It is the purpose of the present note to discuss a number of these issues, both from an historical, as well as a systematic point of view.

Philosophy and Literature is an internationally renowned refereed journal founded by Denis Dutton at the University of Canterbury, Christchurch. It is now published by the Johns Hopkins University Press. Since its inception in 1976, Philosophy and Literature has been concerned with the relation between literary and philosophical studies, publishing articles on the philosophical interpretation of literature as well as the literary treatment of philosophy. Philosophy and Literature has sometimes been regarded as iconoclastic, in the sense that it repudiates academic pretensions, (...) insidious jargon and institutional vogue. Dutton, who remains the editor, still writes a regular column. A distinctive feature of Philosophy and Literature was the annual Bad Writing Contest, held from 1995–98, which sought to identify (and publish) the ‘most stylistically lamentable passages’ of academic prose, often to great amusement. (shrink)

The Hyperuniverse Programme, introduced in Arrigoni and Friedman (2013), fosters the search for new set-theoretic axioms. In this paper, we present the procedure envisaged by the programme to find new axioms and the conceptual framework behind it. The procedure comes in several steps. Intrinsically motivated axioms are those statements which are suggested by the standard concept of set, i.e. the `maximal iterative concept', and the programme identi fies higher-order statements motivated by the maximal iterative concept. The satisfaction of these statements (...) (H-axioms) in countable transitive models, the collection of which constitutes the `hyperuniverse' (H), has remarkable 1st-order consequences, some of which we review in section 5. (shrink)

The conceptual framework of behaviorism is reconstructed in a logical scheme rather than along chronological lines. The resulting reconstruction is faithful to the history of behaviorism and yet meets the contemporary challenges arising from cognitive science, psycholinguistics, and philosophy. In this reconstruction, the fundamental premise is that psychology is to be a natural science, and the major corollaries are that psychology is to be objective and empirical. To a great extent, the reconstruction of behaviorism is an elaboration of behaviorist views (...) of what it is for a science to be objective and empirical. The reconstruction examines and evaluates behaviorist positions on observation and the rejection of introspection, the behavioral data language, theory construction, stimulus-response psychology, the organization of behavior, complex processes, agency, and the interpretation of mentalistic language. The resulting reconstruction shows behaviorism to be a pragmatic psychological version of positivism based on a behavioral epistemology. (shrink)

In the 1920s, David Hilbert proposed a research program with the aim of providing mathematics with a secure foundation. This was to be accomplished by first formalizing logic and mathematics in their entirety, and then showing---using only so-called finitistic principles---that these formalizations are free of contradictions. ;In the area of logic, the Hilbert school accomplished major advances both in introducing new systems of logic, and in developing central metalogical notions, such as completeness and decidability. The analysis of unpublished material presented (...) in Chapter 2 shows that a completeness proof for propositional logic was found by Hilbert and his assistant Paul Bernays already in 1917--18, and that Bernays's contribution was much greater than is commonly acknowledged. Aside from logic, the main technical contribution of Hilbert's Program are the development of formal mathematical theories and proof-theoretical investigations thereof, in particular, consistency proofs. In this respect Wilhelm Ackermann's 1924 dissertation is a milestone both in the development of the Program and in proof theory in general. Ackermann gives a consistency proof for a second-order version of primitive recursive arithmetic which, surprisingly, explicitly uses a finitistic version of transfinite induction up to www . He also gave a faulty consistency proof for a system of second-order arithmetic based on Hilbert's &egr;-substitution method. Detailed analyses of both proofs in Chapter 3 shed light on the development of finitism and proof theory in the 1920s as practiced in Hilbert's school. ;In a series of papers, Charles Parsons has attempted to map out a notion of mathematical intuition which he also brings to bear on Hilbert's finitism. According to him, mathematical intuition fails to be able to underwrite the kind of intuitive knowledge Hilbert thought was attainable by the finitist. It is argued in Chapter 4 that the extent of finitistic knowledge which intuition can provide is broader than Parsons supposes. According to another influential analysis of finitism due to W. W. Tait, finitist reasoning coincides with primitive recursive reasoning. The acceptance of non-primitive recursive methods in Ackermann's dissertation presented in Chapter 3, together with additional textual evidence presented in Chapter 4, shows that this identification is untenable as far as Hilbert's conception of finitism is concerned. Tait's conception, however, differs from Hilbert's in important respects, yet it is also open to criticisms leading to the conclusion that finitism encompasses more than just primitive recursive reasoning. (shrink)

Alberto Casullo ("Necessity, Certainty, and the A Priori", Canadian Journal of Philosophy 18, 1988) argues that arithmetical propositions could be disconfirmed by appeal to an invented scenario, wherein our standard counting procedures indicate that 2 + 2 != 4. Our best response to such a scenario would be, Casullo suggests, to accept the results of the counting procedures, and give up standard arithmetic. While Casullo's scenario avoids arguments against previous "disconfirming" scenarios, it founders on the assumption, common to scenario and (...) response, that arithmetic might be independent of standard counting procedures. Here I show, by attention to tallying as the simplest form of counting, that this assumption is incoherent: given standard counting procedures, then (on pain of irrationality) arithmetical theory follows. (shrink)

We investigate various ways of introducing axioms for randomness in set theory. The results show that these axioms, when added to ZF, imply the failure of AC. But the axiom of extensionality plays an essential role in the derivation, and a deeper analysis may ultimately show that randomness is incompatible with extensionality.

The Univalent Foundations of Mathematics provide not only an entirely non-Cantorian conception of the basic objects of mathematics but also a novel account of how foundations ought to relate to mathematical practice. In this paper, I intend to answer the question: In what way is UF a new foundation of mathematics? I will begin by connecting UF to a pragmatist reading of the structuralist thesis in the philosophy of mathematics, which I will use to define a criterion that a formal (...) system must satisfy if it is to be regarded as a “structuralist foundation.” I will then explain why both set-theoretic foundations like ZFC and category-theoretic foundations like ETCS satisfy this criterion only to a very limited extent. Then I will argue that UF is better-able to live up to the proposed criterion for a structuralist foundation than any currently available foundational proposal. First, by showing that most criteria of identity in the practice of mathematics can be formalized in terms of the preferred criterion of identity between the basic objects of UF. Second, by countering several objections that have been raised against UF’s capacity to serve as a foundation for the whole of mathematics. (shrink)

In this article, extracted from his book Exploring Meinong's Jungle and Beyond, Sylvan argues that, contrary to widespread opinion, mathematics is not an extensional discipline and cannot be extensionalized without considerable damage. He argues that some of the insights of Meinong's theory of objects, and its modern development, item theory, should be applied to mathematics and that mathematical objects and structures should be treated as mind-independent, non-existent objects.

ABSTRACT Historical structuralist views have been ontological. They either deny that there are any mathematical objects or they maintain that mathematical objects are structures or positions in them. Non-ontological structuralism offers no account of the nature of mathematical objects. My own structuralism has evolved from an early sui generis version to a non-ontological version that embraces Quine’s doctrine of ontological relativity. In this paper I further develop and explain this view.

This paper is concerned with the genesis of mathematical knowledge. While some philosophers might argue that mathematics has no real subject matter and thus is not a body of knowledge, I will not try to dissuade them directly. I shall not attempt such a refutation because it seems clear to me that mathematicians do know such things as the Mean Value Theorem, The Fundamental Theorem of Arithmetic, Godel's Theorems, etc. Moreover, this is much more evident to me than any philosophical (...) view of mathematics I know of — including my own. So I am going to take mathematics as my starting point. (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 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 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)

In this paper, I argue that Amie Thomasson’s Easy Ontology rests on a vicious circularity that is highly damaging. Easy Ontology invokes the idea of application conditions that give rise to analytic entailments. Such entailments can be used to answer ontological questions easily. I argue that the application conditions for basic terms are only circularly specifiable showing that Thomasson misses her self-set goal of preventing such a circularity. Using this circularity, I go on to show that Easy Ontology as a (...) whole collapses. (shrink)

It is commonly assumed that classical logic is the embodiment of a realist ontology. In “Sets and Semantics”, however, Jonathan Lear challenged this assumption in the particular case of set theory, arguing that even if one is a set-theoretic Platonist, due attention to a special feature of set theory leads to the conclusion that the correct logic for it is intuitionistic. The feature of set theory Lear appeals to is the open-endedness of the concept of set. This article advances reasons (...) internal to Lear’s account to show that his argument for intuitionistic set theory is unsuccessful. (shrink)

, Rudolf Carnap became a chief proponent of the doctrine that the statements of intuitionism carry nonstandard intuitionistic meanings. This doctrine is linked to Carnap's ‘Principle of Tolerance’ and claims he made on behalf of his notion of pure syntax. From premises independent of intuitionism, we argue that the doctrine, the Principle, and the attendant claims are mistaken, especially Carnap's repeated insistence that, in defining languages, logicians are free of commitment to mathematical statements intuitionists would reject. I am grateful to (...) Nathan Carter, Gary Ebbs, Janet Folina, Luise Prior McCarty, Stewart Shapiro, Neil Tennant, Christopher Tillman, Beth Tropman, Wen-fang Wang, and two anonymous referees for their comments and suggestions. CiteULike Connotea Del.icio.us What's this? (shrink)

Though many working mathematicians embrace a rough and ready form of Platonism, that venerable position has suffered a checkered philosophical career. Indeed the three schools of thought with which most of us began our official philosophizing about mathematics—Intuitionism, Formalism, and Logicism—all stand in fundamental disagreement with Platonism. Nevertheless, various versions of Platonistic thinking survive in contemporary philosophical circles. The aim of this paper is to describe these views, and, as my title suggests, to trace their roots.I'll begin with some preliminary (...) remarks about the big three schools. This seems a reasonable approach to the issues both because most observers are familiar, at least in a general way, with the tenets of Intuitionism, Formalism, and Logicism, and because it is in reaction to these that contemporary Platonism has taken shape. (shrink)

This talk surveys a range of positions on the fundamental metaphysical and epistemological questions about elementary logic, for example, as a starting point: what is the subject matter of logic—what makes its truths true? how do we come to know the truths of logic? A taxonomy is approached by beginning from well-known schools of thought in the philosophy of mathematics—Logicism, Intuitionism, Formalism, Realism—and sketching roughly corresponding views in the philosophy of logic. Kant, Mill, Frege, Wittgenstein, Carnap, Ayer, Quine, and Putnam (...) are among the philosophers considered along the way. (shrink)

My aim in this paper is to propose what seems to me a distinctive approach to set theoretic methodology. By ‘methodology’ I mean the study of the actual methods used by practitioners, the study of how these methods might be justified or reformed or extended. So, for example, when the intuitionist's philosophical analysis recommends a wholesale revision of the methods of proof used in classical mathematics, this is a piece of reformist methodology. In contrast with the intuitionist, I will focus (...) more narrowly on the methods of contemporary set theory, and, more importantly, I will certainly recommend no sweeping reforms. Rather, I begin from the assumption that the methodologist's job is to account for set theory as it is practiced, not as some philosophy would have it be. This credo lies at the very heart of the so-called ‘naturalism’ to be described here.A philosopher looking at set theoretic practice from the outside, so to speak, might notice any number of interesting methodological questions, beginning with the intuitionist's ‘why use classical logic?’, but this sort of question is not a live issue for most practicing set theorists. One central question on which the philosopher's and the practitioner's interests converge is this: what is the status of independent statements like the continuum hypothesis (CH)? A number of large questions arise in its wake: what criteria should guide the search for new axioms? For that matter, what reasons support our adoption of the old axioms? (shrink)

My goal here is to explore the relationship between pure and applied mathematics and then, eventually, to draw a few morals for both. In particular, I hope to show that this relationship has not been static, that the historical rise of pure mathematics has coincided with a gradual shift in our understanding of how mathematics works in application to the world. In some circles today, it is held that historical developments of this sort simply represent changes in fashion, or in (...) social arrangements, governments, power structures, or some such thing, but I resist the full force of this way of thinking, clinging to the old school notion that we have gradually learned more about the world over time, that our opinions on these matters have improved, and that seeing how we reached the point we now occupy may help us avoid falling back into old philosophies that are now no longer viable. In that spirit, it seems to me that once we focus on the general question of how mathematics relates to science, one observation is immediate: the march of the centuries has produced an amusing reversal of philosophical fortunes. Let me begin there. In the beginning, that is, in Plato, mathematical knowledge was sharply distinguished from ordinary perceptual belief about the world. According to Plato’s metaphysics, mathematics is the study of eternal and unchanging abstract Forms,1 while science is uncertain and changeable opinion about the world of mere becoming. Indeed, in Plato’s lights, of the two, only mathematics deserves to be called ‘knowledge’ at all! Of course if sense perception cannot give us knowledge, if mathematics is not about perceivable things, then Plato owes us an account of how we ordinary humans achieve this wonderful insight into the properties of the abstract world of Forms. Plato’s answer is that we do not actually acquire mathematical knowledge at all; rather, we recollect it from a time before birth, when our souls, unencumbered by physical bodies, were free to commune with the Forms, and not just the mathematical ones, either – also Truth, Beauty, Justice, the Good, and so on.2 Whatever appeal this position may have held for the ancient Greeks, it will not begin to satisfy a contemporary, scientifically minded philosopher.. (shrink)

In this paper, we investigate (1) what can be salvaged from the original project of "logicism" and (2) what is the best that can be done if we lower our sights a bit. Logicism is the view that "mathematics is reducible to logic alone", and there are a variety of reasons why it was a non-starter. We consider the various ways of weakening this claim so as to produce a "neologicism". Three ways are discussed: (1) expand the conception of logic (...) used in the reduction, (2) allow the addition of analytic-sounding principles to logic so that the reduction is not to "logic alone" but to logic and truths knowable a priori, and (3) revise the conception of "reducible". We show how the current versions of neologicism fit into this classification scheme, and then focus on a kind of neologicism which we take to have the most potential for achieving the epistemological goals of the original logicist project. We argue that that the "weaker" the form of neologicism, the more likely it is to be a new form of logicism, and show how our preferred system, though mathematically weak, is metaphysically and epistemogically strong, and can "reduce" arbitrary mathematical theories to logic and analytic truths, if given a legitimate new sense of "reduction". (shrink)

This paper criticizes George Boolos's famous use of plural quantification to argue that monadic second-order logic is pure logic. I deny that plural quantification qualifies as pure logic and express serious misgivings about its alleged ontological innocence. My argument is based on an examination of what is involved in our understanding of the impredicative plural comprehension schema.

Since Benacerraf’s “Mathematical Truth” a number of epistemological challenges have been launched against mathematical platonism. I first argue that these challenges fail because they unduely assimilate mathematics to empirical science. Then I develop an improved challenge which is immune to this criticism. Very roughly, what I demand is an account of how people’s mathematical beliefs are responsive to the truth of these beliefs. Finally I argue that if we employ a semantic truth-predicate rather than just a deflationary one, there surprisingly (...) turns out to be logical space for a response to the improved challenge where no such space appeared to exist. (shrink)

This paper argues that it is scientific realists who should be most concerned about the issue of Platonism and anti-Platonism in mathematics. If one is merely interested in accounting for the practice of pure mathematics, it is unlikely that a story about the ontology of mathematical theories will be essential to such an account. The question of mathematical ontology comes to the fore, however, once one considers our scientific theories. Given that those theories include amongst their laws assertions that imply (...) the existence of mathematical objects, scientific realism, when construed as a claim about the truth or approximate truth of our scientific theories, implies mathematical Platonism. However, a standard argument for scientific realism, the 'no miracles' argument, falls short of establishing mathematical Platonism. As a result, this argument cannot establish scientific realism as it is usually defined, but only some weaker position. Scientific 'realists' should therefore either redefine their position as a claim about the existence of unobservable physical objects, or alternatively look for an argument for their position that does establish mathematical Platonism. (shrink)

Homotopy Type Theory is a putative new foundation for mathematics grounded in constructive intensional type theory that offers an alternative to the foundations provided by ZFC set theory and category theory. This article explains and motivates an account of how to define, justify, and think about HoTT in a way that is self-contained, and argues that, so construed, it is a candidate for being an autonomous foundation for mathematics. We first consider various questions that a foundation for mathematics might be (...) expected to answer, and find that many of them are not answered by the standard formulation of HoTT as presented in the ‘HoTT Book’. More importantly, the presentation of HoTT given in the HoTT Book is not autonomous since it explicitly depends upon other fields of mathematics, in particular homotopy theory. We give an alternative presentation of HoTT that does not depend upon ideas from other parts of mathematics, and in particular makes no reference to homotopy theory, and argue that it is a candidate autonomous foundation for mathematics. Our elaboration of HoTT is based on a new interpretation of types as mathematical concepts, which accords with the intensional nature of the type theory. 1 Introduction2 What Is a Foundation for Mathematics?2.1 A characterization of a foundation for mathematics2.2 Autonomy3 The Basic Features of Homotopy Type Theory3.1 The rules3.2 The basic ways to construct types3.3 Types as propositions and propositions as types3.4 Identity3.5 The homotopy interpretation4 Autonomy of the Standard Presentation?5 The Interpretation of Tokens and Types5.1 Tokens as mathematical objects?5.2 Tokens and types as concepts6 Justifying the Elimination Rule for Identity7 The Foundations of Homotopy Type Theory without Homotopy7.1 Framework7.2 Semantics7.3 Metaphysics7.4 Epistemology7.5 Methodology8 Possible Objections to this Account8.1 A constructive foundation for mathematics?8.2 What are concepts?8.3 Isn’t this just Brouwerian intuitionism?8.4 Duplicated objects8.5 Intensionality and substitution salva veritate9 Conclusion9.1 Advantages of this foundation. (shrink)

Hilbert's program attempts to show that our mathematical knowledge can be certain because we are able to know for certain the truths of elementary arithmetic. I argue that, in the absence of a theory of mathematical truth, Hilbert does not have a complete theory of our arithmetical knowledge. Further, while his deployment of a Kantian notion of intuition seems to promise an answer to scepticism, there is no way to complete Hilbert's epistemology which would answer to his avowed aims.

We are logical pluralists who hold that the right logic is dependent on the domain of investigation; different logics for different mathematical theories. The purpose of this article is to explore the ramifications for our pluralism concerning normativity. Is there any normative role for logic, once we give up its universality? We discuss Florian Steingerger’s “Frege and Carnap on the Normativity of Logic” as a source for possible types of normativity, and then turn to our own proposal, which postulates that (...) various logics are constitutive for thought within particular practices, but none are constitutive for thought as such. (shrink)

In this article, we study the prehistory of type theory up to 1910 and its development between Russell and Whitehead's Principia Mathematica ([71], 1910-1912) and Church's simply typed λ-calculus of 1940. We first argue that the concept of types has always been present in mathematics, though nobody was incorporating them explicitly as such, before the end of the 19th century. Then we proceed by describing how the logical paradoxes entered the formal systems of Frege, Cantor and Peano concentrating on Frege's (...) Grundgesetze der Arithmetik for which Russell applied his famous paradox and this led him to introduce the first theory of types, the Ramified Type Theory (RTT). We present RTT formally using the modern notation for type theory and we discuss how Ramsey, Hilbert and Ackermann removed the orders from RTT leading to the simple theory of types STT. We present STT and Church's own simply typed λ-calculus (λ → C) and we finish by comparing RTT, STT and λ → C. (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)