Epistemological Obstacles in the Evolution of the Concept of Proof in the Path of Ancient Greek Tradition Miglena Asenova
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
$Ectton of Tbe Ibttorv of Fiebicilne President-Sir STCLAIR THOMSON, M.D
$ectton of tbe Ibttorv of fIebicilne President-Sir STCLAIR THOMSON, M.D. [Februar?y 7, 1934] William Harvey's Knowledge of Literature-Classical, Mediaval, Renaissance and Contemporary By D. F. FRASER-HARRIS, M.D., D.Sc., F.R.S.E. UNLESS we happen to have considered the subject, we can have no adequate notion of the extent of Harvey's acquaintance with Classical, Renaissance and Contemporary Literature. We are, perhaps, too apt to think of William Harvey as the author of that libellus aureus, the De Motu, and forget that he also wrote the De Generatione, on " Parturition," on the" Uterine Membranes and Humours," and on " Conception," throughout all of which he displayed the most intimate knowledge of the works of many authors who had views on topics of biological interest germane to the matters under discussion,L nor should we forget the lost writings of Harvey *on Medicine, Pathology, Respiration and Insects. Besides the works just mentioned, Harvey composed two "Disquisitions " to -Riolanus, full of references to Galen, and nine letters to contemporaries which have come down to us-one to Caspar Hofmann, of Nuremberg; one to Paul M. Slegel, of Hamburg; three to John Nardi, of Florence; one to R. Morison, of Paris; one to -J. D. Horst, of Hesse-Darmstadt and one to John Vlackveld, of Haarlem. It is in -the letter to Morison that Harvey has so much to say of Pecquet of Dieppe, the discoverer of the Receptaculum Chyli. There seems no room for doubt that Harvey could read in the original the Greek -and Latin authors to whom he refers. -
Meditations the Philosophy Classic
MEDITATIONS THE PHILOSOPHY CLASSIC MEDITATIONS THE PHILOSOPHY CLASSIC THE INTERNATIONAL BESTSELLER MARCUS AURELIUS WITH AN INTRODUCTION BY DONALD ROBERTSON MEDITATIONS Also available in the same series: Beyond Good and Evil: The Philosophy Classic by Friedrich Nietzsche (ISBN: 978-0-857-08848-2) On the Origin of Species: The Science Classic by Charles Darwin (ISBN: 978-0-857-08847-5) Tao Te Ching: The Ancient Classic by Lao Tzu (ISBN: 978-0-857-08311-1) The Art of War: The Ancient Classic by Sun Tzu (ISBN: 978-0-857-08009-7) The Game of Life and How to Play It: The Self-Help Classic by Florence Scovel Shinn (ISBN: 978-0-857-08840-6) The Interpretation of Dreams: The Psychology Classic by Sigmund Freud (ISBN: 978-0-857-08844-4) The Prince: The Original Classic by Niccolo Machiavelli (ISBN: 978-0-857-08078-3) The Prophet: The Spirituality Classic by Kahlil Gibran (ISBN: 978-0-857-08855-0) The Republic: The Influential Classic by Plato (ISBN: 978-0-857-08313-5) The Science of Getting Rich: The Original Classic by Wallace Wattles (ISBN: 978-0-857-08008-0) The Wealth of Nations: The Economics Classic by Adam Smith (ISBN: 978-0-857-08077-6) Think and Grow Rich: The Original Classic by Napoleon Hill (ISBN: 978-1-906-46559-9) MEDITATIONS The Philosophy Classic MARCUS AURELIUS With an Introduction by DONALD ROBERTSON This edition first published 2020 Introduction copyright © Donald Robertson, 2020 The material for Meditations is based on The Thoughts of the Emperor M. Aurelius Antoninus, translated by George Long, published by Bell & Daldy, London 1862, and is now in the public domain. -
UNDERSTANDING MATHEMATICS to UNDERSTAND PLATO -THEAETEUS (147D-148B Salomon Ofman
UNDERSTANDING MATHEMATICS TO UNDERSTAND PLATO -THEAETEUS (147d-148b Salomon Ofman To cite this version: Salomon Ofman. UNDERSTANDING MATHEMATICS TO UNDERSTAND PLATO -THEAETEUS (147d-148b. Lato Sensu, revue de la Société de philosophie des sciences, Société de philosophie des sciences, 2014, 1 (1). hal-01305361 HAL Id: hal-01305361 https://hal.archives-ouvertes.fr/hal-01305361 Submitted on 20 Apr 2016 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. UNDERSTANDING MATHEMATICS TO UNDERSTAND PLATO - THEAETEUS (147d-148b) COMPRENDRE LES MATHÉMATIQUES POUR COMPRENDRE PLATON - THÉÉTÈTE (147d-148b) Salomon OFMAN Institut mathématique de Jussieu-PRG Histoire des Sciences mathématiques 4 Place Jussieu 75005 Paris [email protected] Abstract. This paper is an updated translation of an article published in French in the Journal Lato Sensu (I, 2014, p. 70-80). We study here the so- called ‘Mathematical part’ of Plato’s Theaetetus. Its subject concerns the incommensurability of certain magnitudes, in modern terms the question of the rationality or irrationality of the square roots of integers. As the most ancient text on the subject, and on Greek mathematics and mathematicians as well, its historical importance is enormous. -
Two Sources of Explosion
Two sources of explosion Eric Kao Computer Science Department Stanford University Stanford, CA 94305 United States of America Abstract. In pursuit of enhancing the deductive power of Direct Logic while avoiding explosiveness, Hewitt has proposed including the law of excluded middle and proof by self-refutation. In this paper, I show that the inclusion of either one of these inference patterns causes paracon- sistent logics such as Hewitt's Direct Logic and Besnard and Hunter's quasi-classical logic to become explosive. 1 Introduction A central goal of a paraconsistent logic is to avoid explosiveness { the inference of any arbitrary sentence β from an inconsistent premise set fp; :pg (ex falso quodlibet). Hewitt [2] Direct Logic and Besnard and Hunter's quasi-classical logic (QC) [1, 5, 4] both seek to preserve the deductive power of classical logic \as much as pos- sible" while still avoiding explosiveness. Their work fits into the ongoing research program of identifying some \reasonable" and \maximal" subsets of classically valid rules and axioms that do not lead to explosiveness. To this end, it is natural to consider which classically sound deductive rules and axioms one can introduce into a paraconsistent logic without causing explo- siveness. Hewitt [3] proposed including the law of excluded middle and the proof by self-refutation rule (a very special case of proof by contradiction) but did not show whether the resulting logic would be explosive. In this paper, I show that for quasi-classical logic and its variant, the addition of either the law of excluded middle or the proof by self-refutation rule in fact leads to explosiveness. -
Francis Bacon and the Transformation of Early-Modern Philosophy
Francis Bacon and the Transformation of Early-Modern Philosophy STEPHEN GAUKROGER University of Sydney PUBLISHED BY THE PRESS SYNDICATE OF THE UNIVERSITY OF CAMBRIDGE The Pitt Building, Trumpington Street, Cambridge, United Kingdom CAMBRIDGE UNIVERSITY PRESS The Edinburgh Building, Cambridge cb2 2ru, UK 40 West 20th Street, New York, ny 10011-4211, USA 10 Stamford Road, Oakleigh, vic 3166, Australia Ruiz de Alarcón 13, 28014 Madrid, Spain Dock House, The Waterfront, Cape Town 8001, South Africa http://www.cup.org © Cambridge University Press 2001 This book is in copyright. Subject to statutory exception and to the provisions of relevant collective licensing agreements, no reproduction of any part may take place without the written permission of Cambridge University Press. First published 2001 Printed in the United States of America Typeface New Baskerville 10.25/13 pt. System QuarkXPress® [mg] A catalog record for this book is available from the British Library Library of Congress Cataloging in Publication Data Gaukroger, Stephen. Francis Bacon and the transformation of early-modern philosophy / Stephen Gaukroger. p. cm. Includes bibliographical references and index. isbn 0 521 80154 0 – isbn 0 521 80536 8 (pbk.) 1. Bacon, Francis, 1561–1626. 2. Philosophy, Modern – History. I. Title. b1198 .g38 2001 192 – dc21 00–063097 isbn 0 521 80154 0 hardback isbn 0 521 80536 8 paperback Contents Acknowledgments page ix References to Bacon’s works xi Prologue 1 1 The nature of Bacon’s project 6 From arcane learning to public knowledge 6 A via media -
Logic, Sets, and Proofs David A
Logic, Sets, and Proofs David A. Cox and Catherine C. McGeoch Amherst College 1 Logic Logical Statements. A logical statement is a mathematical statement that is either true or false. Here we denote logical statements with capital letters A; B. Logical statements be combined to form new logical statements as follows: Name Notation Conjunction A and B Disjunction A or B Negation not A :A Implication A implies B if A, then B A ) B Equivalence A if and only if B A , B Here are some examples of conjunction, disjunction and negation: x > 1 and x < 3: This is true when x is in the open interval (1; 3). x > 1 or x < 3: This is true for all real numbers x. :(x > 1): This is the same as x ≤ 1. Here are two logical statements that are true: x > 4 ) x > 2. x2 = 1 , (x = 1 or x = −1). Note that \x = 1 or x = −1" is usually written x = ±1. Converses, Contrapositives, and Tautologies. We begin with converses and contrapositives: • The converse of \A implies B" is \B implies A". • The contrapositive of \A implies B" is \:B implies :A" Thus the statement \x > 4 ) x > 2" has: • Converse: x > 2 ) x > 4. • Contrapositive: x ≤ 2 ) x ≤ 4. 1 Some logical statements are guaranteed to always be true. These are tautologies. Here are two tautologies that involve converses and contrapositives: • (A if and only if B) , ((A implies B) and (B implies A)). In other words, A and B are equivalent exactly when both A ) B and its converse are true. -
On the Analysis of Indirect Proofs: Contradiction and Contraposition
On the analysis of indirect proofs: Contradiction and contraposition Nicolas Jourdan & Oleksiy Yevdokimov University of Southern Queensland [email protected] [email protected] roof by contradiction is a very powerful mathematical technique. Indeed, Premarkable results such as the fundamental theorem of arithmetic can be proved by contradiction (e.g., Grossman, 2009, p. 248). This method of proof is also one of the oldest types of proof early Greek mathematicians developed. More than two millennia ago two of the most famous results in mathematics: The irrationality of 2 (Heath, 1921, p. 155), and the infinitude of prime numbers (Euclid, Elements IX, 20) were obtained through reasoning by contradiction. This method of proof was so well established in Greek mathematics that many of Euclid’s theorems and most of Archimedes’ important results were proved by contradiction. In the 17th century, proofs by contradiction became the focus of attention of philosophers and mathematicians, and the status and dignity of this method of proof came into question (Mancosu, 1991, p. 15). The debate centred around the traditional Aristotelian position that only causality could be the base of true scientific knowledge. In particular, according to this traditional position, a mathematical proof must proceed from the cause to the effect. Starting from false assumptions a proof by contradiction could not reveal the cause. As Mancosu (1996, p. 26) writes: “There was thus a consensus on the part of these scholars that proofs by contradiction were inferior to direct Australian Senior Mathematics Journal vol. 30 no. 1 proofs on account of their lack of causality.” More recently, in the 20th century, the intuitionists went further and came to regard proof by contradiction as an invalid method of reasoning. -
Logic and Proof Release 3.18.4
Logic and Proof Release 3.18.4 Jeremy Avigad, Robert Y. Lewis, and Floris van Doorn Sep 10, 2021 CONTENTS 1 Introduction 1 1.1 Mathematical Proof ............................................ 1 1.2 Symbolic Logic .............................................. 2 1.3 Interactive Theorem Proving ....................................... 4 1.4 The Semantic Point of View ....................................... 5 1.5 Goals Summarized ............................................ 6 1.6 About this Textbook ........................................... 6 2 Propositional Logic 7 2.1 A Puzzle ................................................. 7 2.2 A Solution ................................................ 7 2.3 Rules of Inference ............................................ 8 2.4 The Language of Propositional Logic ................................... 15 2.5 Exercises ................................................. 16 3 Natural Deduction for Propositional Logic 17 3.1 Derivations in Natural Deduction ..................................... 17 3.2 Examples ................................................. 19 3.3 Forward and Backward Reasoning .................................... 20 3.4 Reasoning by Cases ............................................ 22 3.5 Some Logical Identities .......................................... 23 3.6 Exercises ................................................. 24 4 Propositional Logic in Lean 25 4.1 Expressions for Propositions and Proofs ................................. 25 4.2 More commands ............................................ -
Fourier's Proof of the Irrationality of E
Ursinus College Digital Commons @ Ursinus College Transforming Instruction in Undergraduate Calculus Mathematics via Primary Historical Sources (TRIUMPHS) Summer 2020 Fourier's Proof of the Irrationality of e Kenneth M. Monks Follow this and additional works at: https://digitalcommons.ursinus.edu/triumphs_calculus Click here to let us know how access to this document benefits ou.y Fourier's Proof of the Irrationality of e Kenneth M Monks ∗ August 6, 2020 We begin with a short passage from Aristotle's1 Prior Analytics2. This translation was completed by Oxford scholars in 1931 and compiled by Richard McKeon into The Basic Works of Aristotle [McKeon, 1941]. 1111111111111111111111111111111111111111 xI.23. For all who effect an argument per impossibile infer syllogistically what is false, and prove the original conclusion hypothetically when something impossible results from the as- sumption of its contradictory; e.g. that the diagonal of a square is incommensurate with the side, because odd numbers are equal to evens if it is supposed to be commensurate. 1111111111111111111111111111111111111111 The goal of this project is to work through a proof of the irrationality of the number e due to Joseph Fourier. This number would not have even been defined in any publication for another two millennia3 (plus a few years) after the writing of Prior Analytics! So, the reader may wonder why we are rewinding our clocks so far back. Well, it turns out that the key ideas required to understand Fourier's proof of the irrationality of e can be traced right back to that passage from Aristotle. In Section 1, we extract the key pattern of Aristotelian logic needed to understand Fourier's proof, and give it a bit more of a modern formulation. -
Beginning Logic MATH 10130 Spring 2019 University of Notre Dame Contents
Beginning Logic MATH 10130 Spring 2019 University of Notre Dame Contents 0.1 What is logic? What will we do in this course? . .1 I Propositional Logic 5 1 Beginning propositional logic 6 1.1 Symbols . .6 1.2 Well-formed formulas . .7 1.3 Basic translation . .8 1.4 Implications . 11 1.5 Nuances with negations . 12 2 Proofs 13 2.1 Introduction to proofs . 13 2.2 The first rules of inference . 14 2.3 Rule for implications . 20 2.4 Rules for conjunctions . 24 2.5 Rules for disjunctions . 28 2.6 Proof by contradiction . 32 2.7 Bi-conditional statements . 35 2.8 More examples of proofs . 36 2.9 Some useful proofs . 39 3 Truth 48 3.1 Definition of Truth . 48 3.2 Truth tables . 49 3.3 Analysis of arguments using truth tables . 53 4 Soundness and Completeness 56 4.1 Two notions of validity . 56 4.2 Examples: proofs vs. truth tables . 57 4.3 More examples . 63 4.4 Verifying Soundness . 70 4.5 Explanation of Completeness . 72 i II Predicate Logic 74 5 Beginning predicate logic 75 5.1 Shortcomings of propositional logic . 75 5.2 Symbols of predicate logic . 76 5.3 Definition of well-formed formula . 77 5.4 Translation . 82 5.5 Learning the idioms for predicate logic . 84 5.6 Free variables and sentences . 86 6 Proofs 91 6.1 Basic proofs . 91 6.2 Rules for universal quantifiers . 93 6.3 Rules for existential quantifiers . 98 6.4 Rules for equality . 102 7 Structures and Truth 106 7.1 Languages and structures . -
Common Sense for Concurrency and Strong Paraconsistency Using Unstratified Inference and Reflection
Published in ArXiv http://arxiv.org/abs/0812.4852 http://commonsense.carlhewitt.info Common sense for concurrency and strong paraconsistency using unstratified inference and reflection Carl Hewitt http://carlhewitt.info This paper is dedicated to John McCarthy. Abstract Unstratified Reflection is the Norm....................................... 11 Abstraction and Reification .............................................. 11 This paper develops a strongly paraconsistent formalism (called Direct Logic™) that incorporates the mathematics of Diagonal Argument .......................................................... 12 Computer Science and allows unstratified inference and Logical Fixed Point Theorem ........................................... 12 reflection using mathematical induction for almost all of Disadvantages of stratified metatheories ........................... 12 classical logic to be used. Direct Logic allows mutual Reification Reflection ....................................................... 13 reflection among the mutually chock full of inconsistencies Incompleteness Theorem for Theories of Direct Logic ..... 14 code, documentation, and use cases of large software systems Inconsistency Theorem for Theories of Direct Logic ........ 15 thereby overcoming the limitations of the traditional Tarskian Consequences of Logically Necessary Inconsistency ........ 16 framework of stratified metatheories. Concurrency is the Norm ...................................................... 16 Gödel first formalized and proved that it is not possible -
Proofs and Mathematical Reasoning
Proofs and Mathematical Reasoning University of Birmingham Author: Supervisors: Agata Stefanowicz Joe Kyle Michael Grove September 2014 c University of Birmingham 2014 Contents 1 Introduction 6 2 Mathematical language and symbols 6 2.1 Mathematics is a language . .6 2.2 Greek alphabet . .6 2.3 Symbols . .6 2.4 Words in mathematics . .7 3 What is a proof? 9 3.1 Writer versus reader . .9 3.2 Methods of proofs . .9 3.3 Implications and if and only if statements . 10 4 Direct proof 11 4.1 Description of method . 11 4.2 Hard parts? . 11 4.3 Examples . 11 4.4 Fallacious \proofs" . 15 4.5 Counterexamples . 16 5 Proof by cases 17 5.1 Method . 17 5.2 Hard parts? . 17 5.3 Examples of proof by cases . 17 6 Mathematical Induction 19 6.1 Method . 19 6.2 Versions of induction. 19 6.3 Hard parts? . 20 6.4 Examples of mathematical induction . 20 7 Contradiction 26 7.1 Method . 26 7.2 Hard parts? . 26 7.3 Examples of proof by contradiction . 26 8 Contrapositive 29 8.1 Method . 29 8.2 Hard parts? . 29 8.3 Examples . 29 9 Tips 31 9.1 What common mistakes do students make when trying to present the proofs? . 31 9.2 What are the reasons for mistakes? . 32 9.3 Advice to students for writing good proofs . 32 9.4 Friendly reminder . 32 c University of Birmingham 2014 10 Sets 34 10.1 Basics . 34 10.2 Subsets and power sets . 34 10.3 Cardinality and equality .