Logic has pride of place in mathematics and its 20th century offshoot, computer science. Modern symbolic logic was developed, in part, as a way to provide a formal framework for mathematics: Frege, Peano, Whitehead and Russell, as well as Hilbert developed systems of logic to formalize mathematics. These systems were meant to serve either as themselves foundational, or at least as formal analogs of mathematical reasoning amenable to mathematical study, e.g., in Hilbert’s consistency program. Similar efforts (...) continue, but have been expanded by the development of sophisticated methods to study the properties of such systems using proof and model theory. In parallel with this evolution of logical formalisms as tools for articulating mathematical theories (broadly speaking), much progress has been made in the quest for a mechanization of logical inference and the investigation of its theoretical limits, culminating recently in the development of new foundational frameworks for mathematics with sophisticated computer-assisted proof systems. In addition, logical formalisms developed by logicians in mathematical and philosophical contexts have proved immensely useful in describing theories and systems of interest to computer scientists, and to some degree, vice versa. Three examples of the influence of logic in computer science are automated reasoning, computer verification, and type systems for programming languages. (shrink)

The aims of this paper are twofold: firstly, to say something about that philosophy of mathematics known as 'intuitionism' and, secondly, to fit these remarks into a more general message for the philosophy of mathematics as a whole. What I have to say on the first score can, without too much inaccuracy, be compressed into two theses. The first is that the intuitionistic critique of classical mathematics can be seen as based primarily on epistemological rather than on meaning-theoretic considerations. The (...) second is that the intuitionist's chief objection to the classical mathematician's use of logic does not center on the use of particular logical principles (in particular, the law of excluded middle and its ilk). Rather on the role the classical mathematician assigns (or at least extends) generally (i.e. regardless of the particular principles used) to the use of logic in the production mathematical proofs. Thus, the intuitionist critique of logic that we shall be presenting is far more radical than that which has commonly been presented. -/- Concerning the second, more general, theme, my claim is this: some restriction of the role of logical inference in mathematical proof such as that mentioned above is necessary if one is to account for the seeming difference in the epistemic conditions of provers whose reasoning is based on genuine insight into the subject-matter being investigated, and would-be provers whose reasoning is based not on such insight, but rather on principles of inference which hold of every subject-matter indifferently. (shrink)

ABSTRACT This part of the series has a dual purpose. In the first place we will discuss two kinds of theories of proof. The first kind will be called a theory of linear proof. The second has been called a theory of suppositional proof. The term "natural deduction" has often and correctly been used to refer to the second kind of theory, but I shall not do so here because many of the theories so-called are not (...) of the second kind--they must be thought of either as disguised linear theories or theories of a third kind (see postscript below). The second purpose of this part is 25 to develop some of the main ideas needed in constructing a comprehensive theory of proof. The reason for choosing the linear and suppositional theories for this purpose is because the linear theory includes only rules of a very simple nature, and the suppositional theory can be seen as the result of making the linear theory more comprehensive. CORRECTION: At the time these articles were written the word ‘proof’ especially in the phrase ‘proof from hypotheses’ was widely used to refer to what were earlier and are now called deductions. I ask your forgiveness. I have forgiven Church and Henkin who misled me. (shrink)

Since the time of Aristotle's students, interpreters have considered Prior Analytics to be a treatise about deductive reasoning, more generally, about methods of determining the validity and invalidity of premise-conclusion arguments. People studied Prior Analytics in order to learn more about deductive reasoning and to improve their own reasoning skills. These interpreters understood Aristotle to be focusing on two epistemic processes: first, the process of establishing knowledge that a conclusion follows necessarily from a set of premises (that (...) is, on the epistemic process of extracting information implicit in explicitly given information) and, second, the process of establishing knowledge that a conclusion does not follow. Despite the overwhelming tendency to interpret the syllogistic as formal epistemology, it was not until the early 1970s that it occurred to anyone to think that Aristotle may have developed a theory of deductive reasoning with a well worked-out system of deductions comparable in rigor and precision with systems such as propositional logic or equational logic familiar from mathematical logic. When modern logicians in the 1920s and 1930s first turned their attention to the problem of understanding Aristotle's contribution to logic in modern terms, they were guided both by the Frege-Russell conception of logic as formal ontology and at the same time by a desire to protect Aristotle from possible charges of psychologism. They thought they saw Aristotle applying the informal axiomatic method to formal ontology, not as making the first steps into formal epistemology. They did not notice Aristotle's description of deductive reasoning. Ironically, the formal axiomatic method (in which one explicitly presents not merely the substantive axioms but also the deductive processes used to derive theorems from the axioms) is incipient in Aristotle's presentation. Partly in opposition to the axiomatic, ontically-oriented approach to Aristotle's logic and partly as a result of attempting to increase the degree of fit between interpretation and text, logicians in the 1970s working independently came to remarkably similar conclusions to the effect that Aristotle indeed had produced the first system of formal deductions. They concluded that Aristotle had analyzed the process of deduction and that his achievement included a semantically complete system of natural deductions including both direct and indirect deductions. Where the interpretations of the 1920s and 1930s attribute to Aristotle a system of propositions organized deductively, the interpretations of the 1970s attribute to Aristotle a system of deductions, or extended deductive discourses, organized epistemically. The logicians of the 1920s and 1930s take Aristotle to be deducing laws of logic from axiomatic origins; the logicians of the 1970s take Aristotle to be describing the process of deduction and in particular to be describing deductions themselves, both those deductions that are proofs based on axiomatic premises and those deductions that, though deductively cogent, do not establish the truth of the conclusion but only that the conclusion is implied by the premise-set. Thus, two very different and opposed interpretations had emerged, interestingly both products of modern logicians equipped with the theoretical apparatus of mathematical logic. The issue at stake between these two interpretations is the historical question of Aristotle's place in the history of logic and of his orientation in philosophy of logic. This paper affirms Aristotle's place as the founder of logic taken as formal epistemology, including the study of deductive reasoning. A by-product of this study of Aristotle's accomplishments in logic is a clarification of a distinction implicit in discourses among logicians--that between logic as formal ontology and logic as formal epistemology. (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)

Proof requires a dialogue between agents to clarify obscure inference steps, fill gaps, or reveal implicit assumptions in a purported proof. Hence, argumentation is an integral component of the discovery process for mathematical proofs. This work presents how argumentation theories can be applied to describe specific informal features in the development of proof-events. The concept of proof-event was coined by Goguen who described mathematical proof as a public social event that takes place (...) in space and time. This new meta-methodological concept is designed to cover not only “traditional” formal proofs but all kinds of proofs and inference steps, including incomplete or purported proofs. Our approach attempts to make proof-events more comprehensive to express the complete trajectory of a mathematical proof-event until the ultimate validation of the proving outcome. Thus, we advance an extended version of proof-event calculus which is built on argumentation theories designed to capture the internal and external structure of collaborative mathematical practice and highlight the relationship between proof, human reasoning, and cognitive processes. In addition, another area in which argumentation can make a significant contribution is dealing with the defeasible knowledge of the Web which is a product of its open and ubiquitous nature. This approach seems to be sufficient for the presentation of Web-based proving processes as manifested in the case of the Mini-Polymath 4 project. (shrink)

In the early years of this century, Poincaré and Russell engaged in a debate concerning the nature of mathematical reasoning. Siding with Kant, Poincaré argued that mathematical reasoning is characteristically non-logical in character. Russell urged the contrary view, maintaining that (i) the plausibility originally enjoyed by Kant's view was due primarily to the underdeveloped state of logic in his (i.e., Kant's) time, and that (ii) with the aid of recent developments in logic, it is possible (...) to demonstrate its falsity. This refutation of Kant's views consists in showing that every known theorem of mathematics can be proven by purely logical means from a basic set of axioms. In our view, Russell's alleged refutation of Poincaré's Kantian viewpoint is mistaken. Poincaré's aim (as Kant's before him) was not to deny the possibility of finding a logical ‘proof’ for each theorem. Rather, it was to point out that such purely logical derivations fail to preserve certain of the important and distinctive features of mathematical proof. Against such a view, programs such as Russell's, whose main aim was to demonstrate the existence of a logical counterpart for each mathematical proof, can have but little force. For what is at issue is not whether each mathematical theorem can be fitted with a logical ‘proof’, but rather whether the latter has the epistemic features that a genuine mathematical proof has. (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)

Based on extensive research conducted by the authors, Reasoning and Sense Making in the Mathematics Classroom, Pre-K-Grade 2, is designed to help classroom teachers understand, monitor, and guide the development of students' reasoning and sense making about core ideas in elementary school mathematics. It describes and illustrates the nature of these skills using classroom vignettes and actual student work in conjunction with instructional tasks and learning progressions to show how reasoning and sense making develop and how instruction (...) can support students in that development. Students who can make sense of mathematical ideas can apply those ideas in problem solving, even in unfamiliar situations, and can use them as a foundation for future learning. Without them, students are reduced to rote learning, often experiencing frustration and failure. But what do reasoning and sense making during learning and teaching look like? Each chapter of Reasoning and Sense Making in the Mathematics Classroom, Pre-K-Grade 2 explores a different topic that young children encounter in mathematics, demonstrating with actual student work and classroom dialogue how their mathematical knowledge and reasoning ability move through "levels of sophistication" or learning progressions: After opening with a discussion of the nature of reasoning and sense making and their critical importance in developing mathematical thinking, chapter 1 examines how young students attempt to make sense of the concepts of place value and length measurement. Chapter 2 focuses on how early childhood instruction can engage students in mathematical reasoning while helping them construct a rich sense of number and operations. Chapter 3 identifies core algebraic ideas and shows how students can engage with these ideas in ways that not only deepen their understanding of arithmetic but also lays the foundation for the future study of algebra. Children's reasoning and sense making as they decompose and compose geometric shapes--including reasoning about area--is examined in chapter 4. The use of learning progressions to understand students' reasoning and to guide their sense making with appropriate teaching is also discussed. Not just a theoretical discussion, the book also provides specific suggestions for related instructional activities for each topic. Supplementary online resources can be accessed at NCTM's More4U website. Reasoning and Sense Making in the Mathematics Classroom, Pre-K-Grade 2 will be a valuable and practical addition to your professional library. (shrink)

This contribution defends two claims. The first is about why thought experiments are so relevant and powerful in mathematics. Heuristics and proof are not strictly and, therefore, the relevance of thought experiments is not contained to heuristics. The main argument is based on a semiotic analysis of how mathematics works with signs. Seen in this way, formal symbols do not eliminate thought experiments (replacing them by something rigorous), but rather provide a new stage for them. The formal world resembles (...) the empirical world in that it calls for exploration and offers surprises. This presents a major reason why thought experiments occur both in empirical sciences and in mathematics. The second claim is about a looming aporia that signals the limitation of thought experiments. This aporia arises when mathematical arguments cease to be fully accessible, thus violating a precondition for experimenting in thought. The contribution focuses on the work of Vladimir Voevodsky (1966–2017, Fields medalist in 2002) who argued that even very pure branches of mathematics cannot avoid inaccessibility of proof. Furthermore, he suggested that computer verification is a feasible path forward, but only if proof is not modeled in terms of formal logic. (shrink)

Some of our earliest experiences of the conclusive force of an argument come from school mathematics: faced with a mathematical proof, we cannot deny the conclusion once the premises have been accepted. Behind such arguments lies a more general pattern of 'demonstrative arguments' that is studied in the science of logic. Logical reasoning is applied at all levels, from everyday life to advanced sciences, and a remarkable level of complexity is achieved in everyday logical (...) class='Hi'>reasoning, even if the principles behind it remain intuitive. Jan von Plato provides an accessible but rigorous introduction to an important aspect of contemporary logic: its deductive machinery. He shows that when the forms of logical reasoning are analysed, it turns out that a limited set of first principles can represent any logical argument. His book will be valuable for students of logic, mathematics and computer science. (shrink)

Girolamo Saccheri (1667--1733) was an Italian Jesuit priest, scholastic philosopher, and mathematician. He earned a permanent place in the history of mathematics by discovering and rigorously deducing an elaborate chain of consequences of an axiom-set for what is now known as hyperbolic (or Lobachevskian) plane geometry. Reviewer's remarks: (1) On two pages of this book Saccheri refers to his previous and equally original book Logica demonstrativa (Turin, 1697) to which 14 of the 16 pages of the editor's "Introduction" are (...) devoted. At the time of the first edition, 1920, the editor was apparently not acquainted with the secondary literature on Logica demonstrativa which continued to grow in the period preceding the second edition \ref[see D. J. Struik, in Dictionary of scientific biography, Vol. 12, 55--57, Scribner's, New York, 1975]. Of special interest in this connection is a series of three articles by A. F. Emch [Scripta Math. 3 (1935), 51--60; Zbl 10, 386; ibid. 3 (1935), 143--152; Zbl 11, 193; ibid. 3 (1935), 221--333; Zbl 12, 98]. (2) It seems curious that modern writers believe that demonstration of the "nondeducibility" of the parallel postulate vindicates Euclid whereas at first Saccheri seems to have thought that demonstration of its "deducibility" is what would vindicate Euclid. Saccheri is perfectly clear in his commitment to the ancient (and now discredited) view that it is wrong to take as an "axiom" a proposition which is not a "primal verity", which is not "known through itself". So it would seem that Saccheri should think that he was convicting Euclid of error by deducing the parallel postulate. The resolution of this confusion is that Saccheri thought that he had proved, not merely that the parallel postulate was true, but that it was a "primal verity" and, thus, that Euclid was correct in taking it as an "axiom". As implausible as this claim about Saccheri may seem, the passage on p. 237, lines 3--15, seems to admit of no other interpretation. Indeed, Emch takes it this way. (3) As has been noted by many others, Saccheri was fascinated, if not obsessed, by what may be called "reflexive indirect deductions", indirect deductions which show that a conclusion follows from given premises by a chain of reasoning beginning with the given premises augmented by the denial of the desired conclusion and ending with the conclusion itself. It is obvious, of course, that this is simply a species of ordinary indirect deduction; a conclusion follows from given premises if a contradiction is deducible from those given premises augmented by the denial of the conclusion---and it is immaterial whether the contradiction involves one of the premises, the denial of the conclusion, or even, as often happens, intermediate propositions distinct from the given premises and the denial of the conclusion. Saccheri seemed to think that a proposition proved in this way was deduced from its own denial and, thus, that its denial was self-contradictory (p. 207). Inference from this mistake to the idea that propositions proved in this way are "primal verities" would involve yet another confusion. The reviewer gratefully acknowledges extensive communication with his former doctoral students J. Gasser and M. Scanlan. ADDED 14 March 14, 2015: (1) Wikipedia reports that many of Saccheri's ideas have a precedent in the 11th Century Persian polymath Omar Khayyám's Discussion of Difficulties in Euclid, a fact ignored in most Western sources until recently. It is unclear whether Saccheri had access to this work in translation, or developed his ideas independently. (2) This book is another exemplification of the huge difference between indirect deduction and indirect reduction. Indirect deduction requires making an assumption that is inconsistent with the premises previously adopted. This means that the reasoner must perform a certain mental act of assuming a certain proposition. It case the premises are all known truths, indirect deduction—which would then be indirect proof—requires the reasoner to assume a falsehood. This fact has been noted by several prominent mathematicians including Hardy, Hilbert, and Tarski. Indirect reduction requires no new assumption. Indirect reduction is simply a transformation of an argument in one form into another argument in a different form. In an indirect reduction one proposition in the old premise set is replaced by the contradictory opposite of the old conclusion and the new conclusion becomes the contradictory opposite of the replaced premise. Roughly and schematically, P,Q/R becomes P,~R/~Q or ~R, Q/~P. Saccheri’s work involved indirect deduction not indirect reduction. (3) The distinction between indirect deduction and indirect reduction has largely slipped through the cracks, the cracks between medieval-oriented logic and modern-oriented logic. The medievalists have a heavy investment in reduction and, though they have heard of deduction, they think that deduction is a form of reduction, or vice versa, or in some cases they think that the word ‘deduction’ is the modern way of referring to reduction. The modernists have no interest in reduction, i.e. in the process of transforming one argument into another having exactly the same number of premises. Modern logicians, like Aristotle, are concerned with deducing a single proposition from a set of propositions. Some focus on deducing a single proposition from the null set—something difficult to relate to reduction. (shrink)

1971. Discourse Grammars and the Structure of Mathematical Reasoning II: The Nature of a Correct Theory of Proof and Its Value, Journal of Structural Learning 3, #2, 1–16. REPRINTED 1976. Structural Learning II Issues and Approaches, ed. J. Scandura, Gordon & Breach Science Publishers, New York, MR56#15263. -/- This is the second of a series of three articles dealing with application of linguistics and logic to the study of mathematical reasoning, especially in the setting of (...) a concern for improvement of mathematical education. The present article presupposes the previous one. Herein we develop our ideas of the purposes of a theory of proof and the criterion of success to be applied to such theories. In addition we speculate at length concerning the specific kinds of uses to which a successful theory of proof may be put vis-a-vis improvement of various aspects of mathematical education. The final article will deal with the construction of such a theory. The 1st is the 1971. Discourse Grammars and the Structure of Mathematical Reasoning I: Mathematical Reasoning and Stratification of Language, Journal of Structural Learning 3, #1, 55–74. https://www.academia.edu/s/fb081b1886?source=link . (shrink)

This book explores the results of applying empirical methods to the philosophy of logic and mathematics. Much of the work that has earned experimental philosophy a prominent place in twenty-first century philosophy is concerned with ethics or epistemology. But, as this book shows, empirical methods are just as much at home in logic and the philosophy of mathematics. -/- Chapters demonstrate and discuss the applicability of a wide range of empirical methods including experiments, surveys, interviews, and data-mining. Distinct themes (...) emerge that reflect recent developments in the field, such as issues concerning the logic of conditionals and the role played by visual elements in some mathematical proofs. -/- Featuring leading figures from experimental philosophy and the fields of philosophy of logic and mathematics, this collection reveals that empirical work in these disciplines has been quietly thriving for some time and stresses the importance of collaboration between philosophers and researchers in mathematics education and mathematical cognition. (shrink)

In practice, mathematical proofs are most often the result of careful planning by the agents who produced them. As a consequence, each mathematical proof inherits a plan in virtue of the way it is produced, a plan which underlies its “architecture” or “unity”. This paper provides an account of plans and planning in the context of mathematical proofs. The approach adopted here consists in looking for these notions not in mathematical proofs themselves, but in the (...) agents who produced them. The starting point is to recognize that to each mathematical proof corresponds a proof activity which consists of a sequence of deductive inferences—i.e., a sequence of epistemic actions—and that any written mathematical proof is only a report of its corresponding proof activity. The main idea to be developed is that the plan of a mathematical proof is to be conceived and analyzed as the plan of the agent(s) who carried out the corresponding proof activity. The core of the paper is thus devoted to the development of an account of plans and planning in the context of proof activities. The account is based on the theory of planning agency developed by Michael Bratman in the philosophy of action. It is fleshed out by providing an analysis of the notions of intention—the elementary components of plans—and practical reasoning—the process by which plans are constructed—in the context of proof activities. These two notions are then used to offer a precise characterization of the desired notion of plan for proof activities. A fruitful connection can then be established between the resulting framework and the recent theme of modularity in mathematics introduced by Jeremy Avigad. This connection is exploited to yield the concept of modular presentations of mathematical proofs which has direct implications for how to write and present mathematical proofs so as to deliver various epistemic benefits. The account is finally compared to the technique of proof planning developed by Alan Bundy and colleagues in the field of automated theorem proving. The paper concludes with some remarks on how the framework can be used to provide an analysis of understanding and explanation in the context of mathematical proofs. (shrink)

Reasoning is a goal-oriented activity. The logical steps are at best the median part of a full reasoning: before them, a language has to be defined, and a model of the goal in this language has to be developed; after them, their result has to be checked in the real world with respect to the goal. Both the prior and the subsequent steps can be conducted rationally; none of them has a logical counterpart. Furthermore, Logic aims (...) at prescribing what a correct reasoning is. But correct with respect to what? If the answer is: with respect to truth, the next question is whether the truth in everyday life, physics, economy, is the same as the truth that logicians have in mind. Resorting to Logic is justified only if an idealization in terms of true propositions in the logical sense is compatible with the goal. If such an idealization is legitimate, so is the use of classical Logic. If not, there is no authority forbidding to skew Logic in order to better reflect the nature of the reasoning required for the task. (shrink)

The contributions to this volume are from participants of the international conference "Kreisel's Interests - On the Foundations of Logic and Mathematics", which took place from 13 to 14 2018 at the University of Salzburg in Salzburg, Austria. The contributions have been revised and partially extended. Among the contributors are Akihiro Kanamori, Göran Sundholm, Ulrich Kohlenbach, Charles Parsons, Daniel Isaacson, and Kenneth Derus. The contributions cover the discussions between Kreisel and Wittgenstein on philosophy of mathematics, Kreisel's Dictum, proof (...) theory, the discussions between Kreisel and Gödel on philosophy of mathematics, some bibliographical facts, and a collection of extracts from Kreisel's letters. (shrink)

In this text, I put forward the thesis that creativity and logic do not exclude each other. I depart from the characterization of a creative product as that which is novel and useful. I presuppose there is some kind of method for generating that new product, and in this respect, I rely on Peirce’s formulation of abduction. A central point to be discussed concerns whether Peirces’ abduction may be considered as a logic of synthetic reasoning; to what extent its (...) products are genuinely novel. In my defense of above’s thesis, I shall restrict to new scientific hypotheses generated from previous concepts. I consider that this modest analysis will nevertheless shed some light on the scope of this thesis. (shrink)

Does syllogistic logic have the resources to capture mathematical proof? This volume provides the first unified account of the history of attempts to answer this question, the reasoning behind the different positions taken, and their far-reaching implications. Aristotle had claimed that scientific knowledge, which includes mathematics, is provided by syllogisms of a special sort: 'scientific' ('demonstrative') syllogisms. In ancient Greece and in the Middle Ages, the claim that Euclid's theorems could be recast syllogistically was accepted without further (...) scrutiny. Nevertheless, as early as Galen, the importance of relational reasoning for mathematics had already been recognized. Further critical voices emerged in the Renaissance and the question of whether mathematical proofs could be recast syllogistically attracted more sustained attention over the following three centuries. Supported by more detailed analyses of Euclidean theorems, this led to attempts to extend logical theory to include relational reasoning, and to arguments purporting to reduce relational reasoning to a syllogistic form. Philosophical proposals to the effect that mathematical reasoning is heterogenous with respect to logical proofs were famously defended by Kant, and the implications of the debate about the adequacy of syllogistic logic for mathematics are at the very core of Kant's account of synthetic a priori judgments. While it is now widely accepted that syllogistic logic is not sufficient to account for the logic of mathematical proof, the history and the analysis of this debate, running from Aristotle to de Morgan and beyond, is a fascinating and crucial insight into the relationship between philosophy and mathematics. (shrink)

William Tait's standing in the philosophy of mathematics hardly needs to be argued for; for this reason the appearance of this collection is especially welcome. As noted in his Preface, the essays in this book ‘span the years 1981–2002’. The years given are evidently those of publication. One essay was not previously published in its present form, but it is a reworking of papers published during that period. The Introduction, one appendix, and some notes are new. Many of the essays (...) will be familiar to the readers of this journal; indeed two first appeared here.It should be no surprise to those who know Tait's work that this is a very rich collection, with contributions on a wide variety of issues, both systematic and historical. That poses a problem for a reviewer, because a serious discussion of even all the major issues would be beyond the scope of a review.Before the essays in this collection, Tait's publications were almost all in mathematical logic, especially proof theory. He was a leading actor in the work on the revised Hilbert program stimulated after the war by Georg Kreisel, Kurt Schütte, and Gaisi Takeuti. Tait thus has an experience in mathematical research that is rare among those whose careers have been institutionally in philosophy. In the 1970s Tait became disillusioned with the proof-theoretic program on which he had worked. However, he draws on that background in several of these essays, and he has continued to work on mathematical questions. In particular, the set-theoretic project reflected in essay 6 is as much mathematical as philosophical.It is not easy to characterize Tait's philosophical viewpoint briefly. Both the title of the book and some of its content mark him as a rationalist. His hero in the earlier history …. (shrink)

In this article we provide a mathematical model of Kant?s temporal continuum that satisfies the (not obviously consistent) synthetic a priori principles for time that Kant lists in the Critique of pure Reason (CPR), the Metaphysical Foundations of Natural Science (MFNS), the Opus Postumum and the notes and frag- ments published after his death. The continuum so obtained has some affinities with the Brouwerian continuum, but it also has ‘infinitesimal intervals’ consisting of nilpotent infinitesimals, which capture Kant’s theory of (...) rest and motion in MFNS. While constructing the model, we establish a concordance between the informal notions of Kant?s theory of the temporal continuum, and formal correlates to these notions in the mathematical theory. Our mathematical reconstruction of Kant?s theory of time allows us to understand what ?faculties and functions? must be in place for time to satisfy all the synthetic a priori principles for time mentioned. We have presented here a mathematically precise account of Kant?s transcendental argument for time in the CPR and of the rela- tion between the categories, the synthetic a priori principles for time, and the unity of apperception; the most precise account of this relation to date. We focus our exposition on a mathematical analysis of Kant’s informal terminology, but for reasons of space, most theorems are explained but not formally proven; formal proofs are available in (Pinosio, 2017). The analysis presented in this paper is related to the more general project of developing a formalization of Kant’s critical philosophy (Achourioti & van Lambalgen, 2011). A formal approach can shed light on the most controversial concepts of Kant’s theoretical philosophy, and is a valuable exegetical tool in its own right. However, we wish to make clear that mathematical formalization cannot displace traditional exegetical methods, but that it is rather an exegetical tool in its own right, which works best when it is coupled with a keen awareness of the subtleties involved in understanding the philosophical issues at hand. In this case, a virtuous ?hermeneutic circle? between mathematical formalization and philosophical discourse arises. (shrink)

College students struggle with the switch from thinking of mathematics as a calculation based subject to a problem solving based subject. This book describes how the introduction to proofs course can be taught in a way that gently introduces students to this new way of thinking. This introduction utilizes recent research in neuroscience regarding how the brain learns best. Rather than jumping right into proofs, students are first taught how to change their mindset about learning, how to persevere through difficult (...) problems, how to work successfully in a group, and how to reflect on their learning. With these tools in place, students then learn logic and problem solving as a further foundation. Next various proof techniques such as direct proofs, proof by contraposition, proof by contradiction, and mathematical induction are introduced. These proof techniques are introduced using the context of number theory. The last chapter uses Calculus as a way for students to apply the proof techniques they have learned. (shrink)

Logic today is a ramified discipline existing on many levels. It is actively pursued by philosophers, mathemeticians, and computer specialists. The reason is that it is widely employed to solve a number of problems both in the theory of knowledge and in mathematics and computer science. But the broad spectrum of application of contemporary logic does not change the fact that its basic content has the nature of philosophical methodology. In contemporary logic it is the forms of thought and the (...) methods of scientific cognition, the modes of organization of scientific knowledge, and the procedures for the introduction of various concepts, abstractions, and idealizations that are studied. This places logic in intimate contact with epistemology and methodology. The distinctiveness of the approach taken by formal logic to this particular subject consists simply of its studying all these procedures pertaining to concrete cognition through the use of special formal languages, of algebraic, topological, and other exact techniques. (shrink)

This paper provides a foundation for the polarity marking technique introduced by David Dowty [3] in connection with monotonicity reasoning in natural language and in linguistic analyses of negative polarity items based on categorial grammar. Dowty's work is an alternative to the better-known algorithmic approach first proposed by Johan van Benthem [11], and elaborated by Víctor Sánchez Valencia [10]. Dowty's system internalized the monotonicity/polarity markings by generating strings using a categorial grammar whose categories already contain the markings that the (...) earlier system would obtain by separate steps working on an already-derived string. Despite the linguistic advantages of the internalized system, no soundness proof has yet been given for it. This paper offers an account. The leading mathematical idea is to interpret categorial types as preorders (in order to talk about monotonicity in the first place), and then to add a primitive operation to the type hierarchy of taking the opposite of a preorder (in order to capture monotone decreasing functions). At the same time, the use of internalized categories also raises issues. Although these will not be addressed in full, the paper points out possible approaches to them. (shrink)

This thesis is a critique of Jaakko Hintikka’s reconstruction of Kantian intuition in logical and mathematical reasoning. I argue that Hintikka’s reconstruction of Kantian intuition in particular and his reconstruction of Kant's philosophy of mathematics in general fails to be successful in two ways: First, the logical formula which contains an instantiated term (henceforth, instantial term) that is introduced by the rule of existential instantiation in the ecthesis part of a proof of an argument is (...) not even a proper singular proposition whose relation to its object is supposed to be immediate. It is not a proper singular proposition because its truth conditions are general, i.e., it makes a general statement about a class of individuals of the sort instantiated- a statement whose analysis is based on quantifiers. Second, I show that certain proofs in mathematics- those in the form of reductio ad absurdum- are not captured by Hintikka’s reconstruction of Kant’s philosophy of mathematics either. (shrink)

This book is a collection of papers related to a workshop organized in Geneva in January 2017, part of a big event celebrating the centenary of Ferdinand de Saussure's famous "Cours de Linguistique Générale" (CLG). The topic of this workshop was THE FIRST PRINCIPLE, stated in the second section of the first part of the CLG entitled: THE ARBITRARINESS OF THE SIGN. -/- Discussions are developed according to the three perspectives presented in the call for papers: -/- (1) The details (...) of the formulation of this principle in the CLG, its proper place (cf. the following sentence of section 2: "No one disputes the principle of the arbitrariness of the sign, but it is often easier to discover a truth than to assign it its proper place"). Discussions about the question of arbitrariness of the sign in works by Saussure before the CLG are also welcome. -/- (2) How the arbitrariness of the sign has been formulated and stressed before the CLG by people other than Saussure, in particular, but not exclusively, by people of the second part of the 19th century. Three important names: Boole, Peirce, Bréal. -/- (3) The import and value of this principle and the criticisms it received after the publication of the CLG. Special focus will be given to the opposition between arbitrary sign and symbol (as characterized in the CLG: "the symbol is never arbitrary; it is not empty, for there is the rudiment of a natural bond between the signifier and the signified") in the context of mathematical and logical languages (visual reasoning), traffic signs and pictograms (cf. Neurath's Isotype), typefaces (cf. the work of Adrian Frutiger). (shrink)

Fuzzy logics are many-valued logics that are well suited to reasoning in the context of vagueness. They provide the basis for the wider field of Fuzzy Logic, encompassing diverse areas such as fuzzy control, fuzzy databases, and fuzzy mathematics. This book provides an accessible and up-to-date introduction to this fast-growing and increasingly popular area. It focuses in particular on the development and applications of "proof-theoretic" presentations of fuzzy logics; the result of more than ten years of intensive work (...) by researchers in the area, including the authors. In addition to providing alternative elegant presentations of fuzzy logics, proof-theoretic methods are useful for addressing theoretical problems and developing efficient deduction and decision algorithms. Proof-theoretic presentations also place fuzzy logics in the broader landscape of non-classical logics, revealing deep relations with other logics studied in Computer Science, Mathematics, and Philosophy. The book builds methodically from the semantic origins of fuzzy logics to proof-theoretic presentations such as Hilbert and Gentzen systems, introducing both theoretical and practical applications of these presentations. (shrink)

Poincaré was a persistent critic of logicism. Unlike most critics of logicism, however, he did not focus his attention on the basic laws of the logicists or the question of their genuinely logical status. Instead, he directed his remarks against the place accorded to logical inference in the logicist's conception of mathematical proof. Following Leibniz, traditional logicist dogma (and this is explicit in Frege) has held that reasoning or inference is everywhere the same — (...) that there are no principles of inference specific to a given local topic. Poincaré, a Kantian, disagreed with this. Indeed, he believed that the use of non-logical reasoning was essential to genuinely mathematical reasoning (proof). In this essay, I try to isolate and clarify this idea and to describe the mathematical epistemology which underlies it. Central to this epistemology (which is basically Kantian in orientation, and closely similar to that advocated by Brouwer) is a principle of epistemic conservation which says that knowledge of a given type cannot be extended by means of an inference unless that inference itself constitutes knowledge belonging to the given type. (shrink)

This chapter spells out in detail how Kant’s thinking about logic during the critical period shapes the account of philosophy that he gives in the Critiques. Tolley explores Kant’s motivations behind his formation of the idea of a new “transcendental” logic, drawing out in particular how he means to differentiate it from the traditional “merely formal” approaches to logic, insofar as transcendental logic investigates not just the basic forms of the activity of thinking but also its basic contents. Kant’s understanding (...) of both of these logics directly factor into the first Critique’s more general project of the critique of reason in particular, as not just a capacity for a certain kind of thinking (inferring), but as a possible source of a priori cognition. (shrink)

A Border Disputeintegrates the latest work in logic and semantics into a theory of language learning and presents six worked examples of how that theory revolutionizes cognitive psychology. Macnamara's thesis is set against the background of a fresh analysis of the psychologism debate of the 19th-century, which led to the current standoff between logic and psychology. The book presents psychologism through the writings of John Stuart Mill and Immanuel Kant, and its rejection by Gottlob Frege and Edmund Husserl. It then (...) works out the general thesis that logic ideally presents a competence theory for part of human reasoning and explains how logical intuition is grounded in properties of the mind. The next six chapters present examples that illustrate the relevance of logic to psychology. These problems are all in the semantics of child language (the learning of proper names, personal pronouns, sortals or common nouns, quantifiers, and the truth-functional connectives) and reflect Macnamara's rich background in developmental psychology, particularly child language - a field, he points out, that embraces all of cognition. Technical problems raised by but not included in the examples in the main part of the text are dealt with in a separate chapter. The book concludes by describing laws in cognitive psychology, or the type of science made possible by Macnamara's new theory. John Macnamara is Professor of Psychology and Director of the Program in the History and Philosophy of Science, McGill University. A Bradford Book. (shrink)

Logic is traditionally considered to be a purely syntactic discipline, at least in principle. However, prof. David Isles has shown that this ideal is not yet met in traditional logic. Semantic residue is present in the assumption that the domain of a variable should be fixed in advance of a derivation, and also in the notion that a numerical notation must refer to a number rather than be considered a mathematical object in and of itself. Based on his work, (...) the central question of this thesis is what kind of logic, if any, results from removing this semantic residue from traditional logic.We differ from traditional logic in two significant ways. The first is that the assumption that a numerical notation must refer to a number is denied. Numerical notations are considered as mathematical objects in their own right, related to each other by means of rewrite rules. The traditional notion of reference is then replaced by the notion of reduction (by means of the rewrite rules) to a normal form. Two numerical notations that reduce to the same normal form would traditionally be considered identical, as they would refer to the same number, and hence they would be interchangeable salva veritate. In the new system, called Buridan-Volpin (BV), the numerical notations themselves are the elements of the domains of variables, and two numerical notations that reduce to the same normal form need not be interchangeable salva veritate, except when they are syntactically identical (i.e., have the same Gödel number).The second is that we do away with the assumption that the domains of variables need to be fixed in advance of a derivation. Instead we focus on what is needed to guarantee preservation of truth in every step of a derivation. These conditions on the domains of the variables, accumulated in the course of a derivation, are combined in a reference grammar. Whereas traditionally a derivation is considered valid when the conclusion follows from the premisses by way of the derivation rules (and possibly axioms), in the BV system a derivation must meet the extra condition that no inconsistency occurs within the reference grammar. For if the reference grammar were to give rise to inconsistency (i.e., it would be impossible to assign domains to all the variables without breaking at least one of the conditions placed on them in the reference grammar), there is no longer a guarantee that truth has been preserved in every step of the derivation, and hence the truth of the conclusion is not guaranteed by the derivation.In Chapter 2 the BV system is introduced in some formal detail. Chapter 3 gives some examples of derivations, notably totality of addition, multiplication and exponentiation, as well as a lemma needed for the proof of Euclid’s Theorem. These examples, taken from prof. Isles’ First-Order Reasoning and Primitive Recursive Natural Number Notations, show that there is a real proof-theoretical difference between traditional logic and the BV system. Here we also find the first major point of departure between myself and prof. Isles, centered on the notion of inheritance of conditions in the reference grammar by way of lemmata. These different points of view are best illustrated in the sections on the totality of exponentiation and on Euclid’s Lemma: prof. Isles maintains that the proof of totality of exponentiation is not BV valid, while I maintain that it is. But I do agree with him that the traditional proof of Euclid’s Lemma is not BV valid. Chapter 6 also expands the arguments for my choice in this matter.Now that it has been shown that there is a difference between traditional logic and BV, the properties of BV need to be examined. In Chapter 4 we give a proof of Cut-elimination for BV minus induction and the subformula property for BV, which allows us to prove the consistency of BV minus induction. We also expand on the reasons for excluding induction. In Chapter 5 we consider in detail the proof of a finite analog to the Löwenheim–Skolem theorem given by prof. Isles in his article with the same title. He proves that under certain conditions it is always possible, given the existence of a (possibly uncountable) model for a derivation, to give a finite model for this derivation. The system he considers deviates from BV as considered in this thesis in two significant ways: it does not contain the induction rule and the domains contain numbers instead of numerical notations. We then go on to show that it is possible to extend the result to include induction, in the sense that the existence of a possibly uncountable model for a derivation guarantees the existence of a model that is at most countable. We also consider the complications that arise from taking numerical expressions instead of numbers as the elements of domains.Finally, in Chapter 6 we consider the philosophical consequences of the BV system, informed by the formal results from the previous chapters. In particular we discuss the relation between reduction and reference, the status of reference grammars, the notion of induction and its function within BV, and some brief considerations on the consequences of the BV system for the discussion regarding nominalism and realism with regard to mathematical objects. The object of the chapter is twofold. On the one hand applying the formal results to philosophical questions, on the other hand arguing that BV is not just a theoretically acceptable alternative to traditional logic, but is in fact deserving of further development and research into its properties. The latter will probably appeal most to those of a nominalist and/or finitist bent.Abstract prepared by Harrie de Swart and Sven Storms.E-mail:[email protected]:https://research.tilburguniversity.edu/files/6170 1294/Storms_The_Buridan_Volpin_04_05_2022.pdf. (shrink)

The original stimulus for the choice of this topic was a book on intellectual history. One of the most brilliant authors in this field, Carl Becker, claims that the most important event in the intellectual history of modern time was the shift in the place of logic in science. According to Becker, the high esteem for logic which the scientist had in the age of St. Thomas Aquinas and through all the Middle Ages declined in the period of Galileo (...) and Newton. But at that time this decline was not yet fully understood. “The marriage of fact and reason” as Becker expresses himself “proved to be somewhat irksome in the nineteenth century and was altogether dissolved in the twentieth century.” The modern, twentieth century, physicist lives in an “atmosphere, which is so saturated with the actual that we can easily do with a minumum of theoretical” … “We have long since learned not to bother much with reason and logic.” To describe the spirit of twentieth century physics which emphasizes facts and minimizes reason Becker says: “Experiments seem to show that an electron may, for reasons best known to itself, be moving at two orbits at the same time. To this point Galileo's common sense method of noting the behavior of things, of sticking close to the observable facts has brought us. It has at last presented us with a fact that common sense repudiates.”. (shrink)

In his long-awaited new edition of Philosophy of Mathematics, James Robert Brown tackles important new as well as enduring questions in the mathematical sciences. Can pictures go beyond being merely suggestive and actually prove anything? Are mathematical results certain? Are experiments of any real value?" "This clear and engaging book takes a unique approach, encompassing nonstandard topics such as the role of visual reasoning, the importance of notation, and the place of computers in mathematics, as well (...) as traditional topics such as formalism, Platonism, and constructivism. The combination of topics and clarity of presentation make it suitable for beginners and experts alike. The revised and updated second edition of Philosophy of Mathematics contains more examples, suggestions for further reading, and expanded material on several topics including a novel approach to the continuum hypothesis."--BOOK JACKET. (shrink)

The issue of what constitutes a valid logical inference is a difficult question. At a minimum, we believe a permissible step in a proof must provide the reader with rational grounds to believe that the new step is a logically necessary consequence of previous assertions. However, this begs the question of what constitutes these rational grounds. Formalist accounts typically describe valid rules of inferences as those that can be found by applying one of the explicit rules of inference (...) in the formal system in which the proof is couched. However, philosophers of mathematics find such a description unhelpful because many inferences in the proofs that mathematicians actually produce cannot be expressed in a formal language, at least not without seriously distorting the semantic content of the inference (e.g., Larvor, 2012). In this chapter, we investigate mathematicians’ perceptions of a particular kind of inference in a particular setting. Specifically, we shed light on what types of graphical inferences mathematicians find permissible in a real analysis proof. Following Larvor (in press), we examine mathematicians’ reactions to metrical graphical inferences (i.e., inferences whose validity depends on the accuracy of the graph that was drawn and whose validity can be changed by minor deformations) and nonmetrical graphical inferences (i.e., inferences whose validity does not depend on a the accuracy of the graph and whose validity is not vulnerable to local deformations). The goal of this chapter is threefold. First, we demonstrate that most mathematicians reject metrical graphical inferences as impermissible in a real analysis proof. Second, we show that many mathematicians regard nonmetrical graphical inferences as permissible in a real analysis proofs. Third, we illustrate how mathematicians collectively disagree on the permissibility of nonmetrical inferences. (shrink)

This paper explores the relationship between informal reasoning, creativity in mathematics, and problem solving. It underscores the importance of environments that promote interaction, hypothesis generation, examination, refutation, derivation of new solutions, drawing conclusions, and reasoning with others, as key factors in enhancing mathematical creativity. Drawing on argumentation logic, the paper proposes a novel approach to uncover specific characteristics in the development of formalized proving using “proof-events.” Argumentation logic can offer reasoning mechanisms that facilitate these environments. (...) This paper proposes how argumentation can be implemented to discover certain characteristics in the development of formalized proving with “proof-events”. The concept of a proof-event was introduced by Goguen who described mathematical proof as a multi-agent social event involving not only “classical” formal proofs, but also other informal proving actions such as deficient or alleged proofs. Argumentation is an integral component of the discovery process for a mathematical proof since a proof necessitates a dialogue between provers and interpreters to clarify and resolve gaps or assumptions. By formalizing proof-events through argumentation, this paper demonstrates how informal reasoning and conflicts arising during the proving process can be effectively simulated. The paper presents an extended version of the proof-events calculus, rooted in argumentation theories, and highlights the intricate relationships among proof, human reasoning, cognitive processes, creativity, and mathematical arguments. (shrink)

The project of this Précis de philosophie de la logique et des mathématiques (vol. 1 under the direction of F. Poggiolesi and P. Wagner, vol. 2 under the direction of A. Arana and M. Panza) aims to offer a rich, systematic and clear introduction to the main contemporary debates in the philosophy of mathematics and logic. The two volumes bring together the contributions of thirty researchers (twelve for the philosophy of logic and eighteen for the philosophy of mathematics), specialists in (...) the history or philosophy of logic or mathematics. Each volume consists of ten chapters; each chapter is about forty pages, is independent from the others and deals with a particular philosophical question about logic or mathematics. The objective is to offer to the French-speaking reader a reference book. On many of the issues addressed, this Précis offers the first clear and thorough synthesis that is available in French. -/- This book is intended for third year / master's students, but also for teachers of philosophy in secondary or higher education, for logicians and mathematicians willing to take a philosophical look at the fundamental concepts of their discipline, and for any reader interested in the basic issues discussed in the philosophy of logic and mathematics. Each chapter is self-contained, although some basic training in logic (or in mathematics, as the case may be) is required. The book should be looked at as a comprehensive framework for contemporary discussions in the philosophy of logic and mathematics, while also giving some guidance on the disciplinary content required by these discussions. -/- The first three chapters of the present volume (on the philosophy of mathematics) are devoted to the history of the philosophy of mathematics: from antiquity to the modern era, and from this period to the foundational crisis of the nineteenth century, to the twentieth century. Next, four chapters deal with the crucial questions for the philosophy of mathematics of the twentieth century: the opposition and/or comparison of set theory and category theory as foundational frameworks for mathematics; mathematical constructivism; the analysis of calculability; and Benaceraff's problem. The two following chapters are focused on the philosophy of mathematical practice, by treating the notion of ideals of proof, in particular explanation and purity, and the notion of informal proof and the use of visual artifacts in mathematical argumentation. Finally the last chapter deals with the applicability of mathematics, including the role of probability. -/- In Chapter 1, Sébastien Maronne and David Rabouin present the history of the philosophy of mathematics from antiquity to the modern era. The goal is to show that the philosophy of mathematics has a history as ancient as mathematics and philosophy itself, a history largely continuous with the latter, often by staying out of sync with respect to the former. In Chapter 2, Sébastien Gandon discusses the question of the foundations of mathematics from Kant to the end of the nineteenth century. By tying this question to Kant, he is able to show that the discussion of the foundations of mathematics that occupied a large part of these two centuries has much older roots. Accent is placed on the differences between the framework proposed by Kant for making sense of classical mathematics and the use made by Frege and then Russell of logical tools for giving a different reading of arithmetic and real analysis. The link between between these different conceptions and the evolution of mathematics itself is also underlined. -/- Chapter 3, written by Hourya Benis-Sinaceur and Mirna Džamonja, deals with the evolution of mathematics in the twentieth century, notably the structuralist turn of Dedekind, E. Noether, and Bourbaki, and certain more recent developments. They devote themselves, among other things, to explaining how these developments can be understood as responses to and extensions of questions posed during the foundational debate of the immediately preceding era. -/- In Chapter 4, Jean-Pierre Marquis and Jean-Jacques Szczeciniarz discuss the different foundational options coming from set theory and category theory. They discuss, among other things, Lawvere's program to replace ZF with an axiomatization of the category of sets, the latter judged better adapted to the needs of contemporary mathematics. Different reactions, as much philosophical as technical, raised by this program are also taken into account. -/- Constructive mathematics are the object of Chapter 5, in which Gerhard Heinzmann and Mark van Atten examine in a critical and comparative manner a variety of constructivisms, including intuitionism, constructive type theory, predicativism, and finitism. -/- In Chapter 6, Guido Gherardi and Maël Pegny present computability theory, stressing its philosophical consequences. They discuss the basic concepts of this theory, for the computability of both the natural numbers and the real numbers. They then tackle the theory of computational complexity. -/- In Chapter 7, Andrea Sereni and Fabrice Pataut present Benacerraf's problem, opposing every possible account of mathematical knowledge to the availability of a theory of truth founded on an abstract ontology of mathematical objects. They give an overview of the original problem and its reformulation by Hartry Field, and reconstruct the debate that this problem has raised, by meeting at once the major opposing positions today of the analytic affiliation of the philosophy of mathematics, as much those on the platonist side as on that of nominalism. -/- In Chapter 8, Valeria Giardino and Yacin Hamami treat certain crucial aspects of the philosophy of mathematical practice. They deal in particular with the notion of an informal proof and on the role of artifacts in mathematical reasoning. They consider how such proofs, making use of these means, can contribute to the understanding of theorems and mathematical theories, thanks also to the role of visualisation and the aid of computer tools. -/- Why do mathematics often give several proofs of the same theorem? This is the question that Andrew Arana raises in Chapter 9, introducing the notion of an epistemic ideal and discuss two such ideals, the explanatoriness and purity of proof. -/- Chapter 10 is devoted to the applicability of mathematics in the study of empirical phenomena. After summarizing the history of this question, going back to Plato and Aristotle and passing by Mill and Kant, Daniele Molinini and Marco Panza reconstruct the contemporary debate, in relation, among other things, to questions raised in the philosophy of science. -/- Two appendices complete the volume. In the first Frédéric Patras treats the French tradition in philosophy of mathematics of the 20th century. In the second, Maria Carla Galavotti discusses the notion of probability and its use in science. (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)

This volume of essays addresses the main problem confronting an epistemology for mathematics; namely, the nature and sources of mathematical justification. Attending to both particular and general issues, the essays, by leading philosophers of mathematics, raise important issues for our current understanding of mathematics. Is mathematical justification a priori or a posteriori? What role, if any, does logic play in mathematical reasoning or inference? And of what epistemological importance is the formalizability of proof? The editor, (...) Michael Detlefsen, has brought together an outstanding collection of essays, only one of which has previously appeared. It will be essential for philosophers and historians of mathematics, as well as philosophically inclined logicians and philosophers interested in the nature of reasoning and justification. A companion volume entitled Proof, Logic and Formalization, edited by Michael Detlefsen, is also available from Routledge. (shrink)

This project is in the first place an attempt to clarify what transcendental logic is and how Kant uses it in order to achieve his goals. I use two keys in unlocking transcendental logic: Kant's philosophy of mathematics and his account of modality. I argue that Kant's categorical separation of philosophical and mathematical cognition in his reflections on method is too sweeping and undifferentiated to account for his practice in transcendental logic. On the basis of an examination of (...) what it would take in order to sustain Kant's claim for the peculiarity of modal judgments---their subjective syntheticity---I argue that the positive claims that transcendental logic makes regarding objects are legitimated by the construction of an object as such, whose concept is provided by the sum total of the categories. I suggest that the schemata play a role analogous to that of the a priori constructed figure in a mathematical proof and provide a reconstruction of the Transcendental Doctrine of the Capacity of Judgment which makes sense of Kant's decision to label the modal principles 'postulates' in the precise sense of the Euclidean mathematicians. Part Two argues that Kant's practical philosophy is grounded on something which deserves to be called a transcendental logic every bit as much as the logic that we find in the Critique of Pure Reason. Instead of being based upon our capacity for theoretical judgment, in which we refer a concept to an ontic object via intuition, practical transcendental logic is based upon our capacity for practical judgment , in which we refer a concept to a deontic object via feeling. I show how the central arguments of Kant's practical philosophy rely implicitly upon the construction of a good will as such, which plays a semantic role analogous to that of the object as such in theoretical philosophy. One part of my case is contained in the demonstration that 'good' functions as a practical modal concept and that predications of goodness have a peculiar logical form, analogous to that exhibited by theoretical predications of existence. (shrink)

Many philosophers have considered logical reasoning as an inborn ability of mankind and as a distinctive feature in the human mind; but we all know that the distribution of this capacity, or at any rate its development, is very unequal. Few people are able to set up a cogent argument; others are at least able to follow a logical argument and even to detect logical fallacies. Nevertheless, even among educated persons there are many who do not (...) even attain this relatively modest level of development. According to my personal observations, lack of logical ability may be due to various circumstances. In the first place, I mention lack of general intelligence, insufficient power of concentration, and absence of formal education. Secondly, however, I have noticed that many people are unable, or sometimes rather unwilling, to argue ex hypothesi; such persons cannot, or will not, start from premisses which they know or believe to be false or even from premisses whose truth is not, in their opinion, sufficient ly warranted. Or, if they agree to start from such premisses, they sooner or later stray away from the argument into attempts first to settle the truth or falsehood of the premisses. Presumably this attitude results either from lack of imagination or from undue moral rectitude. On the other hand, proficiency in logical reasoning is not in itself a guarantee for a clear theoretic insight into the principles and foundations of logic. (shrink)

ABSTRACT I suggest how a broadly Kantian critique of classical logic might spring from reflections on constructibility conditions. According to Kant, mathematics is concerned with objects that are given through ‘arbitrary synthesis,’ in the form of ‘constructions of concepts’ in the medium of ‘pure intuition.’ Logic, by contrast, is narrowly constrained – it has no objects of its own and is fixed by the very forms of thought. That is why there is not much room for developments within logic, as (...) compared to the progress in mathematics. Kant’s view of logic remains critical, though – through considerations that are effectively on the scope and limits of classical logic and which play a part in his transcendental idealism. The most important ones are to be found in his critique of the use of reductio ad absurdum proofs in metaphysics and his solutions to the ‘antinomies of pure reason.’ Arguably, these considerations carry over to mathematics as well – by way of ‘analogues’ to the antinomies – in particular in resolving infinity paradoxes. (shrink)

Formal verification involves the use of logical and computational methods to establish claims that are expressed in precise mathematical terms. These can include ordinary mathematical theorems, as well as claims that pieces of hardware or software, network protocols, and mechanical and hybrid systems meet their specifications. In practice, there is not a sharp distinction between verifying a piece of mathematics and verifying the correctness of a system: formal verification requires describing hardware and software systems in mathematical (...) terms, at which point establishing claims as to their correctness becomes a form of theorem proving. Conversely, the proof of a mathematical theorem may require a lengthy computation, in which case verifying the truth of the theorem requires verifying that the computation does what it is supposed to do. The gold standard for supporting a mathematical claim is to provide a proof, and twentieth-century developments in logic show most if not all conventional proof methods can be reduced to a small set of axioms and rules in any of a number of foundational systems. With this reduction, there are two ways that a computer can help establish a claim: it can help find a proof in the first place, and it can help verify that a purported proof is correct. Automated theorem proving focuses on the “finding” aspect. Resolution theorem provers, tableau theorem provers, fast satisfiability solvers, and so on provide means of establishing the validity of formulas in propositional and first-order logic. Other systems provide search procedures and decision procedures for specific languages and domains, such as linear or nonlinear expressions over the integers or the real numbers. Architectures like SMT combine domain-general search methods with domain-specific procedures. Computer algebra systems and specialized mathematical software packages provide means of carrying out mathematical computations, establishing mathematical bounds, or finding mathematical objects. A calculation can be viewed as a proof as well, and these systems, too, help establish mathematical claims. Automated reasoning systems strive for power and efficiency, often at the expense of guaranteed soundness. Such systems can have bugs, and it can be difficult to ensure that the results they deliver are correct. In contrast, interactive theorem proving focuses on the “verification” aspect of theorem proving, requiring that every claim is supported by a proof in a suitable axiomatic foundation. This sets a very high standard: every rule of inference and every step of a calculation has to be justified by appealing to prior definitions and theorems, all the way down to basic axioms and rules. In fact, most such systems provide fully elaborated “proof objects” that can be communicated to other systems and checked independently. Constructing such proofs typically requires much more input and interaction from users, but it allows us to obtain deeper and more complex proofs. The Lean Theorem Prover aims to bridge the gap between interactive and automated theorem proving, by situating automated tools and methods in a framework that supports user interaction and the construction of fully specified axiomatic proofs. The goal is to support both mathematical reasoning and reasoning about complex systems, and to verify claims in both domains. (shrink)

The problem of precise characterisation of traditional forms of reasoning applied in mathematics was independently investigated and successfully resolved by Jaśkowski and Gentzen in 1934. However, there are traces of earlier interests in this field exhibited by the members of the Lvov-Warsaw School. We focus on the results obtained by Jaśkowski and Leśniewski. Jaśkowski provided the first formal system of natural deduction in 1926. Leśniewski also demonstrated in some of his papers how to construct proofs in accordance with intuitively (...) correct principles. (shrink)

The notion of proof is central to mathematics yet it is one of the most difficult aspects of the subject to teach and master. In particular, undergraduate mathematics students often experience difficulties in understanding and constructing proofs. Understanding Mathematical Proof describes the nature of mathematical proof, explores the various techniques that mathematicians adopt to prove their results, and offers advice and strategies for constructing proofs. It will improve students’ ability to understand proofs and construct correct (...) proofs of their own. The first chapter of the text introduces the kind of reasoning that mathematicians use when writing their proofs and gives some example proofs to set the scene. The book then describes basic logic to enable an understanding of the structure of both individual mathematical statements and whole mathematical proofs. It also explains the notions of sets and functions and dissects several proofs with a view to exposing some of the underlying features common to most mathematical proofs. The remainder of the book delves further into different types of proof, including direct proof, proof using contrapositive, proof by contradiction, and mathematical induction. The authors also discuss existence and uniqueness proofs and the role of counter examples. (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)

Parallelism has been drawn between modes of representation and problem-sloving processes: Diagrams are more useful for brainstorming while symbolic representation is more welcomed in a formal proof. The paper gets to the root of this clear-cut dualistic picture and argues that the strength of diagrammatic reasoning in the brainstorming process does not have to be abandoned at the stage of proof, but instead should be appreciated and could be preserved in mathematical proofs.

If we consider Wittgenstein's career as a whole, it appears that he wrote more on the philosophy of logic and mathematics than any other subject. Yet his writings on these subjects have exerted little influence. Indeed, the tide of response to Remarks on the Foundations of Mathematics, which contains the bulk of his latest views of mathematics, has been for the most part overwhelmingly negative. Given his later emphasis on the context-bound character of language, mathematics and logic--where language apparently operates (...) in an maximally precise, clear and general way--represent two of the most difficult cases for Wittgenstein to confront. My thesis aims to defend Wittgenstein from the charges of benighted arrogance traditionally levelled against him. I argue that Wittgenstein's later discussions of mathematics form a central part of a larger philosophical project, internally related to Philosophical Investigations and shaping in specific ways Wittgenstein's reaction to both scepticism and accounts of the nature of logical and mathematical truth. I see Wittgenstein criticizing the unreflective use of mathematical tools in philosophy, not offering a competing philosophy of mathematics. ;Too few of Wittgenstein's readers have been willing to offer detailed exegesis of his writing . This has made it difficult to understand how the aphoristic style of his late writing bears on the philosophical problems being discussed. On my view, the quality of Wittgenstein's writing is intrinsic to his later conception of the nature of logic, mathematics and philosophy. Line by line engagement with his texts is thus imperative in order to achieve an understanding of his philosophical objectives and criticisms. My dissertation offers as a paradigm of such reading a detailed exegesis and criticism of the opening five sections of Remarks on the Foundations of Mathematics. ;I briefly explore in some detail the origin and genesis of Wittgenstein's interest in rule-following, from its roots in the Tractatus's conception of logical syntax. This background illuminates Wittgenstein's later conception of logical truth and his criticisms of Frege's and Russell's arguments for logicism. To explore these criticisms, I focus on Wittgenstein' s discussions of the Frege-Russell definition of "Number" in "logical" terms. Placed in their appropriate philosophical and historical context, Wittgenstein's seemingly outrageous remarks about the nature of proof, mathematical logic and the foundations of mathematics do not simply betray his ignorance. Nor do they commit him to a revisionist attitude toward mathematical practice. Rather, they raise fundamental questions about the philosophical presuppositions lying behind attempts to bring particular mathematical results to bear in philosophy. (shrink)

Abstract. In Dynamics of Reason Michael Friedman proposes a kind of synthesis between the neokantianism of Ernst Cassirer, the logical empiricism of Rudolf Carnap, and the historicism of Thomas Kuhn. Cassirer and Carnap are to take care of the Kantian legacy of modern philosophy of science, encapsulated in the concept of a relativized a priori and the globally rational or continuous evolution of scientific knowledge,while Kuhn´s role is to ensure that the historicist character of scientific knowledge is taken seriously. (...) More precisely, Carnapian linguistic frameworks, guarantee that the evolution of science procedes in a rational manner locally,while Cassirer’s concept of an internally defined conceptual convergence of empirical theories provides the means to maintain the global continuity of scientific reason. In this paper it is argued that Friedman’s neokantian account of scientific reason based on the concept of the relativized a priori underestimates the pragmatic aspects of the dynamics of scientific reason. To overcome this short-coming, I propose to reconsider C.I. Lewis’s account of a pragmatic the priori, recently modernized and elaborated by Hasok Chang. This may be<br><br><br><br><br><br><br><br><br><br&g t;<br><br><br><br><br><br>Keywords: Dynamics of reason, Paradigms, Logical Empiricism,Neokantianism, Pragmatism, Mathematics, Communicative Rationality. (shrink)

§1. Introduction. I dedicate this essay to the two-dozen-odd people whose refutations of Cantor's diagonal argument have come to me either as referee or as editor in the last twenty years or so. Sadly these submissions were all quite unpublishable; I sent them back with what I hope were helpful comments. A few years ago it occurred to me to wonder why so many people devote so much energy to refuting this harmless little argument—what had it done to make them (...) angry with it? So I started to keep notes of these papers, in the hope that some pattern would emerge.These pages report the results. They might be useful for editors faced with similar problem papers, or even for the authors of the papers themselves. But the main message to reach me is that there are several points of basic elementary logic that we usually teach and explain very badly, or not at all.In 1995 an engineer named William Dilworth, who had published a refutation of Cantor's argument in the Transactions of the Wisconsin Academy of Sciences, Arts and Letters, sued for libel a mathematician named Underwood Dudley who had called him a crank. (shrink)

I examine the question why in Proclus' view genetic processes provide demonstrative explanations, in light of the interpretation of Aristotle's theory of demonstration in late antiquity. I show that in this interpretation mathematics is not an explanatory science in the strict sense because its objects, being immaterial, do not admit causal explanation. Placing Proclus' account of demonstrative explanation in this context, I argue that this account is aimed at answering the question whether mathematical proofs provide causal explanation as opposed (...) to grounds. I show further that Proclus can answer this question in the affirmative due to his realist view of mathematical objects and the priority he ascribes to causal relations over logical relations. (shrink)