Mathematical diagrams are frequently used in contemporary mathematics. They are, however, widely seen as not contributing to the justificatory force of proofs: they are considered to be either mere illustrations or shorthand for non-diagrammatic expressions. Moreover, when they are used inferentially, they are seen as threatening the reliability of proofs. In this paper, I examine certain examples of diagrams that resist this type of dismissive characterization. By presenting two diagrammatic proofs, one from topology and one from algebra, I show (...) that diagrams form genuine notational systems, and I argue that this explains why they can play a role in the inferential structure of proofs without undermining their reliability. I then consider whether diagrams can be essential to the proofs in which they appear. (shrink)

Although traditionally neglected, mathematical diagrams have recently begun to attract attention from philosophers of mathematics. By now, the literature includes several case studies investigating the role of diagrams both in discovery and justification. Certain preliminary questions have, however, been mostly bypassed. What are diagrams exactly? Are there different types of diagrams? In the scholarly literature, the term “mathematical diagram” is used in diverse ways. I propose a working definition that carves out the phenomena that are of most importance (...) for a taxonomy of diagrams in the context of a practice-based philosophy of mathematics, privileging examples from contemporary mathematics. In doing so, I move away from vague, ordinary notions. I define mathematical diagrams as forming notational systems and as being geometric/topological representations or two-dimensional representations. I also examine the relationship between mathematical diagrams and spatiotemporal intuition. By proposing an explication of diagrams, I explain certain controversies in the existing literature. Moreover, I shed light on why mathematical diagrams are so effective in certain instances, and, at other times, dangerously misleading. (shrink)

Why study notations, diagrams, or more broadly the variety of nonverbal “representations” or “signs” that are used in mathematical practice? This chapter maps out recent work on the topic by distinguishing three main philosophical motivations for doing so. First, some work (like that on diagrammatic reasoning) studies signs to recover norms of informal or historical mathematical practices that would get lost if the particular signs that these practices rely on were translated away; work in this vein has the (...) potential to broaden our view of the specific normativity of mathematics beyond logical proof. Second, some work focuses on signs to highlight the open-ended and “nonrigorous” aspects of mathematical practice, and the role of these aspects in the historical development of mathematics. The third motivation is based on the following observation: the reason differences in signs matter in mathematics is that humans are finite agents, with cognitive and computational limitations. Accordingly, studying signs can be a way to study how human computational constraints shape the mathematics that we do, and to tackle the topic of mathematical understanding. (shrink)

The aim of this article is to investigate the roles of commutative diagrams (CDs) in a specific mathematical domain, and to unveil the reasons underlying their effectiveness as a mathematical notation; this will be done through a case study. It will be shown that CDs do not depict spatial relations, but represent mathematical structures. CDs will be interpreted as a hybrid notation that goes beyond the traditional bipartition of mathematical representations into diagrammatic and linguistic. It will (...) be argued that one of the reasons why CDs form a good notation is that they are highly mathematically tractable: experts can obtain valid results by ‘calculating’ with CDs. These calculations, take the form of ‘diagram chases’. In order to draw inferences, experts move algebraic elements around the diagrams. It will be argued that these diagrams are dynamic. It is thanks to their dynamicity that CDs can externalize the relevant reasoning and allow experts to draw conclusions directly by manipulating them. Lastly, it will be shown that CDs play essential roles in the context of proof as well as in other phases of the mathematical enterprise, such as discovery and conjecture formation. (shrink)

One of the most fundamental questions in the philosophy of mathematics concerns the relation between truth and formal proof. The position according to which the two concepts are the same is called deflationism, and the opposing viewpoint substantialism. In an important result of mathematical logic, Kurt Gödel proved in his first incompleteness theorem that all consistent formal systems containing arithmetic include sentences that can neither be proved nor disproved within that system. However, such undecidable Gödel sentences can be (...) established to be true once we expand the formal system with Alfred Tarski s semantical theory of truth, as shown by Stewart Shapiro and Jeffrey Ketland in their semantical arguments for the substantiality of truth. According to them, in Gödel sentences we have an explicit case of true but unprovable sentences, and hence deflationism is refuted. -/- Against that, Neil Tennant has shown that instead of Tarskian truth we can expand the formal system with a soundness principle, according to which all provable sentences are assertable, and the assertability of Gödel sentences follows. This way, the relevant question is not whether we can establish the truth of Gödel sentences, but whether Tarskian truth is a more plausible expansion than a soundness principle. In this work I will argue that this problem is best approached once we think of mathematics as the full human phenomenon, and not just consisting of formal systems. When pre-formal mathematical thinking is included in our account, we see that Tarskian truth is in fact not an expansion at all. I claim that what proof is to formal mathematics, truth is to pre-formal thinking, and the Tarskian account of semantical truth mirrors this relation accurately. -/- However, the introduction of pre-formal mathematics is vulnerable to the deflationist counterargument that while existing in practice, pre-formal thinking could still be philosophically superfluous if it does not refer to anything objective. Against this, I argue that all truly deflationist philosophical theories lead to arbitrariness of mathematics. In all other philosophical accounts of mathematics there is room for a reference of the pre-formal mathematics, and the expansion of Tarkian truth can be made naturally. Hence, if we reject the arbitrariness of mathematics, I argue in this work, we must accept the substantiality of truth. Related subjects such as neo-Fregeanism will also be covered, and shown not to change the need for Tarskian truth. -/- The only remaining route for the deflationist is to change the underlying logic so that our formal languages can include their own truth predicates, which Tarski showed to be impossible for classical first-order languages. With such logics we would have no need to expand the formal systems, and the above argument would fail. From the alternative approaches, in this work I focus mostly on the Independence Friendly (IF) logic of Jaakko Hintikka and Gabriel Sandu. Hintikka has claimed that an IF language can include its own adequate truth predicate. I argue that while this is indeed the case, we cannot recognize the truth predicate as such within the same IF language, and the need for Tarskian truth remains. In addition to IF logic, also second-order logic and Saul Kripke s approach using Kleenean logic will be shown to fail in a similar fashion. (shrink)

In this paper, I propose that applying the methods of data science to “the problem of whether mathematical explanations occur within mathematics itself” (Mancosu 2018) might be a fruitful way to shed new light on the problem. By carefully selecting indicator words for explanation and justification, and then systematically searching for these indicators in databases of scholarly works in mathematics, we can get an idea of how mathematicians use these terms in mathematical practice and with what frequency. The (...) results of this empirical study suggest that mathematical explanations do occur in research articles published in mathematics journals, as indicated by the occurrence of explanation indicators. When compared with the use of justification indicators, however, the data suggest that justifications occur much more frequently than explanations in scholarly mathematical practice. The results also suggest that justificatory proofs occur much more frequently than explanatory proofs, thus suggesting that proof may be playing a larger justificatory role than an explanatory role in scholarly mathematical practice. (shrink)

Rigorous proof is supposed to guarantee that the premises invoked imply the conclusion reached, and the problem of rigor may be described as that of bringing together the perspectives of formal logic and mathematical practice on how this is to be achieved. This problem has recently raised a lot of discussion among philosophers of mathematics. We survey some possible solutions and argue that failure to understand its terms properly has led to misunderstandings in the literature.

The objective of this article is twofold. First, a methodological issue is addressed. It is pointed out that even if philosophers of mathematics have been recently more and more concerned with the practice of mathematics, there is still a need for a sharp definition of what the targets of a philosophy of mathematical practice should be. Three possible objects of inquiry are put forward: (1) the collective dimension of the practice of mathematics; (2) the cognitives capacities requested to the (...) practitioners; and (3) the specific forms of representation and notation shared and selected by the practitioners. Moreover, it is claimed that a broadening of the notion of ‘permissible action’ as introduced by Larvor (2012) with respect to mathematical arguments, allows for a consideration of all these three elements simultaneously. Second, a case from topology – the proof of Alexander’s theorem – is presented to illustrate a concrete analysis of a mathematical practice and to exemplify the proposed method. It is discussed that the attention to the three elements of the practice identified above brings to the emergence of philosophically relevant features in the practice of topology: the need for a revision in the definition of criteria of validity, the interest in tracking the operations that are performed on the notation, and the constant and fruitful back-and-forth from one representation to another in dealing with mathematical content. Finally, some suggestions for further research are given in the conclusions. (shrink)

We argue that Wittgenstein’s philosophical perspective on Gödel’s most famous theorem is even more radical than has commonly been assumed. Wittgenstein shows in detail that there is no way that the Gödelian construct of a string of signs could be assigned a useful function within (ordinary) mathematics. — The focus is on Appendix III to Part I of Remarks on the Foundations of Mathematics. The present reading highlights the exceptional importance of this particular set of remarks and, more specifically, emphasises (...) its refined composition and rigorous internal structure. (shrink)

Robert Brandom’s expressivism argues that not all semantic content may be made fully explicit. This view connects in interesting ways with recent movements in philosophy of mathematics and logic (e.g. Brown, Shin, Giaquinto) to take diagrams seriously - as more than a mere “heuristic aid” to proof, but either proofs themselves, or irreducible components of such. However what exactly is a diagram in logic? Does this constitute a semiotic natural kind? The paper will argue that such a natural kind does (...) exist in Charles Peirce’s conception of iconic signs, but that fully understood, logical diagrams involve a structured array of normative reasoning practices, as well as just a “picture on a page”. (shrink)

Gaisi Takeuti extended Gentzen's work to higher-order case in 1950's–1960's and proved the consistency of impredicative subsystems of analysis. He has been chiefly known as a successor of Hilbert's school, but we pointed out in the previous paper that Takeuti's aimed to investigate the relationships between "minds" by carrying out his proof-theoretic project rather than proving the "reliability" of such impredicative subsystems of analysis. Moreover, as briefly explained there, his philosophical ideas can be traced back to Nishida's philosophy in Kyoto's (...) school. For the proving the consistency of such systems, it is crucial to prove the well-foundedness of ordinals called "ordinal diagrams" developed for it. Takeuti presented such arguments several times in order to show that they are admitted in his stand point. As a starting point of investigating his finitist stand point, we formulate the system of ordinal notations up to ε0 and reconstruct the well-foundedness arguments of them. (shrink)

This chapter examines the pioneering work of Gottfried Wilhelm Leibniz (1646-1716) on various number systems, in particular binary, which he independently invented in the mid-to-late 1670s, and hexadecimal, which he invented in 1679. The chapter begins with the oft-debated question of who may have influenced Leibniz’s invention of binary, though as none of the proposed candidates is plausible I suggest a different hypothesis, that Leibniz initially developed binary notation as a tool to assist his investigations in mathematical problems that (...) were exercising him at the time, namely those concerning the divisibility of composite numbers, primality, and perfect numbers. The chapter then explores Leibniz’s development of binary, his little-known work on binary fractions and expansions, his use of binary as a symbol for creation in his philosophical-theology, and his response to the suggestion that there was a correlation between binary numeration and the hexagrams of the ancient Chinese divinatory text, the Yijing. The chapter then focuses on Leibniz’s work on other number systems, in particular his invention and exploration of hexadecimal as well as his work on duodecimal. The chapter concludes by revealing a hitherto unknown practical application of binary that Leibniz devised in the last year of his life. (shrink)

Reverse mathematics studies which subsystems of second order arithmetic are equivalent to key theorems of ordinary, non-set-theoretic mathematics. The main philosophical application of reverse mathematics proposed thus far is foundational analysis, which explores the limits of different foundations for mathematics in a formally precise manner. This paper gives a detailed account of the motivations and methodology of foundational analysis, which have heretofore been largely left implicit in the practice. It then shows how this account can be fruitfully applied in the (...) evaluation of major foundational approaches by a careful examination of two case studies: a partial realization of Hilbert’s program due to Simpson [1988], and predicativism in the extended form due to Feferman and Schütte. -/- Shore [2010, 2013] proposes that equivalences in reverse mathematics be proved in the same way as inequivalences, namely by considering only omega-models of the systems in question. Shore refers to this approach as computational reverse mathematics. This paper shows that despite some attractive features, computational reverse mathematics is inappropriate for foundational analysis, for two major reasons. Firstly, the computable entailment relation employed in computational reverse mathematics does not preserve justification for the foundational programs above. Secondly, computable entailment is a Pi-1-1 complete relation, and hence employing it commits one to theoretical resources which outstrip those available within any foundational approach that is proof-theoretically weaker than Pi-1-1-CA0. (shrink)

Until recently, discussion of virtues in the philosophy of mathematics has been fleeting and fragmentary at best. But in the last few years this has begun to change. As virtue theory has grown ever more influential, not just in ethics where virtues may seem most at home, but particularly in epistemology and the philosophy of science, some philosophers have sought to push virtues out into unexpected areas, including mathematics and its philosophy. But there are some mathematicians already there, ready to (...) meet them, who have explicitly invoked virtues in discussing what is necessary for a mathematician to succeed. In both ethics and epistemology, virtue theory tends to emphasize character virtues, the acquired excellences of people. But people are not the only sort of thing whose excellences may be identified as virtues. Theoretical virtues have attracted attention in the philosophy of science as components of an account of theory choice. Within the philosophy of mathematics, and mathematics itself, attention to virtues has emerged from a variety of disparate sources. Theoretical virtues have been put forward both to analyse the practice of proof and to justify axioms; intellectual virtues have found multiple applications in the epistemology of mathematics; and ethical virtues have been offered as a basis for understanding the social utility of mathematical practice. Indeed, some authors have advocated virtue epistemology as the correct epistemology for mathematics (and perhaps even as the basis for progress in the metaphysics of mathematics). This topical collection brings together several of the researchers who have begun to study mathematical practices from a virtue perspective with the intention of consolidating and encouraging this trend. (shrink)

Mathematicians distinguish between proofs that explain their results and those that merely prove. This paper explores the nature of explanatory proofs, their role in mathematical practice, and some of the reasons why philosophers should care about them. Among the questions addressed are the following: what kinds of proofs are generally explanatory (or not)? What makes a proof explanatory? Do all mathematical explanations involve proof in an essential way? Are there really such things as explanatory proofs, and if so, (...) how do they relate to the sorts of explanation encountered in philosophy of science and metaphysics? (shrink)

Mathematicians often speak of conjectures as being confirmed by evidence that falls short of proof. For their own conjectures, evidence justifies further work in looking for a proof. Those conjectures of mathematics that have long resisted proof, such as the Riemann hypothesis, have had to be considered in terms of the evidence for and against them. In recent decades, massive increases in computer power have permitted the gathering of huge amounts of numerical evidence, both for conjectures in pure mathematics and (...) for the behavior of complex applied mathematical models and statistical algorithms. Mathematics has therefore become (among other things) an experimental science (though that has not diminished the importance of proof in the traditional style). We examine how the evaluation of evidence for conjectures works in mathematical practice. We explain the (objective) Bayesian view of probability, which gives a theoretical framework for unifying evidence evaluation in science and law as well as in mathematics. Numerical evidence in mathematics is related to the problem of induction; the occurrence of straightforward inductive reasoning in the purely logical material of pure mathematics casts light on the nature of induction as well as of mathematical reasoning. (shrink)

We examine the influence of word choices on mathematical practice, i.e. in developing definitions, theorems, and proofs. As a case study, we consider Euclid’s and Euler’s word choices in their influential developments of geometry and, in particular, their use of the term ‘polyhedron’. Then, jumping to the twentieth century, we look at word choices surrounding the use of the term ‘polyhedron’ in the work of Coxeter and of Grünbaum. We also consider a recent and explicit conflict of approach between (...) Grünbaum and Shephard on the one hand and that of Hilton and Pedersen on the other, elucidating that the conflict was engendered by disagreement over the proper conceptualization, and so also the appropriate word choices, in the study of polyhedra. (shrink)

This short paper grew out of an observation—made in the course of a larger research project—of a surprising convergence between, on the one hand, certain themes in the work of Mary Hesse and Nelson Goodman in the 1950/60s and, on the other hand, recent work on the representational resources of science, in particular regarding model-based representation. The convergence between these more recent accounts of representation in science and the earlier proposals by Hesse and Goodman consists in the recognition that, in (...) order to secure successful representation in science, collective representational resources must be available. Such resources may take the form of (amongst others) mathematical formalisms, diagrammatic methods, notational rules, or—in the case of material models—conventions regarding the use and manipulation of the constituent parts. More often than not, an abstract characterization of such resources tells only half the story, as they are constituted equally by the pattern of (practical and theoretical) activities—such as instances of manipulation or inference—of the researchers who deploy them. In other words, representational resources need to be sustained by a social practice; this is what renders them collective representational resources in the first place. (shrink)

This work is a conceptual analysis of certain recent developments in the mathematical foundations of Classical and Quantum Mechanics which have allowed to formulate both theories in a common language. From the algebraic point of view, the set of observables of a physical system, be it classical or quantum, is described by a Jordan-Lie algebra. From the geometric point of view, the space of states of any system is described by a uniform Poisson space with transition probability. (...) Both these structures are here perceived as formal translations of the fundamental twofold role of properties in Mechanics: they are at the same time quantities and transformations. The question becomes then to understand the precise articulation between these two roles. The analysis will show that Quantum Mechanics can be thought as distinguishing itself from Classical Mechanics by a compatibility condition between properties-as-quantities and properties-as-transformations. -/- Moreover, this dissertation shows the existence of a tension between a certain "abstract way" of conceiving mathematical structures, used in the practice of mathematical physics, and the necessary capacity to specify particular states or observables. It then becomes important to understand how, within the formalism, one can construct a labelling scheme. The “Chase for Individuation” is the analysis of different mathematical techniques which attempt to overcome this tension. In particular, we discuss how group theory furnishes a partial solution. (shrink)

Computer assisted theorem proving is an increasingly important part of mathematical methodology, as well as a long-standing topic in artificial intelligence (AI) research. However, the current generation of theorem proving software have limited functioning in terms of providing new proofs. Importantly, they are not able to discriminate interesting theorems and proofs from trivial ones. In order for computers to develop further in theorem proving, there would need to be a radical change in how the software functions. Recently, machine learning (...) results in solving mathematical tasks have shown early promise that deep artificial neural networks could learn symbolic mathematical processing. In this paper, I analyze the theoretical prospects of such neural networks in proving mathematical theorems. In particular, I focus on the question how such AI systems could be incorporated in practice to theorem proving and what consequences that could have. In the most optimistic scenario, this includes the possibility of autonomous automated theorem provers (AATP). Here I discuss whether such AI systems could, or should, become accepted as active agents in mathematical communities. (shrink)

The published works of scientists often conceal the cognitive processes that led to their results. Scholars of mathematical practice must therefore seek out less obvious sources. This article analyzes a widely circulated mathematical joke, comprising a list of spurious proof types. An account is proposed in terms of argumentation schemes: stereotypical patterns of reasoning, which may be accompanied by critical questions itemizing possible lines of defeat. It is argued that humor is associated with risky forms of inference, which (...) are essential to creative mathematics. The components of the joke are explicated by argumentation schemes devised for application to topic-neutral reasoning. These in turn are classified under seven headings: retroduction, citation, intuition, meta-argument, closure, generalization, and definition. Finally, the wider significance of this account for the cognitive science of mathematics is discussed. (shrink)

This is a teaching and learning guide to accompany "Explanation in Mathematics: Proofs and Practice".

Review of Dowek, Gilles, Computation, Proof, Machine, Cambridge University Press, Cambridge, 2015. Translation of Les Métamorphoses du calcul, Le Pommier, Paris, 2007. Translation from the French by Pierre Guillot and Marion Roman.

This paper studies proof systems for the logics of super-strict implication ST2–ST5, which correspond to C.I. Lewis’ systems S2–S5 freed of paradoxes of strict implication. First, Hilbert-style axiomatic systems are introduced and shown to be sound and complete by simulating STn in Sn and backsimulating Sn in STn, respectively(for n=2,...,5). Next, G3-style labelled sequent calculi are investigated. It is shown that these calculi have the good structural properties that are distinctive of G3-style calculi, that they are sound and complete, and (...) it is shown that the proof search for G3. ST2 is terminating and therefore the logic is decidable. (shrink)

This study examines problems related to the representation of music. It constructs the sender/message/perceiver/result model, a prototype broad enough to incorporate a large variety of music and other notation systems, including those having to do with computers. The work defines music notation itself, describes various models for studying the subject--including the binary types prescriptive/descriptive, and symbolic/iconic--and assesses music notation as a contemporary practice. It encompasses a review of the actions and intentions of composers, performers, and audiences, and a consideration of (...) the message and how it is affected by media , reference systems , and meanings. Finally, through an examination of the possibilities of the self acting as a notation system within models posited by feminist and queer theory, I attempt to demonstrate the power of notation to affect other systems and worlds, including the worlds of music, art, and politics. ;The consideration of these topics draws on theories from linguistics, semiotics, structuralism, post-structuralism, cybernetics, and music, as well as the philosophies of John Cage, Jean-Jacques Nattiez, Nelson Goodman, and others. The work examines various languages and applications used to program computers for musical purposes, though this examination does not incorporate programs dedicated exclusively to printing music. Nor does the study focus on non-Western notations, suggestions for reforms of notation, or encyclopedic lists of notation devices. ;The expository writing is augmented by excerpts from material I gathered in numerous interviews. There are separate sections containing interviews of Leonard Meyer, Allan Kaprow, John Cage, Earle Brown, Roger Reynolds, and Heidi von Gunden. There is also a large, partially-annotated bibliography. ;My hope is that an inclusive, interdisciplinary exploration of music notation will be useful in broadening the theoretical and creative boundaries of the field, as well as bridging gaps among musicians using various music technologies, and artists and theorists from diverse fields and perspectives. (shrink)

Let mathematical justification be the kind of justification obtained when a mathematician provides a proof of a theorem. Are Gettier cases possible for this kind of justification? At first sight we might think not: The standard for mathematical justification is proof and, since proof is bound at the hip with truth, there is no possibility of having an epistemically lucky justification of a true mathematical proposition. In this paper, I argue that Gettier cases are possible (and indeed (...) actual) in mathematical reasoning. By analysing these cases, I suggest that the Gettier phenomenon indicates some upshots for actual mathematical practice. (shrink)

The traditional view of evidence in mathematics is that evidence is just proof and proof is just derivation. There are good reasons for thinking that this view should be rejected: it misrepresents both historical and current mathematical practice. Nonetheless, evidence, proof, and derivation are closely intertwined. This paper seeks to tease these concepts apart. It emphasizes the role of argumentation as a context shared by evidence, proofs, and derivations. The utility of argumentation theory, in general, and argumentation schemes, in (...) particular, as a methodology for the study of mathematical practice is thereby demonstrated. Argumentation schemes represent an almost untapped resource for mathematics education. Notably, they provide a consistent treatment of rigorous and non-rigorous argumentation, thereby working to exhibit the continuity of reasoning in mathematics with reasoning in other areas. Moreover, since argumentation schemes are a comparatively mature methodology, there is a substantial body of existing work to draw upon, including some increasingly sophisticated software tools. Such tools have significant potential for the analysis and evaluation of mathematical argumentation. The first four sections of the paper address the relationships of evidence to proof, proof to derivation, argument to proof, and argument to evidence, respectively. The final section directly addresses some of the educational implications of an argumentation scheme account of mathematical reasoning. (shrink)

A proof P of a theorem T is transferable when a typical expert can become convinced of T solely on the basis of their prior knowledge and the information contained in P. Easwaran has argued that transferability is a constraint on acceptable proof. Meanwhile, a proof P is fixable when it’s possible for other experts to correct any mistakes P contains without having to develop significant new mathematics. Habgood-Coote and Tanswell have observed that some acceptable proofs are both fixable and (...) in need of fixing, in the sense that they contain nontrivial mistakes. The claim that acceptable proofs must be transferable seems quite plausible. The claim that some acceptable proofs need fixing seems plausible too. Unfortunately, these attractive suggestions stand in tension with one another. I argue that the transferability requirement is the problem. Acceptable proofs need only satisfy a weaker requirement I call “corrigibility”. I explain why, despite appearances, the corrigibility standard is preferable to stricter alternatives. (shrink)

Using as case studies two early diagrams that represent mechanisms of the cell division cycle, we aim to extend prior philosophical analyses of the roles of diagrams in scientific reasoning, and specifically their role in biological reasoning. The diagrams we discuss are, in practice, integral and indispensible elements of reasoning from experimental data about the cell division cycle to mathematical models of the cycle’s molecular mechanisms. In accordance with prior analyses, the diagrams provide functional explanations of the cell cycle (...) and facilitate the construction of mathematical models of the cell cycle. But, extending beyond those analyses, we show how diagrams facilitate the construction of mathematical models, and we argue that the diagrams permit nomological explanations of the cell cycle. We further argue that what makes diagrams integral and indispensible for explanation and model construction is their nature as locality aids: they group together information that is to be used together in a way that sentential representations do not. (shrink)

Monsters lurk within mathematical as well as literary haunts. I propose to trace some pathways between these two monstrous habitats. I start from Jeffrey Jerome Cohen’s influential account of monster culture and explore how well mathematical monsters fit each of his seven theses. The mathematical monsters I discuss are drawn primarily from three distinct but overlapping domains. Firstly, late nineteenth-century mathematicians made numerous unsettling discoveries that threatened their understanding of their own discipline and challenged their intuitions. The (...) great French mathematician Henri Poincaré characterised these anomalies as ‘monsters’, a name that stuck. Secondly, the twentieth-century philosopher Imre Lakatos composed a seminal work on the nature of mathematical proof, in which monsters play a conspicuous role. Lakatos coined such terms as ‘monster-barring’ and ‘monster-adjusting’ to describe strategies for dealing with entities whose properties seem to falsify a conjecture. Thirdly, and most recently, mathematicians dubbed the largest of the sporadic groups ‘the Monster’, because of its vast size and uncanny properties, and because its existence was suspected long before it could be confirmed. (shrink)

This paper presents a diagrammatic notation for visualizing epistemic entities and relations. The notation was created during the Visualizing Worldviews project funded by the University of Toronto’s Jackman Humanities Institute and has been further developed by the scholars participating in the university’s Research Opportunity Program. Since any systematic diagrammatic notation should be based on a solid ontology of the respective domain, we first outline the current state of the scientonomic ontology. We then proceed to providing diagrammatic tools for visualizing the (...) epistemic entities and relations of this ontology. These basic diagramming techniques allow us to construct diagrams of various types for both synchronic and diachronic visualizations. The paper concludes by highlighting some future research directions. As the notation presented here is de facto accepted and used in scientonomy, the paper suggests no modifications. (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)

An Aristotelian Philosophy of Mathematics breaks the impasse between Platonist and nominalist views of mathematics. Neither a study of abstract objects nor a mere language or logic, mathematics is a science of real aspects of the world as much as biology is. For the first time, a philosophy of mathematics puts applied mathematics at the centre. Quantitative aspects of the world such as ratios of heights, and structural ones such as symmetry and continuity, are parts of the physical world and (...) are objects of mathematics. Though some mathematical structures such as infinities may be too big to be realized in fact, all of them are capable of being realized. Informed by the author's background in both philosophy and mathematics, but keeping to simple examples, the book shows how infant perception of patterns is extended by visualization and proof to the vast edifice of modern pure and applied mathematical knowledge. (shrink)

Bioinformatics scientists often describe their own scientific activities as the practice of working with large amounts of data using computing devices. An essential part of their self-identification is also the development of ways to visually represent the results of this work. Some of these methods are aimed at building convenient representations of data and demonstrating patterns present in them (graphics, diagrams, graphs). Others are ways of visualizing objects that are not directly accessible to human perception (microphotography, X-ray). Both the construction (...) of visualizations and (especially) the creation of new computer visualization methods are considered in bioinformatics as significant scientific achievements. Representations of the three-dimensional structure of protein molecules play a special role in the inquiries of bioinformatics scientists. 3D-visualization of a macromolecule, on the one hand, is, like a graph, a representation of the results of computer processing of data arrays obtained by material methods – spatiotemporal coordinates of structural elements of the molecule. On the other hand, like microphotography, these 3D structures should serve as accurate representations of specific scientific objects. This leads to the parallel existence of two contradictory epistemic regimes: creative arbitrariness in making convenient, communicatively successful models, is combined with commitment to the object “as it really is”. The paradox is reinforced by the fact that the scientific study of objects in question (determining the properties of the structure, its functions, comparison with other structures) by means of computers does not require visualization at all. Its obviously high value for bioinformatics does not look justified if we take into account the prominent artificiality and artistry of the resulting images. However, the status of these images becomes clearer if we relate them to earlier notions of the role of the visual in scientific discovery. The highest estimation of visualization as the final result of scientific research was characteristic of Renaissance science. The artistic representation of ideal essential properties, instead of a strict correspondence to a particular biological object, is an epistemic virtue typical of the naturalists of the 17th and 18th centuries. Both suggested a close collaboration between the scientist and the artist; and standards for visualizing macromolecules in bioinformatics grow out of a similar collaboration (Geis’ drawings). The desire for maximum accuracy and detail inherits the regulation of “mechanical objectivity” (as Daston and Galison put it into words), for which it is also important to eliminate humans from the image production process (in bioinformatics, to transfer these functions to computer programs). Thus, 3D-visualization of protein structures bears traces of historically different value orientations, but the scientific practice of the 20th and 21st centuries, supplemented by computer technologies, allows them to be intertwined in particular disciplinary units. (shrink)

In “Models and Reality” (1980), Putnam sketched a version of his internal realism as it might arise in the philosophy of mathematics. Here, I will develop that sketch. By combining Putnam’s model-theoretic arguments with Dummett’s reflections on Gödelian incompleteness, we arrive at (what I call) the Skolem-Gödel Antinomy. In brief: our mathematical concepts are perfectly precise; however, these perfectly precise mathematical concepts are manifested and acquired via a formal theory, which is understood in terms of a computable (...) class='Hi'>system of proof, and hence is incomplete. Whilst this might initially seem strange, I show how internal categoricity results for arithmetic and set theory allow us to face up to this Antinomy. This also allows us to understand why “Models are not lost noumenal waifs looking for someone to name them,” but “constructions within our theory itself,” with “names from birth.”. (shrink)

In a series of papers, Don Fallis points out that although mathematicians are generally unwilling to accept merely probabilistic proofs, they do accept proofs that are incomplete, long and complicated, or partly carried out by computers. He argues that there are no epistemic grounds on which probabilistic proofs can be rejected while these other proofs are accepted. I defend the practice by presenting a property I call ‘transferability’, which probabilistic proofs lack and acceptable proofs have. I also consider what this (...) says about the similarities between mathematics and, on the one hand natural sciences, and on the other hand philosophy. (shrink)

Logic diagrams have seen a resurgence in their application in a range of fields, including logic, biology, media science, computer science and philosophy. Consequently, understanding the history and philosophy of these diagrams has become crucial. As many current diagrammatic systems in logic are based on ideas that originated in the 18th and 19th centuries, it is important to consider what motivated the use of logic diagrams in the past and whether these reasons are still valid today. This paper proposes that (...) transcendental philosophy was a key inspiration for the development of logic diagrams and that such diagrams can be employed in transcendental arguments, even after the linguistic turn. (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)

Transfinite ordinal numbers enter mathematical practice mainly via the method of definition by transfinite recursion. Outside of axiomatic set theory, there is a significant mathematical tradition in works recasting proofs by transfinite recursion in other terms, mostly with the intention of eliminating the ordinals from the proofs. Leaving aside the different motivations which lead each specific case, we investigate the mathematics of this action of proof transforming and we address the problem of formalising the philosophical notion of elimination (...) which characterises this move. (shrink)

This paper presents proof that Buss's S22 can prove the consistency of a fragment of Cook and Urquhart's PV from which induction has been removed but substitution has been retained. This result improves Beckmann's result, which proves the consistency of such a system without substitution in bounded arithmetic S12. Our proof relies on the notion of "computation" of the terms of PV. In our work, we first prove that, in the system under consideration, if an equation is proved (...) and either its left- or right-hand side is computed, then there is a corresponding computation for its right- or left-hand side, respectively. By carefully computing the bound of the size of the computation, the proof of this theorem inside a bounded arithmetic is obtained, from which the consistency of the system is readily proven. This result apparently implies the separation of bounded arithmetic because Buss and Ignjatović stated that it is not possible to prove the consistency of a fragment of PV without induction but with substitution in Buss's S12. However, their proof actually shows that it is not possible to prove the consistency of the system, which is obtained by the addition of propositional logic and other axioms to a system such as ours. On the other hand, the system that we have considered is strictly equational, which is a property on which our proof relies. (shrink)

Logic diagrams have been increasingly studied and applied for a few decades, not only in logic, but also in many other fields of science. The history of logic diagrams is an important subject, as many current systems and applications of logic diagrams are based on historical predecessors. While traditional histories of logic diagrams cite pioneers such as Leibniz, Euler, Venn, and Peirce, it is not widely known that Kant and the early Kantians in Germany and England played a crucial role (...) in popularising Euler(-type) diagrams. In this paper, the role of the Kantians in the late eighteenth and early nineteenth centuries will be analysed in more detail. It shows that diagrams (or intuition in general) were a highly contentious topic that depend on the philosophical attitude and went beyond logic to touch on issues of physics, metaphysics, linguistics and, above all, mathematics. (shrink)

This paper explores the extent to which a scientific framework for visualization might be possible. It presents several potential parts of a framework, illustrated by application to the visualization of correlation in scatterplots. The first is an extended-vision thesis, which posits that a viewer and visualization system can be usefully considered as a single system that perceives structure in a dataset, much like "basic" vision perceives structure in the world. This characterization is then used to suggest approaches to (...) evaluation that take advantage of techniques used in vision science. Next, an optimal-reduction thesis is presented, which posits that an optimal visualization enables the given task to be reduced to the most suitable operations in the extended system. A systematic comparison of alternative designs is then proposed, guided by what is known about perceptual mechanisms. It is shown that these elements can be extended in various ways—some even overlapping with parts of vision science. As such, a science of some kind appears possible for at least some parts of visualization. It would remain distinct from design practice, but could nevertheless assist with the design of visualizations that better engage human perception and cognition. (shrink)

The paper briefly surveys the sentential proof-theoretic semantics for fragment of English. Then, appealing to a version of Frege’s context-principle (specified to fit type-logical grammar), a method is presented for deriving proof-theoretic meanings for sub-sentential phrases, down to lexical units (words). The sentential meaning is decomposed according to the function-argument structure as determined by the type-logical grammar. In doing so, the paper presents a novel proof-theoretic interpretation of simple type, replacing Montague’s model-theoretic type interpretation (in arbitrary Henkin models). The domains (...) of derivations are collections of derivations in the associated “dedicated” natural-deduction proof-system, and functions therein (with no appeal to models, truth-values and elements of a domain). The compositionality of the semantics is analyzed. (shrink)

This study used a path analytic approach to examine the composite interaction of supervisory and records management with secondary school system effectiveness in terms of students' academic performance, teachers' job effectiveness and principals' administrative effectiveness. Two research questions were answered while one null hypothesis was tested. The study adopted a factorial research design. Convenience sampling technique was adopted by the researchers in selecting a sample of 1,200 respondents which comprised 271 principals and 929 teachers from a population of 271 (...) principals, and 4,878 teachers. Principal Innovative Management Practices and Administrative Effectiveness Questionnaire (PIMPAEQ), Teachers work effectiveness questionnaire (TWEQ), and Students Mathematics Achievement Test (SMAT) were all used as instruments for data collection. Collected data were analyzed using descriptive statistics, the research questions and null hypothesis were answered and tested (at .05 level of significance) respectively using multiple regression and path analyses with the aid of SPSS v25 and Amos v22. Findings from the study established amongst others that; supervisory management and records management practices have a significant joint contribution to students’ academic performance by 66.4%, teachers’ job effectiveness by 71%, and principals’ administrative effectiveness by 86.8%. Supervisory management and records management practices had a significant influence on students’ academic performance (F= 1183.641, p<.05), teachers’ job effectiveness (F= 1465.615, p<.05), and principals’ administrative effectiveness (F=3924.763, p<.05). It was recommended amongst others that; secondary school principals should jointly use supervisory and records management practices as innovative techniques for improving students’ academic performance, teachers’ job effectiveness and their own administrative effectiveness. KEYWORDS:. (shrink)

Roughly, a proof of a theorem, is “pure” if it draws only on what is “close” or “intrinsic” to that theorem. Mathematicians employ a variety of terms to identify pure proofs, saying that a pure proof is one that avoids what is “extrinsic,” “extraneous,” “distant,” “remote,” “alien,” or “foreign” to the problem or theorem under investigation. In the background of these attributions is the view that there is a distance measure (or a variety of such measures) between mathematical statements (...) and proofs. Mathematicians have paid little attention to specifying such distance measures precisely because in practice certain methods of proof have seemed self- evidently impure by design: think for instance of analytic geometry and analytic number theory. By contrast, mathematicians have paid considerable attention to whether such impurities are a good thing or to be avoided, and some have claimed that they are valuable because generally impure proofs are simpler than pure proofs. This article is an investigation of this claim, formulated more precisely by proof- theoretic means. After assembling evidence from proof theory that may be thought to support this claim, we will argue that on the contrary this evidence does not support the claim. (shrink)

In attempt to provide an answer to the question of origin of deductive proofs, I argue that Aristotle’s philosophy of math is more accurate opposed to a Platonic philosophy of math, given the evidence of how mathematics began. Aristotle says that mathematical knowledge is a posteriori, known through induction; but once knowledge has become unqualified it can grow into deduction. Two pieces of recent scholarship on Greek mathematics propose new ways of thinking about how mathematics began in the Greek (...) culture. Both claimed there was a close relationship between the culture and mathematicians; mathematics was understood through imaginative processes, experiencing the proofs in tangible ways, and establishing a consistent unified form of argumentation. These pieces of evidence provide the context in which Aristotle worked and their contributions lend support to the argument that mathematical premises as inductively available is a better way of understanding the origins of deductive practices, opposed to the Platonic tradition. (shrink)

Standard histories of mathematics and of analytic philosophy contend that work on the foundations of mathematics was motivated by a crisis such as the discovery of paradoxes in set theory or the discovery of non-Euclidean geometries. Recent scholarship, however, casts doubt on the standard histories, opening the way for consideration of an alternative motive for the study of the foundations of mathematics—unification. Work on foundations has shown that diverse mathematical practices could be integrated into a single framework of axiomatic (...) systems and that much of mathematics could be expressed in a single language. The new framework was the product of an interdisciplinary coalition whose ideas resemble those later adopted by the Vienna Circle and logical empiricists. (shrink)

This paper presents a sequent calculus and a dual domain semantics for a theory of definite descriptions in which these expressions are formalised in the context of complete sentences by a binary quantifier I. I forms a formula from two formulas. Ix[F, G] means ‘The F is G’. This approach has the advantage of incorporating scope distinctions directly into the notation. Cut elimination is proved for a system of classical positive free logic with I and it is shown to (...) be sound and complete for the semantics. The system has a number of novel features and is briefly compared to the usual approach of formalising ‘the F ’ by a term forming operator. It does not coincide with Hintikka’s and Lambert’s preferred theories, but the divergence is well-motivated and attractive. (shrink)

The design process in Kashmiri carpet weaving is distributed over a number of actors and artifacts and is mediated by a weaving notation called talim. The script encodes entire design in practice-specific symbols. This encoded script is decoded and interpreted via design-specific conventions by weavers to weave the design embedded in it. The cognitive properties of this notational system are described in the paper employing cognitive dimensions (CDs) framework of Green (People and computers, Cambridge University Press, Cambridge, 1989) (...) and Blackwell et al. (Cognitive technology: instruments of mind—CT 2001, LNAI 2117, Springer, Berlin, 2001). After introduction to the practice, the design process is described in ‘The design process’ section which includes coding and decoding of talim. In ‘Cognitive dimensions of talim’ section, after briefly discussing CDs framework, the specific cognitive dimensions possessed by talim are described in detail. (shrink)

Marr’s seminal distinction between computational, algorithmic, and implementational levels of analysis has inspired research in cognitive science for more than 30 years. According to a widely-used paradigm, the modelling of cognitive processes should mainly operate on the computational level and be targeted at the idealised competence, rather than the actual performance of cognisers in a specific domain. In this paper, we explore how this paradigm can be adopted and revised to understand mathematical problem solving. The computational-level approach applies methods (...) from computational complexity theory and focuses on optimal strategies for completing cognitive tasks. However, human cognitive capacities in mathematical problem solving are essentially characterised by processes that are computationally sub-optimal, because they initially add to the computational complexity of the solutions. Yet, these solutions can be optimal for human cognisers given the acquisition and enactment of mathematical practices. Here we present diagrams and the spatial manipulation of symbols as two examples of problem solving strategies that can be computationally sub-optimal but humanly optimal. These aspects need to be taken into account when analysing competence in mathematical problem solving. Empirically informed considerations on enculturation can help identify, explore, and model the cognitive processes involved in problem solving tasks. The enculturation account of mathematical problem solving strongly suggests that computational-level analyses need to be complemented by considerations on the algorithmic and implementational levels. The emerging research strategy can help develop algorithms that model what we call enculturated cognitive optimality in an empirically plausible and ecologically valid way. (shrink)