In mathematics, the deductive method reigns. Without proof, a claim remains unsolved, a mere conjecture, not something that can be simply assumed; when a proof is found, the problem is solved, it turns into a “result,” something that can be relied on. So mathematicians think. But is there more to mathematical justification than proof? -/- The answer is an emphatic yes, as I explain in this article. I argue that non-deductive justification is in fact pervasive in (...) class='Hi'>mathematics, and that it is in good epistemic standing. (shrink)

Mathematicians often speak of conjectures as being confirmed by evidence that falls short of proof. For their own conjectures, evidence justifies further work in looking for a proof. Those conjectures of mathematics that have long resisted proof, such as Fermat's Last Theorem and the Riemann Hypothesis, have had to be considered in terms of the evidence for and against them. It is argued here that it is not adequate to describe the relation of evidence to hypothesis as `subjective', `heuristic' (...) or `pragmatic', but that there must be an element of what it is rational to believe on the evidence, that is, of non-deductive logic. (shrink)

In mathematics, the deductive method reigns. Without proof, a claim remains unsolved, a mere conjecture, not something that can be simply assumed; when a proof is found, the problem is solved, it turns into a “result,” something that can be relied on. So mathematicians think. But is there more to mathematical justification than proof?The answer is an emphatic yes, as I explain in this chapter. I argue that non-deductive justification is in fact pervasive in mathematics, and (...) that it is in good epistemic standing. (shrink)

Mathematics used to be portrayed as a deductive science. Stemming from Polya, however, is a philosophical movement which broadens the concept of mathematical reasoning to include inductive or quasi-empirical methods. Interest in inductive methods is a welcome turn from foundationalism toward a philosophy grounded in mathematical practice. Regrettably, though, the conception of mathematical reasoning embraced by quasi-empiricists is still too narrow to include the sort of thought-experiment which Mueller describes as traditional mathematical proof and which Lakatos examines in (...) Proofs and refutations. This paper extends the concept of mathematical reasoning along two further dimensions to accommodate thought-experiment.Keywords: Thought-experiment; Informal proof; Mathematical reasoning. (shrink)

The discussion on mathematical explanation has inherited the same sense of dissatisfaction that philosophers of science expressed, in the context of scientific explanation, towards the deductive-nomological model. This model is regarded as unable to cover cases of bona fide mathematical explanations and, furthermore, it is largely ignored in the relevant literature. Surprisingly, the reasons for this ostracism are not sufficiently manifest. In this paper I explore a possible extension of the model to the case of mathematical explanations and I (...) claim that there are at least two reasons to judge the deductive-nomological picture of explanation as inadequate in that context. (shrink)

I propose a deductive-nomological model for mathematical scientific explanation. In this regard, I modify Hempel’s deductive-nomological model and test it against some of the following recent paradigmatic examples of the mathematical explanation of empirical facts: the seven bridges of Königsberg, the North American synchronized cicadas, and Hénon-Heiles Hamiltonian systems. I argue that mathematical scientific explanations that invoke laws of nature are qualitative explanations, and ordinary scientific explanations that employ mathematics are quantitative explanations. I analyse the repercussions of (...) this deductivenomological model on causal explanations. (shrink)

This work has been selected by scholars as being culturally important, and is part of the knowledge base of civilization as we know it. This work was reproduced from the original artifact, and remains as true to the original work as possible. Therefore, you will see the original copyright references, library stamps (as most of these works have been housed in our most important libraries around the world), and other notations in the work. This work is in the public domain (...) in the United States of America, and possibly other nations. Within the United States, you may freely copy and distribute this work, as no entity (individual or corporate) has a copyright on the body of the work. As a reproduction of a historical artifact, this work may contain missing or blurred pages, poor pictures, errant marks, etc. Scholars believe, and we concur, that this work is important enough to be preserved, reproduced, and made generally available to the public. We appreciate your support of the preservation process, and thank you for being an important part of keeping this knowledge alive and relevant. (shrink)

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

An examination of the emergence of the phenomenon of deductive argument in classical Greek mathematics.

Recent studies have shown that deductive reasoning skills are related to mathematical abilities. Nevertheless, so far the links between mathematical abilities and these two forms of deductive inference have not been investigated in a single study. It is also unclear whether these inference forms are related to both basic maths skills and mathematical reasoning, and whether these relationships still hold if the effects of fluid intelligence are controlled. We conducted a study with 87 adult participants. The results showed (...) that transitive reasoning skills were related to performance on a number line task, and conditional inferences were related to arithmetic skills. Additionally, both types of deductive inference were related to mathematical reasoning skills, although transitive and conditional reasoning ability were unrelated. Our results also highlighted the important role that ordering abilities play in mathematical reasoning, extending findings regarding the role of ordering abilities in basic maths skills. These results have implications for the theories of mathematical and deductive reasoning, and they could inspire the development of novel educational interventions. (shrink)

A survey of Euclid's Elements, this text provides an understanding of the classical Greek conception of mathematics and its similarities to modern views as well as its differences. It focuses on philosophical, foundational, and logical questions — rather than strictly historical and mathematical issues — and features several helpful appendixes.

George Boole published the pamphlet The Mathematical Analysis of Logic in 1847. He believed that logic should belong to a universal mathematics that would cover both quantitative and nonquantitative research. With his pamphlet, Boole signalled an important change in symbolic logic: in contrast with his predecessors, his thinking was exclusively extensional. Notwithstanding the innovations introduced he accepted all traditional Aristotelean syllogisms. Nevertheless, some criticisms have been raised concerning Boole’s view of Aristotelean logic as the solution of algebraic equations. In (...) order to circumvent such criticisms, we show here how Boole’s conclusions may be deduced from the axioms and inference rules proposed in his pamphlet, from which Aristotle’s deductions in Prior Analytics (including those that are completed through an impossibility) can be stated as theorems. We clarify his method for dealing with both universal and particular premises by means of his symbol v and demystify some criticisms concerning the way he expressed particular premises. Boole’s conclusions for some of those premises for which according to Aristotle there is no deduction are also discussed. The deductive system presented here has the potential to provide a new perspective on Boole’s approach to logic in The Mathematical Analysis of Logic. (shrink)

Leaving aside here the question of the author of the Essai de logique, I show that, if Mariotte insisted on the specificity of physics, he also sought a certain inspiration in mathematics as to the way in which to lay out the propositions in a proof. To do so, I start off from the ontological distinction made in the Essai among three types of possibles; next we will show that the three types of propositions correspond to three types of (...) knowledge, and, correlatively, that the main problem of physics is that it is impossible to establish in a certain fashion universal sensory propositions; I next characterize the notion of principles of experience; finally, I examine a bit systematically the relationship between mathematics and physics. (shrink)

Call an explanation in which a non-mathematical fact is explained—in part or in whole—by mathematical facts: an extra-mathematical explanation. Such explanations have attracted a great deal of interest recently in arguments over mathematical realism. In this article, a theory of extra-mathematical explanation is developed. The theory is modelled on a deductive-nomological theory of scientific explanation. A basic DN account of extra-mathematical explanation is proposed and then redeveloped in the light of two difficulties that the basic theory faces. The final (...) view appeals to relevance logic and uses resources in information theory to understand the explanatory relationship between mathematical and physical facts. 1Introduction2Anchoring3The Basic Deductive-Mathematical Account4The Genuineness Problem5Irrelevance6Relevance and Information7Objections and Replies 7.1Against relevance logic7.2Too epistemic7.3Informational containment8Conclusion. (shrink)

This paper has two specific goals. The first is to demonstrate that the theorem in MetaphysicsΘ 9, 1051a24-27 is not equiva-lent to Euclid’s Proposition 32 of book I (which contradicts some Aristotelian commentators, such as W. D. Ross, J. L. Heiberg, and T. L. Heith). Agreeing with Henry Mendell’s analysis, I ar-gue that the two theorems are not equivalent, but I offer different reasons for such divergence: I propose a pedagogical-philosoph-ical reason for the Aristotelian theorem being shorter than the Euclidean (...) one (and the previous Aristotelian versions). Aristotle wants to emphasize the deductive procedure as a satisfactory method to discover scientific knowledge. The second objective, opposing some consensus about geometrical deductions/theo-rems in Aristotle, is to briefly propose that the theorem, exactly as we found it in Metaphysics and without any emendation to the text (therefore opposing Henry Mendell’s suggested amend-ments), allows the ancient philosopher to demonstrate that universal mathematical knowledge is in potence in geometrical figures. This tentatively proves that Aristotle emphasizes that geometrical deduction is sufficient to actualize mathematical knowledge. (shrink)

The link between logic and mathematics has long been recognized by theorists from various fields. For instance, the mathematician, Bertrand Russell (1919), described logic and math as intrinsically...

The ampliativity of deduction has been defended in several ways—such as the semi-decidability of the theories, the surprise of unexpected consequences, the need of new individuals in deduction, or ampliative inference as deduction with suppressed premises (Dummett, Frege. Philosophy of mathematics. Duckworth, London, 1991; Hintikka, Logic, language-games and information. Oxford University Press, Oxford, 1973; Musgrave, Imre Lakatos and theories of scientific change. Kluwer, Boston, 1989; Rota, Indiscrete thoughts. Birkhäuser, Boston, 1997). These lines of defensive arguments fail if we characterize (...) ampliativity in a strong way, that is, in terms of ‘novelty’ stricto sensu, as an inferential process producing genuinely new pieces of information in the conclusion of a reasoning (Cellucci, Rethinking logic. Springer, Dordrecht, 2013; Ippoliti, Heuristic reasoning. Springer, Basel, 2015). Nevertheless, it is possible to defend a weaker stance of the ampliativity of deduction and its usefulness. This requires interpreting novelty more loosely, that is, as the inferential production of new relations among known entities. This stance maintains that, in this sense, deduction can provide us with new knowledge. Thus, a typical deductive activity, as re-proving theorems, can be thought as heuristic and ampliative because it establishes new relations between known elements (e.g. between given axioms or properties and the statement of the theorem). I argue that also this line of defence is defective for it does not account for the necessity and usefulness of reproving theorems. In particular, a foundationalist, axiomatic-deductive viewpoint does not fully account for the usefulness and the weak ampliative power of deduction. (shrink)

The aim of this article is to present and discuss the language of the «givens», a typical stylistic resource of Greek mathematics and one of the major features of the proof format of analysis and synthesis. I shall analyze its expressive function and its peculiarities, as well as its general role as a deductive tool, explaining at the same time its particular applications in subgenres of a geometrical proposition like the locus theorems and the so-called «porisms». The main (...) interpretative theses of this study are the following: the language of the «givens» (1) is the standard idiom in which “existence and uniqueness” of a mathematical object was proved, (2) was conceived as an unified framework reducing to a strictly deductive format disparate argumentative steps such as deductions, constructions, and calculations. (shrink)

Cette étude montre comment le météorologue Edward Lorenz, dans deux articles de 1963 et 1964, explore les propriétés des systèmes chaotiques par des allers-retours entre une déduction mathématique (basée sur la théorie des systèmes dynamiques) et une étude des solutions numériques du système dit « de Lorenz » dans un régime d’instabilité. This study aims at showing how the metereologist Edward Lorenz, in two papers of 1963 and 1964, explores the properties of chaotic systems thanks to the interplay between a (...) mathematical deduction (based on dynamical systems theory) and a study of the mathematical solutions of the Lorenz system in an instability regime. (shrink)

If we want to understand why mathematical knowledge is extraordinarily reliable, we need to consider both the nature of mathematical arguments and mathematical practice as a social practice. Mathematical knowledge is extraordinarily reliable because arguments in mathematics take the form of deductive mathematical proofs. Deductive mathematical proofs are surveyable in the sense that they can be checked step by step by different experts, and a purported proof is only accepted as a proof by the mathematical community once (...) a number of experts have checked the proof. Hence, the reliability of the body of mathematical knowledge is in part obtained through the surveyability of proofs and the social process of proof validation. This chapter reviews work relating to (1) the norm in the mathematical community of only counting as argument deductive mathematical proof, and (2) the norm of only counting as deductive mathematical proof an argument that has been confirmed to be a deductive mathematical proof by a number of experts. The chapter also presents cases of unusual mathematical proofs or arguments that challenge these norms. (shrink)

This volume examines the notion of an analytic proof as a natural deduction, suggesting that the proof's value may be understood as its normal form--a concept with significant implications to proof-theoretic semantics.

The aim of the paper is to present two natural deduction systems for Intuitionistic Sentential Calculus with Identity ( ISCI ); a syntactically motivated \(\mathsf {ND}^1_{\mathsf {ISCI}}\) and a semantically motivated \(\mathsf {ND}^2_{\mathsf {ISCI}}\). The formulation of \(\mathsf {ND}^1_{\mathsf {ISCI}}\) is based on the axiomatic formulation of ISCI. Its rules cannot be straightforwardly classified as introduction or elimination rules; ISCI -specific rules are based on axioms characterizing the identity connective. The system does not enjoy the standard subformula property, but due (...) to the normalization procedure non-subformulas can label only leaves of proofs. In \(\mathsf {ND}^2_{\mathsf {ISCI}}\), we propose only two general identity-related rules, in reference to the treatment of the identity connective in First-Order Logic. (shrink)

Mathematical Logic: An Introduction is a textbook that uses mathematical tools to investigate mathematics itself. In particular, the concepts of proof and truth are examined. The book presents the fundamental topics in mathematical logic and presents clear and complete proofs throughout the text. Such proofs are used to develop the language of propositional logic and the language of first-order logic, including the notion of a formal deduction. The text also covers Tarski’s definition of truth and the computability concept. It (...) also provides coherent proofs of Godel’s completeness and incompleteness theorems. Moreover, the text was written with the student in mind and thus, it provides an accessible introduction to mathematical logic. In particular, the text explicitly shows the reader how to prove the basic theorems and presents detailed proofs throughout the book. Most undergraduate books on mathematical logic are written for a reader who is well-versed in logical notation and mathematical proof. This textbook is written to attract a wider audience, including students who are not yet experts in the art of mathematical proof. (shrink)

Our goal is to develop a syntactical apparatus for propositional logics in which the accepted and rejected propositions have the same status and obeying treated in the same way. The suggested approach is based on the ideas of Łukasiewicz used for the classical logic and in addition, it includes the use of multiple conclusion rules. More precisely, a consequence relation is defined on a set of statements of forms “proposition _A_ is accepted” and “proposition _A_ is rejected”, where _A_ is (...) a proposition,—a unified consequence relation. Accordingly, the rules defining a unified consequence relation,—the unified rules, have statements as premises and as conclusions. A special attention is paid to the logics in which each proposition is either accepted or rejected. If we express this property via unified rules and add them to a unified deductive system, such a unified deductive system defines a reversible unified consequence: a statement “proposition _B_ is accepted” is derived from the statement “proposition _A_ is accepted” if and only if a statement “proposition _A_ is rejected” is derived from the statement “proposition _B_ is rejected”. (shrink)

The promised mathematical system—the Constructibility Theory—is presented as an axiomatized deductive theory formalized in a many‐sorted first‐order logical language. The axioms of the theory are specified and a justification for each of the axioms is given. Objections to the theory are considered.

Mathematical proofs are not sequences of arbitrary deductive steps—each deductive step is, to some extent, rational. This paper aims to identify and characterize the particular form of rationality at play in mathematical proofs. The approach adopted consists in viewing mathematical proofs as reports of proof activities—that is, sequences of deductive inferences—and in characterizing the rationality of the former in terms of that of the latter. It is argued that proof activities are governed by specific norms of rational (...) planning agency, and that a deductive step in a mathematical proof qualifies as rational whenever the corresponding deductive inference in the associated proof activity figures in a plan that has been constructed rationally. It is then shown that mathematical proofs whose associated proof activities violate these norms are likely to be judged as defective by mathematical agents, thereby providing evidence that these norms are indeed present in mathematical practice. We conclude that, if mathematical proofs are not mere sequences of deductive steps, if they possess a rational structure, it is because they are the product of rational planning agents. (shrink)

2014 Reprint of 1954 American Edition. Full facsimile of the original edition, not reproduced with Optical Recognition Software. This two volume classic comprises two titles: "Patterns of Plausible Inference" and "Induction and Analogy in Mathematics." This is a guide to the practical art of plausible reasoning, particularly in mathematics, but also in every field of human activity. Using mathematics as the example par excellence, Polya shows how even the most rigorous deductive discipline is heavily dependent on (...) techniques of guessing, inductive reasoning, and reasoning by analogy. In solving a problem, the answer must be guessed at before a proof can be given, and guesses are usually made from a knowledge of facts, experience, and hunches. The truly creative mathematician must be a good guesser first and a good prover afterward; many important theorems have been guessed but no proved until much later. In the same way, solutions to problems can be guessed, and a god guesser is much more likely to find a correct solution. This work might have been called "How to Become a Good Guesser."-From the Dust Jacket. (shrink)

The paper discusses the origin of dark matter and dark energy from the concepts of time and the totality in the final analysis. Though both seem to be rather philosophical, nonetheless they are postulated axiomatically and interpreted physically, and the corresponding philosophical transcendentalism serves heuristically. The exposition of the article means to outline the “forest for the trees”, however, in an absolutely rigorous mathematical way, which to be explicated in detail in a future paper. The “two deductions” are two successive (...) stage of a single conclusion mentioned above. The concept of “transcendental invariance” meaning ontologically and physically interpreting the mathematical equivalence of the axiom of choice and the well-ordering “theorem” is utilized again. Then, time arrow is a corollary from that transcendental invariance, and in turn, it implies quantum information conservation as the Noether correlate of the linear “increase of time” after time arrow. Quantum information conservation implies a few fundamental corollaries such as the “conservation of energy conservation” in quantum mechanics from reasons quite different from those in classical mechanics and physics as well as the “absence of hidden variables” (versus Einstein’s conjecture) in it. However, the paper is concentrated only into the inference of another corollary from quantum information conservation, namely, dark matter and dark energy being due to entanglement, and thus and in the final analysis, to the conservation of quantum information, however observed experimentally only on the “cognitive screen” of “Mach’s principle” in Einstein’s general relativity. therefore excluding any other source of gravitational field than mass and gravity. Then, if quantum information by itself would generate a certain nonzero gravitational field, it will be depicted on the same screen as certain masses and energies distributed in space-time, and most presumably, observable as those dark energy and dark matter predominating in the universe as about 96% of its energy and matter quite unexpectedly for physics and the scientific worldview nowadays. Besides on the cognitive screen of general relativity, entanglement is available necessarily on still one “cognitive screen” (namely, that of quantum mechanics), being furthermore “flat”. Most probably, that projection is confinement, a mysterious and ad hoc added interaction along with the fundamental tree ones of the Standard model being even inconsistent to them conceptually, as far as it need differ the local space from the global space being definable only as a relation between them (similar to entanglement). So, entanglement is able to link the gravity of general relativity to the confinement of the Standard model as its projections of the “cognitive screens” of those two fundamental physical theories. (shrink)

This very interesting and extremely useful study raises the question, by virtue of its title and what it does not do, of what is, or ought to be, meant by the philosophy of mathematics. The author begins his study of Euclid with a brief discussion of Hilbert's axiomatization of geometry. The two main points in this discussion are: "Hilbertian geometry and many other parts of modern mathematics are the study of structure", i.e., of the interpretations of axiom-systems; and (...) intuition of geometrical form becomes irrelevant to the content of mathematics. Greek mathematics, and specifically Euclid, cannot be understood in these terms; hence, Euclid's use of the axiomatic method differs from ours. One may also say that logic, "the theory of structure-preserving inference", becomes central to modern mathematics, as it was not for Euclid. But, the author continues, it does not follow that one cannot exhibit the logical structure employed by Euclid. The bulk of Mueller's book is concerned to do just this, thanks to a formalization of Euclid which attempts to be faithful to his principal concepts, while at the same time employing contemporary logical techniques. (shrink)

"This book is interesting and well-written. The research methods were explained clearly and conclusions were summarized nicely. It is a relatively quick read at only 130 pages. Anyone who has been told, or who has told others, that mathematicians make better thinkers should read this book." MAA Reviews "The authors particularly attend to protecting positive correlations against the self-selection interpretation, merely that logical minds elect studying more mathematics. Here, one finds a stimulating survey of the systemic difficulties people have (...) with basic syllogisms and deductions." CHOICE connect "The authors particularly attend to protecting positive correlations against the self-selection interpretation, merely that logical minds elect studying more mathematics. Here, one finds a stimulating survey of the systemic difficulties people have with basic syllogisms and deductions." CHOICE Connect For centuries, educational policymakers have believed that studying mathematics is important, in part because it develops general thinking skills that are useful throughout life. This 'Theory of Formal Discipline' (TFD) has been used as a justification for mathematics education globally. Despite this, few empirical studies have directly investigated the issue, and those which have showed mixed results. Does Mathematical Study Develop Logical Thinking? describes a rigorous investigation of the TFD. It reviews the theory's history and prior research on the topic, followed by reports on a series of recent empirical studies. It argues that, contrary to the position held by sceptics, advanced mathematical study does develop certain general thinking skills, however these are much more restricted than those typically claimed by TFD proponents. Perfect for students, researchers and policymakers in education, further education and mathematics, this book provides much needed insight into the theory and practice of the foundations of modern educational policy. (shrink)

Published in 1903, this book was the first comprehensive treatise on the logical foundations of mathematics written in English. It sets forth, as far as possible without mathematical and logical symbolism, the grounds in favour of the view that mathematics and logic are identical. It proposes simply that what is commonly called mathematics are merely later deductions from logical premises. It provided the thesis for which _Principia Mathematica_ provided the detailed proof, and introduced the work of Frege (...) to a wider audience. In addition to the new introduction by John Slater, this edition contains Russell's introduction to the 1937 edition in which he defends his position against his formalist and intuitionist critics. (shrink)

The role of mathematics in scientific practice is too readily relegated to that of formulating equations that model or describe what is being investigated, and then finding solutions to those equations. I survey the role of mathematics in: 1. Exact solutions of differential equations, especially conformal mapping; and 2. Simulations of solutions to differential equations via numerical methods and via agent-based models; and 3. The use of experimental models to solve equations (a) via physical analogies based on similarity (...) of the form of the equations, such as Prandtl’s soap-film method, and (b) the method of physically similar systems. Two major themes emerge: First, the role of mathematics in science is not well described by deduction from axioms, although it generally involves deductive reasoning. Creative leaps, the integration of experimental or observational evidence, synthesis of ideas from different areas of mathematics, and insight regarding analogous forms are required to find solutions to equations. Second, methods that involve mappings or transformations are in use in disparate contexts, from the purely mathematical context of conformal mapping where it is mathematical objects that are mapped, to the use of concrete physical experimental models, where one concrete thing is shown to correspond to another. (shrink)

The deviation of mathematical proof—proof in mathematical practice—from the ideal of formal proof—proof in formal logic—has led many philosophers of mathematics to reconsider the commonly accepted view according to which the notion of formal proof provides an accurate descriptive account of mathematical proof. This, in turn, has motivated a search for alternative accounts of mathematical proof purporting to be more faithful to the reality of mathematical practice. Yet, in order to develop and evaluate such alternative accounts, it appears as (...) a necessary prerequisite to first possess a clear picture of what the deviation of mathematical proof from formal proof consists in. The present work aims to contribute building such a picture by investigating the relation between the elementary steps of deduction constituting the two types of proofs—mathematical inference and logical inference. Many claims have been made in the literature regarding the relation between mathematical inference and logical inference, most of them stating that the former is lacking properties that are constitutive of the latter. Such differentiating claims are, however, usually put forward without a clear conception of the properties occurring in them, and are generally considered to be immediately justified by our direct acquaintance, or phenomenological experience, with the two types of inferences. The present study purports to advance our understanding of the relation between mathematical inference and logical inference by developing a detailed philosophical analysis of the differentiating claims, that is, an analysis of the meaning of the differentiating claims—through the properties that occur in them—as well as the reasons that support them. To this end, we provide at the outset a representative list of the different properties of logical inference that have occurred in the differentiating claims, and we notice that they all boil down to the three properties of formality, generality, and mechanicality. For each one of these properties, our analysis proceeds in two steps: we first provide precise conceptual characterizations of the different ways logical inference has been said to be formal, general, and mechanical, in the philosophical and logical literature on formal proof; we then examine why mathematical inference does not appear to be formal, general, and mechanical, for the different variations of these notions identified. Our study results in a precise conceptual apparatus for expressing and discussing the properties differentiating mathematical inference from logical inference, and provides a first inventory of the various reasons supporting the observations of those differences. The differentiating claims constitute thus a set of data that any philosophical account of mathematical inference and proof purporting to be more faithful to mathematical practice ought to be able to accommodate and explain. (shrink)

We present a sound and complete Fitch-style natural deduction system for an S5 modal logic containing an actuality operator, a diagonal necessity operator, and a diagonal possibility operator. The logic is two-dimensional, where we evaluate sentences with respect to both an actual world (first dimension) and a world of evaluation (second dimension). The diagonal necessity operator behaves as a quantifier over every point on the diagonal between actual worlds and worlds of evaluation, while the diagonal possibility quantifies over some point (...) on the diagonal. Thus, they are just like the epistemic operators for apriority and its dual. We take this extension of Fitch’s familiar derivation system to be a very natural one, since the new rules and labeled lines hereby introduced preserve the structure of Fitch’s own rules for the modal case. (shrink)

Attempts to articulate the real meaning or ultimate significance of a famous theorem comprise a major vein of philosophical writing about mathematics. The subfield of mathematical logic has supplie...

This paper presents a natural deduction system for orthomodular quantum logic. The system is shown to be provably equivalent to Nishimura’s quantum sequent calculus. Through the Curry–Howard isomorphism, quantum $$\lambda $$ -calculus is also introduced for which strong normalization property is established.

This mathematics textbook covers the fundamental ideas used in writing proofs. Proof techniques covered include direct proofs, proofs by contrapositive, proofs by contradiction, proofs in set theory, proofs of existentially or universally quantified predicates, proofs by cases, and mathematical induction. Inductive and deductive reasoning are explored. A straightforward approach is taken throughout. Plenty of examples are included and lots of exercises are provided after each brief exposition on the topics at hand. The text begins with a study of (...) symbolic logic, deductive reasoning, and quantifiers. Inductive reasoning and making conjectures are examined next, and once there are some statements to prove, techniques for proving conditional statements, disjunctions, biconditional statements, and quantified predicates are investigated. Terminology and proof techniques in set theory follow with discussions of the pick-a-point method and the algebra of sets. Cartesian products, equivalence relations, orders, and functions are all incorporated. Particular attention is given to injectivity, surjectivity, and cardinality. The text includes an introduction to topology and abstract algebra, with a comparison of topological properties to algebraic properties. This book can be used by itself for an introduction to proofs course or as a supplemental text for students in proof-based mathematics classes. The contents have been rigorously reviewed and tested by instructors and students in classroom settings. (shrink)