Like other mathematically intensive sciences, economics is becoming increasingly computerized. Despite the extent of the computation, however, there is very little true simulation. Simple computation is a form of theory articulation, whereas true simulation is analogous to an experimental procedure. Successful computation is faithful to an underlying mathematical model, whereas successful simulation directly mimics a process or a system. The computer is seen as a legitimate tool in economics only when traditional analytical solutions cannot be derived, i.e., only as a (...) purely computational aid. We argue that true simulation is seldom practiced because it does not fit the conception of understanding inherent in mainstream economics. According to this conception, understanding is constituted by analytical derivation from a set of fundamental economic axioms. We articulate this conception using the concept of economists' perfect model. Since the deductive links between the assumptions and the consequences are not transparent in ‘bottom‐up’ generative microsimulations, microsimulations cannot correspond to the perfect model and economists do not therefore consider them viable candidates for generating theories that enhance economic understanding. (shrink)

This article is a brief formulation of a radical thesis. We start with the formalist doctrine that mathematical objects have no meanings; we have marks and rules governing how these marks can be combined. That's all. Then I go further by arguing that the signs of a formal system of mathematics should be considered as physical objects, and the formal operations as physical processes. The rules of the formal operations are or can be expressed in terms of the laws of (...) physics governing these processes. In accordance with the physicalist understanding of mind, this is true even if the operations in question are executed in the head. A truth obtained through (mathematical) reasoning is, therefore, an observed outcome of a neuro-physiological (or other physical) experiment. Consequently, deduction is nothing but a particular case of induction. (shrink)

The Euclidean ideal of mathematics as well as all the foundational schools in the philosophy of mathematics have been contested by the new approach, called the “maverick” trend in the philosophy of mathematics. Several points made by its main representatives are mentioned – from the revisability of actual proofs to the stress on real mathematical practice as opposed to its idealized reconstruction. Main features of real proofs are then mentioned; for example, whether they are convincing, understandable, and/or explanatory. Therefore, the (...) new approach questions Hilbert’s Thesis, according to which a correct mathematical proof is in principle reducible to a formal proof, based on explicit axioms and logic. (shrink)

Electronic computers form an integral part of modern mathematical practice. Several high-profile results have been proven with techniques where computer calculations form an essential part of the proof. In the traditional philosophical literature, such proofs have been taken to constitute a posteriori knowledge. However, this traditional stance has recently been challenged by Mark McEvoy, who claims that computer calculations can constitute a priori mathematical proofs, even in cases where the calculations made by the computer are too numerous to be surveyed (...) by human agents. In this article we point out the deficits of the traditional literature that has called for McEvoy’s correction. We also explain why McEvoy’s defence of mathematical apriorism fails and we discuss how the debate over the epistemological status of computer-assisted mathematics contains several unfortunate conceptual reductions. (shrink)

In this paper, we focus on the development of geometric cognition. We argue that to understand how geometric cognition has been constituted, one must appreciate not only individual cognitive factors, such as phylogenetically ancient and ontogenetically early core cognitive systems, but also the social history of the spread and use of cognitive artifacts. In particular, we show that the development of Greek mathematics, enshrined in Euclid’s Elements, was driven by the use of two tightly intertwined cognitive artifacts: the use of (...) lettered diagrams; and the creation of linguistic formulae. Together, these artifacts formed the professional language of geometry. In this respect, the case of Greek geometry clearly shows that explanations of geometric reasoning have to go beyond the confines of methodological individualism to account for how the distributed practice of artifact use has stabilized over time. This practice, as we suggest, has also contributed heavily to the understanding of what mathematical proof is; classically, it has been assumed that proofs are not merely deductively correct but also remain invariant over various individuals sharing the same cognitive practice. Cognitive artifacts in Greek geometry constrained the repertoire of admissible inferential operations, which made these proofs inter-subjectively testable and compelling. By focusing on the cognitive operations on artifacts, we also stress that mental mechanisms that contribute to these operations are still poorly understood, in contrast to those mechanisms which drive symbolic logical inference. (shrink)

There are two distinct meanings to ‘mathematical proof’. The connection between them is an unsolved problem. The first step in attacking it is noticing that it is an unsolved problem.

In spite of their practical importance, the connections between technology and mathematics have not received much scholarly attention. This article begins by outlining how the technology–mathematics relationship has developed, from the use of simple aide-mémoires for counting and arithmetic, via the use of mathematics in weaving, building and other trades, and the introduction of calculus to solve technological problems, to the modern use of computers to solve both technological and mathematical problems. Three important philosophical issues emerge from this historical résumé: (...) how mathematical knowledge depends on technology, the definition of the hybrid concept of a computation, and the usefulness of mathematics in technology. Each of these issues is briefly discussed, and it is shown that in order to analyze them, we need to combine tools and ideas from both the philosophy of technology and the philosophy of mathematics. In conclusion, it is argued that much more of interest can be found in the historically and philosophically unexplored terrains of the technology–mathematics relationship. (shrink)

In this paper we apply social epistemology to mathematical proofs and their role in mathematical knowledge. The most famous modern collaborative mathematical proof effort is the Classification of Finite Simple Groups. The history and sociology of this proof have been well-documented by Alma Steingart (2012), who highlights a number of surprising and unusual features of this collaborative endeavour that set it apart from smaller-scale pieces of mathematics. These features raise a number of interesting philosophical issues, but have received very little (...) attention. In this paper, we will consider the philosophical tensions that Steingart uncovers, and use them to argue that the best account of the epistemic status of the Classification Theorem will be essentially and ineliminably social. This forms part of the broader argument that in order to understand mathematical proofs, we must appreciate their social aspects. (shrink)

The distinction between analytic and synthetic propositions, and with that the distinction between a priori and a posteriori truth, is being abandoned in much of analytic philosophy and the philosophy of most of the sciences. These distinctions should also be abandoned in the philosophy of mathematics. In particular, we must recognize the strong empirical component in our mathematical knowledge. The traditional distinction between logic and mathematics, on the one hand, and the natural sciences, on the other, should be dropped. Abstract (...) mathematical objects, like transcendental numbers or Hilbert spaces, are theoretical entities on a par with electromagnetic fields or quarks. Mathematical theories are not primarily logical deductions from axioms obtained by reflection on concepts but, rather, are constructions chosen to solve some collection of problems while fitting smoothly into the other theoretical commitments of the mathematician who formulates them. In other words, a mathematical theory is a scientific theory like any other, no more certain but also no more devoid of content. (shrink)

The pluralist sheds the more traditional ideas of truth and ontology. This is dangerous, because it threatens instability of the theory. To lend stability to his philosophy, the pluralist trades truth and ontology for rigour and other ‘fixtures’. Fixtures are the steady goal posts. They are the parts of a theory that stay fixed across a pair of theories, and allow us to make translations and comparisons. They can ultimately be moved, but we tend to keep them fixed temporarily. Apart (...) from considering rigour of proof as a fixture, I discuss fixed models, invariant notions and fixed information about objects across theories. There are other fixtures, but it is enough to start with these. (shrink)

The philosophy of mathematics has largely abandoned foundational studies, but is still fixated on theorem proving, logic and number theory, and on whether mathematical knowledge is certain. That is not what mathematics looks like to, say, a knot theorist or an industrial mathematical modeller. The "computer revolution" shows that mathematics is a much more direct study of the world, especially its structural aspects.

ABSTRACT This paper examines consequences of the computer revolution in mathematics. By comparing its repercussions with those of conceptual developments that unfolded in the nineteenth century, I argue that the key epistemological lesson to draw from the two transformative periods is that effective and successful mathematical practices in science result from integrating the computational and conceptual styles of mathematics, and not that one of the two styles of mathematical reasoning is superior. Finally, I show that the methodology deployed by applied (...) mathematicians in modern scientific computing is a paradigmatic instance of this key lesson. (shrink)

What grounds the truth of modal statements? And how do we get to know about what is possible or necessary? One of the most prominent anti-realist perspectives on the nature of modality, due to Peter Menzies, is the response-dependent account of modal concepts. Typically, offering a response-dependent account of a concept means defining it in terms of dispositions to elicit certain mental states from suitable agents under suitable circumstances. Menzies grounded possibility and necessity in the conceivability-response of ideal conceivers: P (...) is possible iff an ideal conceiver could conceive that P. I will draw attention to three major objections that can be identified in the modal metaphysics and epistemology literature: Chalmers’ Incoherency Objection, Sherratt’s Transparency Objection and Geirsson’s Irrelevancy Objection. Each of these objections raises a different worry regarding Menzies’ account: that the notion of an ideal conceiver is incoherent, that the account implies a controversial thesis, and that it fails to offer an explanation of our knowledge of modality. The aim of this paper is to defend the response-dependent account of modality against these three objections. (shrink)

In this paper, I assume, perhaps controversially, that translation into a language of formal logic is not the method by which mathematicians assess mathematical reasoning. Instead, I argue that the actual practice of analyzing, evaluating and critiquing mathematical reasoning resembles, and perhaps equates with, the practice of informal logic or argumentation theory. It doesn’t matter whether the reasoning is a full-fledged mathematical proof or merely some non-deductive mathematical justification: in either case, the methodology of assessment overlaps to a large extent (...) with argument assessment in non-mathematical contexts. I demonstrate this claim by considering the assessment of axiomatic or deductive proofs, probabilistic evidence, computer-aided proofs, and the acceptance of axioms. I also consider Jody Azzouni’s ‘derivation indicator’ view of proofs because it places derivations—which may be thought to invoke formal logic—at the center of mathematical justificatory practice. However, when the notion of ‘derivation’ at work in Azzouni’s view is clarified, it is seen to accord with, rather than to count against, the informal logical view I support. Finally, I pose several open questions for the development of a theory of mathematical argument. (shrink)

According to the received view, genuine mathematical justification derives from proofs. In this article, I challenge this view. First, I sketch a notion of proof that cannot be reduced to deduction from the axioms but rather is tailored to human agents. Secondly, I identify a tension between the received view and mathematical practice. In some cases, cognitively diligent, well-functioning mathematicians go wrong. In these cases, it is plausible to think that proof sets the bar for justification too high. I then (...) propose a fallibilist account of mathematical justification. I show that the main function of mathematical justification is to guarantee that the mathematical community can correct the errors that inevitably arise from our fallible practices. (shrink)

Written by experts in the field, this volume presents a comprehensive investigation into the relationship between argumentation theory and the philosophy of mathematical practice. Argumentation theory studies reasoning and argument, and especially those aspects not addressed, or not addressed well, by formal deduction. The philosophy of mathematical practice diverges from mainstream philosophy of mathematics in the emphasis it places on what the majority of working mathematicians actually do, rather than on mathematical foundations. -/- The book begins by first challenging the (...) assumption that there is no role for informal logic in mathematics. Next, it details the usefulness of argumentation theory in the understanding of mathematical practice, offering an impressively diverse set of examples, covering the history of mathematics, mathematics education and, perhaps surprisingly, formal proof verification. From there, the book demonstrates that mathematics also offers a valuable testbed for argumentation theory. Coverage concludes by defending attention to mathematical argumentation as the basis for new perspectives on the philosophy of mathematics. ​. (shrink)

The domain of modal epistemology tackles questions regarding the sources of our knowledge of modalities (i.e., possibility and necessity), and what justifies our beliefs about modalities. Virtue epistemology, on the other hand, aims at explaining epistemological concepts like knowledge and justification in terms of properties of the epistemic subject, i.e., cognitive capacities and character traits. While there is extensive literature on both domains, almost all attempts to analyze modal knowledge elude the importance of the agent’s intellectual character traits in justifying (...) beliefs about what is possible or necessary. My aim in this paper is to argue that intellectual traits of character, like thoroughness, autonomy, epistemic courage and open-mindedness, are relevant to modal epistemology. (shrink)

All accepted proofs of the Four Colour Theorem (4CT) are computer-dependent; and appeal to the existence, and manual identification, of an ‘unavoidable’ set containing a sufficient number of explicitly defined configurations—each evidenced only by a computer as ‘reducible’—such that at least one of the configurations must occur in any chromatically distinguished, minimal, planar map. For instance, Appel and Haken ‘identified’ 1,482 such configurations in their 1977, computer-dependent, proof of 4CT; whilst Neil Robertson et al ‘identified’ 633 configurations as sufficient in (...) their 1997, also computer-dependent, proof of 4CT. However, treating any specific number of ‘reducible’ configurations in an ‘unavoidable’ set as sufficient entails a minimum number as necessary and sufficient. We now show that the minimum number of such configurations can only be the one corresponding to the ‘unavoidable’ set of a ‘reducible’, 4-sided configuration identified by Alfred Kempe in his, seemingly fatally flawed, 1879 ‘proof’ of 4CT. Although Kempe appealed to putative properties of ‘Kempe’ chains in a graphical representation to fallaciously argue that a 5-sided configuration was also in the ‘unavoidable’ set, and ‘reducible’, we shall show why the flaw in his ‘proof’ is not fatal when the argument is expressed geometrically; and that, essentially, Kempe correctly argued that any planar map which admits a chromatic differentiation with a five-sided area C that shares non-zero boundaries with four, all differently coloured, neighbours can be 4-coloured. (shrink)

All acknowledged proofs of the Four Colour Theorem (4CT) are computerdependent. They appeal to the existence, and manual identification, of an ‘unavoidable’ set containing a sufficient number of explicitly defined configurations—each evidenced only by a computer as ‘reducible’—such that at least one of the configurations must occur in any chromatically distinguished, putatively minimal, planar map. For instance, Appel and Haken ‘identified’ 1,482 such configurations in their 1977, computer-dependent, proof of 4CT; whilst Neil Robertson et al ‘identified’ 633 configurations as sufficient (...) in their 1997, also computer-dependent, proof of 4CT. However, treating any specific number of ‘reducible’ configurations in an ‘unavoidable’ set as sufficient entails a minimum number as necessary and sufficient. We now show that the minimum number of such configurations can only be the one corresponding to the ‘unavoidable’ set of the single, ‘reducible’, 4-sided configuration identified by Alfred Kempe in his, seemingly fatally flawed, 1879 ‘proof’ of 4CT. We shall further show that although Kempe fallaciously concluded that a 5-sided configuration was also in the ‘unavoidable’ set, and appealed to unproven properties of ‘Kempe’ chains in a graphical representation to then argue for its ‘reducibility’, neither flaw in his ‘proof’ is fatal when the argument is expressed geometrically; and that, essentially, Kempe correctly argued that any planar map which admits a chromatic differentiation with a five-sided area C that shares non-zero boundaries with four, all differently coloured, neighbours can be 4-coloured. (shrink)

My dissertation focuses on mathematical explanation found in proofs looked at from a historical point of view, while stressing the importance of mathematical practices. Current philosophical theories on explanatory proofs emphasize the structure and content of proofs without any regard to external factors that influence a proof’s explanatory power. As a result, the major philosophical views have been shown to be inadequate in capturing general aspects of explanation. I argue that, in addition to form and content, a proof’s explanatory power (...) depends on its targeted audience. History is useful here, because from it, we are able to follow the transition from a first-generation proof, which is usually non-explanatory, into its explanatory version. By tracking the similarities and differences between these proofs, we are able to gain a better understanding of what makes a proof explanatory according to mathematicians who have the relevant background to evaluate it as so. My first chapter discusses why history is important for understanding mathematical practices. I describe two kinds of history: one that presents a narrative of events, which influenced developments in mathematics both directly and indirectly, and another, typically used in mathematical research, which concentrates only on technical developments. I contend that both versions of the past benefit the philosopher. History used in research gives us an idea of what mathematicians desire or find to be important, while history written by historians shows us what effects these have on mathematical practices. The next two chapters are about explanatory proofs. My second chapter examines the main theories of mathematical explanation. I argue that these theories are short-sighted as they only consider what appears in a proof without considering the proof’s purported audience or background knowledge necessary to understand the proof. In the third chapter, I propose an alternative way of analyzing explanatory proofs. Here, I suggest looking at a theorem’s history, which includes its successive proofs, as well as the mathematicians who wrote them. From this, we can better understand how and why mathematicians prove theorems in multiple ways, which depends on the purposes of these theorems. The last chapter is a case study on the computer proof of the Four Color Theorem by Appel and Haken. Here, I compare and contrast what philosophers and mathematicians have had to say about the proof. I argue that the main philosophical worry regarding the theorem—its unsurveyability—did not make a strong impact on the mathematical community and would have hindered mathematical development in computer-assisted proofs. By studying the history of the theorem, we learn that Appel and Haken relied on the strategy of Kempe’s flawed proof from the 1800s (which, obviously, did not involve a computer). Two later proofs, also aided by computer, were developed using similar methods. None of these proofs are explanatory, but not because of their massive lengths. Rather, the methods used in these proofs are a series of calculations that exhaust all possible configurations of maps. (shrink)

Mathematicians often speak of conjectures, yet unproved, as probable or well-confirmed by evidence. The Riemann Hypothesis, for example, is widely believed to be almost certainly true. There seems no initial reason to distinguish such probability from the same notion in empirical science. Yet it is hard to see how there could be probabilistic relations between the necessary truths of pure mathematics. The existence of such logical relations, short of certainty, is defended using the theory of logical probability (or objective Bayesianism (...) or non-deductive logic), and some detailed examples of its use in mathematics surveyed. Examples of inductive reasoning in experimental mathematics are given and it is argued that the problem of induction is best appreciated in the mathematical case. (shrink)

Douglas Walton’s multitudinous contributions to the study of argumentation seldom, if ever, directly engage with argumentation in mathematics. Nonetheless, several of the innovations with which he is most closely associated lend themselves to improving our understanding of mathematical arguments. I concentrate on two such innovations: dialogue types (§1) and argumentation schemes (§2). I argue that both devices are much more applicable to mathematical reasoning than may be commonly supposed.

Informal logic is a method of argument analysis which is complementary to that of formal logic, providing for the pragmatic treatment of features of argumentation which cannot be reduced to logical form. The central claim of this paper is that a more nuanced understanding of mathematical proof and discovery may be achieved by paying attention to the aspects of mathematical argumentation which can be captured by informal, rather than formal, logic. Two accounts of argumentation are considered: the pioneering work of (...) Stephen Toulmin [The uses of argument, Cambridge University Press, 1958] and the more recent studies of Douglas Walton, [e.g. The new dialectic: Conversational contexts of argument, University of Toronto Press, 1998]. The focus of both of these approaches has largely been restricted to natural language argumentation. However, Walton’s method in particular provides a fruitful analysis of mathematical proof. He offers a contextual account of argumentational strategies, distinguishing a variety of different types of dialogue in which arguments may occur. This analysis represents many different fallacious or otherwise illicit arguments as the deployment of strategies which are sometimes admissible in contexts in which they are inadmissible. I argue that mathematical proofs are deployed in a greater variety of types of dialogue than has commonly been assumed. I proceed to show that many of the important philosophical and pedagogical problems of mathematical proof arise from a failure to make explicit the type of dialogue in which the proof is introduced. (shrink)

The Four-Colour Theorem (4CT) proof, presented to the mathematical community in a pair of papers by Appel and Haken in the late 1970's, provoked a series of philosophical debates. Many conceptual points of these disputes still require some elucidation. After a brief presentation of the main ideas of Appel and Haken’s procedure for the proof and a reconstruction of Thomas Tymoczko’s argument for the novelty of 4CT’s proof, we shall formulate some questions regarding the connections between the points raised by (...) Tymoczko and some Wittgensteinian topics in the philosophy of mathematics such as the importance of the surveyability as a criterion for distinguishing mathematical proofs from empirical experiments. Our aim is to show that the “characteristic Wittgensteinian invention” (Mühlhölzer 2006) – the strong distinction between proofs and experiments – can shed some light in the conceptual confusions surrounding the Four-Colour Theorem. (shrink)

Conventional accounts of epistemic opacity, particularly those that stem from the definitive work of Paul Humphreys, typically point to limitations on the part of epistemic agents to account for the distinct ways in which systems, such as computational methods and devices, are opaque. They point, for example, to the lack of technical skill on the part of an agent, the failure to meet standards of best practice, or even the nature of an agent as reasons why epistemically relevant elements of (...) a process may be inaccessible. In this paper I argue that there are certain instances of epistemic opacity— particularly in computational methods such a computer simulations and machine learning processes—that do not arise from, are not responsive to, and are therefore not explained by the epistemic limitations of an agent. I call these instances agent-neutral and agent-independent instances of epistemic opacity respectively. As a result, I also argue that conventional accounts of epistemic opacity offer a limited understanding of the full spectrum of kinds and sources of epistemic opacity, particularly of the kind found in computational methods. In particular, as I will show below, the limitations of these accounts are reflected in the way they fail to provide satisfactory explanations when faced with certain instances of opacity. (shrink)

O tendinţă relativ nouă în filosofia contemporană a matematicii este reprezentată de nemulţumirea manifestată de un număr din ce în ce mai mare de filosofi faţă de viziunea tradiţională asupra matematicii ca având un statut special ce poate fi surprins doar cu ajutorul unei epistemologii speciale. Această nemulţumire i-a determinat pe mulţi să propună o nouă perspectivă asupra matematicii – una care ia în serios aspecte până acum neglijate de filosofia matematicii, precum latura sociologică, istorică şi empirică a cercetării matematice (...) şi care acordă astfel o atenţie deosebită practicii matematice. (shrink)