Mathematical Proof, Misc

This is the PhD dissertation, written under supervision of Professor Jerzy Słupecki, published in the book: U.Wybraniec-Skardowska i Grzegorz Bryll "Z badań nad teorią zdań odrzuconych" ( "Studies of theory of rejected sentences"), Zeszyty Naukowe Wyższej Szkoły Pedagogicznej w Opolu, Seria B: Studia i Monografie nr 22, pp. 5-131. It is the first, original publication on the theory of rejected sentences on which are based, among other, papers: "Theory of rejected propositions. I"and "Theory of rejected propositions II" with Jerzy Słupecki (...) and Grzegorz Bryll. -/- -/- . (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)

We investigated whether mathematicians typically agree about the qualities of mathematical proofs. Between-mathematician consensus in proof appraisals is an implicit assumption of many arguments made by philosophers of mathematics, but to our knowledge the issue has not previously been empirically investigated. We asked a group of mathematicians to assess a specific proof on four dimensions, using the framework identified by Inglis and Aberdein (2015). We found widespread disagreement between our participants about the aesthetics, intricacy, precision and utility of the proof, (...) suggesting that a priori assumptions about the consistency of mathematical proof appraisals are unreasonable. (shrink)

With respect to the confirmation of mathematical propositions, proof possesses an epistemological authority unmatched by other means of confirmation. This paper is an investigation into why this is the case. I make use of an analysis drawn from an early reliability perspective on knowledge to help make sense of mathematical proofs singular epistemological status.

Various ideals of purity are surveyed and discussed. These include the classical Aristotelian ideal, as well as certain neo-classical and contemporary ideals. The focus is on a type of purity ideal I call topical purity. This is purity which emphasizes a certain symmetry between the conceptual resources used to prove a theorem and those needed for the clarification of its content. The basic idea is that the resources of proof ought ideally to be restricted to those which determine its content.

A textbook on proof in mathematics, inspired by an Aristotelian point of view on mathematics and proof. It explains how to prove statements in mathematics, from evident premises. It deals with the proof of "all" statements, "some" statements, multiple quantifiers and mathematical induction.

Many mathematicians and philosophers of mathematics believe some proofs contain elements extraneous to what is being proved. In this paper I discuss extraneousness generally, and then consider a specific proposal for measuring extraneousness syntactically. This specific proposal uses Gentzen's cut-elimination theorem. I argue that the proposal fails, and that we should be skeptical about the usefulness of syntactic extraneousness measures.

The aim of this article is to explain why knot diagrams are an effective notation in topology. Their cognitive features and epistemic roles will be assessed. First, it will be argued that different interpretations of a figure give rise to different diagrams and as a consequence various levels of representation for knots will be identified. Second, it will be shown that knot diagrams are dynamic by pointing at the moves which are commonly applied to them. For this reason, experts must (...) develop a specific form of enhanced manipulative imagination, in order to draw inferences from knot diagrams by performing epistemic actions. Moreover, it will be argued that knot diagrams not only can promote discovery, but also provide evidence. This case study is an experimentation ground to evaluate the role of space and action in making inferences by reasoning diagrammatically. (shrink)

Internal Logic brings together several threads of Yvon Gauthier's work on the foundations of mathematics and revisits his attempt to, as he puts it, radicalize Hilbert's Program. A radicalization of Hilbert's Program, I take it, is supposed to take Hilberts' finitary viewpoint more seriously than other attempts to salvage Hilbert's Program have. Such a return to the "roots of Hilbert's metamathematical idea" will, so claims Gauthier, enable him to save Hilbert's Program.

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)

The aim of this article is to investigate specific aspects connected with visualization in the practice of a mathematical subfield: low-dimensional topology. Through a case study, it will be established that visualization can play an epistemic role. The background assumption is that the consideration of the actual practice of mathematics is relevant to address epistemological issues. It will be shown that in low-dimensional topology, justifications can be based on sequences of pictures. Three theses will be defended. First, the representations used (...) in the practice are an integral part of the mathematical reasoning. As a matter of fact, they convey in a material form the relevant transitions and thus allow experts to draw inferential connections. Second, in low-dimensional topology experts exploit a particular type of manipulative imagination which is connected to intuition of two- and three-dimensional space and motor agency. This imagination allows recognizing the transformations which connect different pictures in an argument. Third, the epistemic—and inferential—actions performed are permissible only within a specific practice: this form of reasoning is subject-matter dependent. Local criteria of validity are established to assure the soundness of representationally heterogeneous arguments in low-dimensional topology. (shrink)

In the early 1920s, the German mathematician David Hilbert (1862–1943) put forward a new proposal for the foundation of classical mathematics which has come to be known as Hilbert's Program. It calls for a formalization of all of mathematics in axiomatic form, together with a proof that this axiomatization of mathematics is consistent. The consistency proof itself was to be carried out using only what Hilbert called “finitary” methods. The special epistemological character of finitary reasoning then yields the required justification (...) of classical mathematics. Although Hilbert proposed his program in this form only in 1921, various facets of it are rooted in foundational work of his going back until around 1900, when he first pointed out the necessity of giving a direct consistency proof of analysis. Work on the program progressed significantly in the 1920s with contributions from logicians such as Paul Bernays, Wilhelm Ackermann, John von Neumann, and Jacques Herbrand. It was also a great influence on Kurt Gödel, whose work on the incompleteness theorems were motivated by Hilbert's Program. Gödel's work is generally taken to show that Hilbert's Program cannot be carried out. It has nevertheless continued to be an influential position in the philosophy of mathematics, and, starting with the work of Gerhard Gentzen in the 1930s, work on so-called Relativized Hilbert Programs have been central to the development of proof theory. (shrink)

This paper addresses the question: given some theory T that we accept, is there some natural, generally applicable way of extending T to a theory S that can prove a range of things about what it itself (i.e. S) can prove, including a range of things about what it cannot prove, such as claims to the effect that it cannot prove certain particular sentences (e.g. 0 = 1), or the claim that it is consistent? Typical characterizations of Gödel’s second incompleteness (...) theorem, and its significance, would lead us to believe that the answer is ‘no’. But the present paper explores a positive answer. The general approach is to follow the lead of recent (and not so recent) approaches to truth and the Liar paradox. (shrink)

In this largely theoretical article, we discuss the relation between a kind of affect, behavioural schemas and aspects of the proving process. We begin with affect as described in the mathematics education literature, but soon narrow our focus to a particular kind of affect – nonemotional cognitive feelings. We then mention the position of feelings in consciousness because that bears on the kind of data about feelings that students can be expected to be able to report. Next we introduce the (...) idea of behavioural schemas as enduring mental structures that link situations to actions, in other words, habits of mind, that appear to drive many mental actions in the proving process. This leads to a discussion of the way feelings can both help cause mental actions and also arise from them. Then we briefly describe a design experiment – a course intended to help advanced undergraduate and beginning graduate mathematics students improve their proving abilities. Finally, drawing on data from the course, along with several interviews, we illustrate how these perspectives on affect and on behavioural schemas appear to explain, and are consistent with, our students’ actions. (shrink)

The formal sciences - mathematical as opposed to natural sciences, such as operations research, statistics, theoretical computer science, systems engineering - appear to have achieved mathematically provable knowledge directly about the real world. It is argued that this appearance is correct.

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)

This paper proposes an account of mathematical reasoning as parallel in structure: the arguments which mathematicians use to persuade each other of their results comprise the argumentational structure; the inferential structure is composed of derivations which offer a formal counterpart to these arguments. Some conflicts about the foundations of mathematics correspond to disagreements over which steps should be admissible in the inferential structure. Similarly, disagreements over the admissibility of steps in the argumentational structure correspond to different views about mathematical practice. (...) The latter steps may be analysed in terms of argumentation schemes. Three broad types of scheme are distinguished, a distinction which is then used to characterize and evaluate four contrasting approaches to mathematical practice. (shrink)

We consider a seemingly popular justification (we call it the Re-flexivity Defense) for the third derivability condition of the Hilbert-Bernays-Löb generalization of Godel's Second Incompleteness Theorem (G2). We argue that (i) in certain settings (rouglily, those where the representing theory of an arithmetization is allowed to be a proper subtheory of the represented theory), use of the Reflexivity Defense to justify the tliird condition induces a fourth condition, and that (ii) the justification of this fourth condition faces serious obstacles. We (...) conclude that, in the types of settings mentioned, the Reflexivity Defense does not justify the usual ‘reading’ of G2—namely, that the consistency of the represented theory is not provable in the representing theory. (shrink)

This paper discusses an intriguing, though rather overlooked case of normative disagreement in the history of philosophy of mathematics: Weyl's criticism of Dedekind’s famous principle that "In science, what is provable ought not to be believed without proof." This criticism, as I see it, challenges not only a logicist norm of belief in mathematics, but also a realist view about whether there is a fact of the matter as to what norms of belief are correct.

Duality has often been described as a means of extending our knowledge with a minimal additional outlay of investigative resources. I consider possible arguments for this view. Major elements of this argument are out of keeping with certain widely held views concerning the nature of axiomatic theories (both in projective geometry and elsewhere). They also require a special form of consistency requirement.

In the present article we attempt to show that Aristotle's syllogistic is an underlying logiC which includes a natural deductive system and that it isn't an axiomatic theory as had previously been thought. We construct a mathematical model which reflects certain structural aspects of Aristotle's logic. We examine the relation of the model to the system of logic envisaged in scattered parts of Prior and Posterior Analytics. Our interpretation restores Aristotle's reputation as a logician of consummate imagination and skill. Several (...) attributions of shortcomings and logical errors to Aristotle are shown to be without merit. Aristotle's logic is found to be self-sufficient in several senses: his theory of deduction is logically sound in every detail. (His indirect deductions have been criticized, but incorrectly on our account.) Aristotle's logic presupposes no other logical concepts, not even those of propositional logic. The Aristotelian system is seen to be complete in the sense that every valid argument expressible in his system admits of a deduction within his deductive system: every semantically valid argument is deducible. (shrink)

Abstract -/- A tendency to view logical cognition and creativity as antitheses has begun taking root in popular culture. This article argues that logical reasoning actually affords many avenues for creative expression. A fundamental distinction between the two basic kinds of logical inference, deductive and adductive, is articulated, with some passing discussion as well of induction and of reasoning by analogy. The adductive creation of new systems or logical forms is likened to musical composition. Criteria for what constitutes an `interesting' (...) logical form are stated. The topic of creativity in relation to deductive problem-solving or theorem-proving leads to consideration of the construct of `elegance' in logic. Finally, paradoxes and quine sentences are exhibited as evincing the logician's aesthetic interest in such things as possess a `strangeness in the proportion'. Several original paradoxical constructions are presented. (shrink)

This chapter gives a detailed study of diagram-based reasoning in Euclidean plane geometry (Books I, III), as well as an exploration how to characterise a geometric practice. First, an account is given of diagram attribution: basic geometrical claims are classified as exact (equalities, proportionalities) or co-exact (containments, contiguities); exact claims may only be inferred from prior entries in the demonstration text, but co-exact claims may be asserted based on what is seen in the diagram. Diagram control by constructions is necessary (...) for this to work. Case-branching occurs when a construction renders a diagram un-representative. The roles of diagrams in reductio arguments, and of objection in probing a demonstration, are discussed. (shrink)

The traditional opposition between mathematical proof and rhetorical argument is based on a non-contextual picture of proof, against which historical and theoretical objections have been raised. The author advocates a different opposition, between epistemic rhetoric and instrumental rhetoric. Instrumental rhetoric aims at persuasion without caring for truth. Epistemic rhetoric is a practice aimed at both persuasion and truth. Aiming at truth is a way of acting, which can be characterized in terms of epistemically virtuous behavioural traits. In this sense epistemic (...) rhetoric aims at truth, even though it is contextual and addressed to a particular audience. Real life mathematical proofs are instances of epistemic rhetoric and contextual rigour. But it is right to contrast proofs with instrumentally rhetoric arguments. (shrink)

This is the first interdisciplinary exploration of the philosophical foundations of the Web, a new area of inquiry that has important implications across a range of domains. - Contains twelve essays that bridge the fields of philosophy, cognitive science, and phenomenology. - Tackles questions such as the impact of Google on intelligence and epistemology, the philosophical status of digital objects, ethics on the Web, semantic and ontological changes caused by the Web, and the potential of the Web to serve as (...) a genuine cognitive extension. - Brings together insightful new scholarship from well-known analytic and continental philosophers, such as Andy Clark and Bernard Stiegler, as well as rising scholars in “digital native” philosophy and engineering. - Includes an interview with Tim Berners-Lee, the inventor of the Web. (shrink)

The Web may critically transform the way we understand the activity of proving. The Web as a collaborative medium allows the active participation of people with different backgrounds, interests, viewpoints, and styles. Mathematical formal proofs are inadequate for capturing Web-based proofs. This article claims that Web provings can be studied as a particular type of Goguen's proof-events. Web-based proof-events have a social component, communication medium, prover-interpreter interaction, interpretation process, understanding and validation, historical component, and styles. To demonstrate its claim, the (...) article discusses the Kumo and Polymath projects, both of which employ Web-based communication as part of proving. Web proving is a novel type of proving activity that may have a serious impact on the change in mathematical practices, despite the fact that it is not currently a universally acceptable methodology. (shrink)

The compulsion of proofs is an ancient idea, which plays an important role in Plato’s dialogues. The reader perhaps recalls Socrates’ question to the slave boy in the Meno: “If the side of a square A is 2 feet, and the corresponding area is 4, how long is the side of a square whose area is double, i.e. 8?”. The slave answers: “Obviously, Socrates, it will be twice the length” (cf. Me 82-85). A straightforward analogy: if the area is double, (...) the side is double. Nevertheless, the answer is wrong. Socrates wants to lead the slave to the right conclusion. The boy should reach the truth through steps that are all “his own”, performed with full conviction. To this aim, Socrates addresses a series of short pressing questions to the slave boy. Simple questions provoke equally simple replies, though the boy is sometimes puzzled and surprised by the answers he feels compelled to give. In the first part of the exchange the boy is gradually forced to admit that a square B with double side (i.e. side of length 4) has an area which is not double, but four times as big, i. e. 16. In the second part the boy hazards the guess that the square with double area has a side of length 3, since 3 is between 2 and 4. But Socrates easily drives him to acknowledging that if the side is 3, the area of the resulting square C is 9, not 8. The boy can only exclaim: “By Zeus, Socrates, I do not know!”. In the third part, at Socrates’ prompting, the diagonal of the original square A is drawn within the second fourfold square B. Responding to Socrates’ questions, the boy is led to conclude that the square D whose side is the diagonal of A is precisely the required square: its area is 8. (shrink)

Recent accounts of the role of diagrams in mathematical reasoning take a Platonic line, according to which the proof depends on the similarity between the perceived shape of the diagram and the shape of the abstract object. This approach is unable to explain proofs which share the same diagram in spite of drawing conclusions about different figures. Saccheri’s use of the bi-rectangular isosceles quadrilateral in Euclides Vindicatus provides three such proofs. By forsaking abstract objects it is possible to give a (...) natural explanation of Saccheri’s proofs as well as standard geometric proofs and even number-theoretic proofs. (shrink)

Philosophers of mathematics commonly distinguish between explanatory and non-explanatory proofs. An important subclass of mathematical proofs are proofs by induction. Are they explanatory? This paper addresses the question, based on general principles about explanation. First, a recent argument for a negative answer is discussed and rebutted. Second, a case is made for a qualified positive take on the issue.

Mathematical proofs generally allow for various levels of detail and conciseness, such that they can be adapted for a particular audience or purpose. Using automated reasoning approaches for teaching proof construction in mathematics presupposes that the step size of proofs in such a system is appropriate within the teaching context. This work proposes a framework that supports the granularity analysis of mathematical proofs, to be used in the automated assessment of students' proof attempts and for the presentation of hints and (...) solutions at a suitable pace. Models for granularity are represented by classifiers, which can be generated by hand or inferred from a corpus of sample judgments via machine-learning techniques. This latter procedure is studied by modeling granularity judgments from four experts. The results provide support for the granularity of assertion-level proofs but also illustrate a degree of subjectivity in assessing step size. (shrink)

(No abstract is available for this citation).

It is a trivial fact that if we have a square table filled with numbers, we can always form a column which is not yet contained in the table. Despite its apparent triviality, this fact underlies the foundations of most of the path-breaking results of logic in the second half of the nineteenth and the first half of the twentieth century. We explain how this fact can be used to show that there are more sequences of natural numbers than there (...) are natural numbers, that there are more real numbers than natural numbers and that every set has more subsets than elements (all results due to Cantor); we indicate how this fact can be seen as underlying the celebrated Russell paradox; and we show how it can be employed to expose the most fundamental result of mathematical logic of the twentieth century, Gödel's incompleteness theorem. Finally, we show how this fact yields the unsolvability of the halting problem for Turing machines. (shrink)

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

Ralph Johnson argues that mathematical proofs lack a dialectical tier, and thereby do not qualify as arguments. This paper argues that, despite this disavowal, Johnson’s account provides a compelling model of mathematical proof. The illative core of mathematical arguments is held to strict standards of rigour. However, compliance with these standards is itself a matter of argument, and susceptible to challenge. Hence much actual mathematical practice takes place in the dialectical tier.

Many mathematicians have sought ‘pure’ proofs of theorems. There are different takes on what a ‘pure’ proof is, though, and it’s important to be clear on their differences, because they can easily be conflated. In this paper I want to distinguish between two of them.