Ethics and mathematics are normally treated independently in philosophical discussions. When comparisons are drawn between problems in the two areas, those comparisons tend to be highly local, concerning just one or two issues. Nevertheless, certain metaethicists have made bold claims to the effect that moral realism is on “no worse footing” than mathematical realism -- i.e. that one cannot reasonably reject moral realism without also rejecting mathematical realism. In the absence of any remotely systematic survey of the relevant arguments, however, (...) the prima facie plausibility of such claims cannot be usefully judged. There is no way to guess whether the few local parallels that have been observed are symptomatic of pervasive ones. What is needed is a general overview of the relevant dialectical landscape – one which serves to suggest the likely extent of commonality between arguments in ethics and arguments in the philosophy of mathematics. In this survey, I offer such an overview. I consider a wide array of arguments for mathematical realism, and against moral realism, and indiacte analogs to each. I argue that, while nothing definitive can be said at this point, the aforementioned bold claims do have significant prima facie plausibility. In particular, parallels between arguments in metaethics and arguments in the philosophy of mathematics seem to be much more systematic than is commonly supposed. (shrink)

Recent years have seen a growing acknowledgement within the mathematical community that mathematics is cognitively/socially constructed. Yet to anyone doing mathematics, it seems totally objective. The sensation in pursuing mathematical research is of discovering prior (eternal) truths about an external (abstract) world. Although the community can and does decide which topics to pursue and which axioms to adopt, neither an individual mathematician nor the entire community can choose whether a particular mathematical statement is true or false, based on the given (...) axioms. Moreover, all the evidence suggests that all practitioners work with the same ontology. (My number 7 is exactly the same as yours.) How can we reconcile the notion that people construct mathematics, with this apparent choice-free, predetermined objectivity? I believe the answer is to be found by examining what mathematical thinking is (as a mental activity) and the way the human brain acquired the capacity for mathematical thinking. (shrink)

Julian Cole argues that mathematical domains are the products of social construction. This view has an initial appeal in that it seems to salvage much that is good about traditional platonistic realism without taking on the ontological baggage. However, it also has problems. After a brief sketch of social constructivist theories and Cole’s philosophy of mathematics, I evaluate the arguments in favor of social constructivism. I also discuss two substantial problems with the theory. I argue that unless and until social (...) constructivists can address the two concerns, we have reason to be skeptical about social constructivism in the philosophy of mathematics. (shrink)

There is a basic division in the philosophy of mathematics between realist, ‘platonist’ theories and anti-realist ‘constructivist’ theories. Platonism explains how mathematical truth is strongly objective, but it does this at the cost of invoking mind-independent mathematical objects. In contrast, constructivism avoids mind-independent mathematical objects, but the cost tends to be a weakened conception of mathematical truth. Neither alternative seems ideal. The purpose of this paper is to show that in the philosophical writings of Henri Poincaré there is a coherent (...) argument for an interesting position between the two traditional poles in the philosophy of mathematics. Relying on a semi-Kantian framework, Poincaré combines an epistemological and metaphysical constructivism with a more realist account of the nature of mathematical truth. (shrink)

Context: Consistency of mathematical constructions in numerical analysis and the application of computerized proofs in the light of the occurrence of numerical chaos in simple systems. Purpose: To show that a computer in general and a numerical analysis in particular can add its own peculiarities to the subject under study. Hence the need of thorough theoretical studies on chaos in numerical simulation. Hence, a questioning of what e.g. a numerical disproof of a theorem in physics or a prediction in numerical (...) economics could mean. Method: An algebraic simple model system is subjected to a deeper structure of underlying variables. With an algorithm simulating the steps in taking a limit of second order difference quotients the error terms are studied at the background of their algebraic expression. Results: With the algorithm that was applied to a simple quadratic polynomial system we found unstably amplified round-off errors. The possibility of numerical chaos is already known but not in such a simple system as used in our paper. The amplification of the errors implies that it is not possible with computer means to constructively show that the algebra and numerical analysis will ‘on the long run’ converge to each other and the error term will vanish. The algebraic vanishing of the error term cannot be demonstrated with the use of the computer because the round-off errors are amplified. In philosophical terms, the amplification of the round-off error is equivalent to the continuum hypothesis. This means that the requirement of (numerical) construction of mathematical objects is no safeguard against inference-only conclusions of qualities of (numerical) mathematical objects. Unstably amplified round-off errors are a same type of problem as the ordering in size of transfinite cardinal numbers. The difference is that the former problem is created within the requirements of constructive mathematics. This can be seen as the reward for working numerically constructive. (shrink)

I examine various claims to the effect that Cantor's Continuum Hypothesis and other problems of higher set theory are ill-posed questions. The analysis takes into account the viability of the underlying philosophical views and recent mathematical developments.

Hilbert’s program in the philosophy of mathematics comes in two parts. One part is a technical part. To carry out this part of the program one has to prove a certain technical result. The other part of the program is a philosophical part. It is concerned with philosophical questions that are the real aim of the program. To carry out this part one, basically, has to show why the technical part answers the philosophical questions one wanted to have answered. Hilbert (...) probably thought that he had completed the philosophical part of his program, maybe up to a few details. What was left to do was the technical part. To carry it out one, roughly, had to give a precise axiomatization of mathematics and show that it is consistent on purely finitistic grounds. This would come down to giving a relative consistency proof of mathematics in finitist mathematics, or to give a proof-theoretic reduction of mathematics on to finitist mathematics (we will look at these notions in more detail soon). It is widely believed that Gödel’s theorems showed that the technical part of Hilbert’s program could not be carried out. Gödel’s theorems show that the consistency of arithmetic can not even be proven in arithmetic, not to speak of by finitistic means alone. So, the technical part of Hilbert’s program is hopeless, and since Hilbert’s program essentially relied on both the technical and the philosophical part, Hilbert’s program as a whole is hopeless. Justified as this attitude is, it is a bit unfortunate. It is unfortunate because it takes away too much attention from the philosophical part of Hilbert’s program. And this is unfortunate for two reasons. (shrink)

We set out a doctrine about truth for the statements of mathematics—a doctrine which we think is a worthy competitor to realist views in the philosophy of mathematics—and argue that this doctrine, which we shall call 'mathematical relativism', withstands objections better than do other non-realist accounts.

This paper deals with the question of whether there is objectivist truth about set-theoretic matters. The dogmatist and skeptic agree that there is such truth. They disagree about whether this truth is knowable. In contrast, the relativist says there is no objective truth to be known. Two versions of relativism are distinguished in the paper. One of these versions is defended.

Kurt Gödel made many affirmations of robust realism but also showed serious engagement with the idealist tradition, especially with Leibniz, Kant, and Husserl. The root of this apparently paradoxical attitude is his conviction of the power of reason. The paper explores the question of how Gödel read Kant. His argument that relativity theory supports the idea of the ideality of time is discussed critically, in particular attempting to explain the assertion that science can go beyond the appearances and ‘approach the (...) things’. Leibniz and post-Kantian idealism are discussed more briefly, the latter as documented in the correspondence with Gotthard Günther. (shrink)

Vann McGee claims that open-ended schemas are more innocuous than ordinary second-order quantification, particularly in terms of ontological commitment. We argue that this is not the case.

Second-order axiomatizations of certain important mathematical theories—such as arithmetic and real analysis—can be shown to be categorical. Categoricity implies semantic completeness, and semantic completeness in turn implies determinacy of truth-value. Second-order axiomatizations are thus appealing to realists as they sometimes seem to offer support for the realist thesis that mathematical statements have determinate truth-values. The status of second-order logic is a controversial issue, however. Worries about ontological commitment have been influential in the debate. Recently, Vann McGee has argued that one (...) can get some of the technical advantages of second-order axiomatizations—categoricity, in particular—while walking free of worries about ontological commitment. In so arguing he appeals to the notion of an open-ended schema—a schema that holds no matter how the language of the relevant theory is extended. Contra McGee, we argue that second-order quantification and open-ended schemas are on a par when it comes to ontological commitment. (shrink)

Argues that classical arithmetic can be viewed as a proper part of intuitionistic arithmetic. Suggests that this largely neutralizes Dummett's argument for intuitionism in the case of arithmetic.

In his book 'Wittgenstein on the foundations of Mathematics', Crispin Wright notes that remarkably little has been done to provide an unpictorial, substantial account of what mathematical platoninism comes to. Wright proposes to investigate whether there is not some more substantial doctrine than the familiar images underpinning the platonist view. He begins with the suggestion that the essential element in the platonist claim is that mathematical truth is objective. Although he does not demarcate them as such, Wright proposes several different (...) tests for objectivity. The paper finds problems with each of these tests. (shrink)

The purpose of this paper is to apply Crispin Wright’s criteria and various axes of objectivity to mathematics. I test the criteria and the objectivity of mathematics against each other. Along the way, various issues concerning general logic and epistemology are encountered.