Contributions of the Logicians

Total Page:16

File Type:pdf, Size:1020Kb

Contributions of the Logicians Contributions of The Logicians. Part I. From Richard Whately to William Stanley Jevons Stanley N Burris Draft: March 3, 2001 Author address: Department of Pure Mathematics, University of Waterloo, Waterloo, Ontario, Canada, N2L 3G1 E-mail address: [email protected] URL: www.thoralf.uwaterloo.ca Contents Preface v Prelude: The Creation of an Algebra of Logic 1 Chapter 1. Richard Whately, Archbishop of Dublin (1787{1863) 9 1. Elements of Logic (1826) 9 Chapter 2. George Peacock (1791{1858) 21 1. Treatise on Algebra: Vol. 1 1842, Vol. 2 1845 21 Chapter 3. Augustus De Morgan (1806{1871) 25 1. Formal Logic (1847) 27 2. The A±rmatory Syllogisms of Formal Logic 43 3. On the Syllogism 45 4. Concluding Remarks 52 Chapter 4. George Boole (1815{1864) 55 1. The Mathematical Analysis of Logic (1847) 56 2. The Laws of Thought (1854) 68 Chapter 5. William Stanley Jevons (1835{1882) 77 1. Pure Logic (1864) 78 2. The Substitution of Similars (1869) 85 3. On the Mechanical Performance of Logical Inference (1869) 90 4. The Principles of Science (1874) 91 5. Studies in Deductive Logic (1880) 93 Appendix 1: The Proof System 95 BR Appendix 2: The Proof System 101 BA Appendix 3: The Proof System 105 1. The system AB 107 2. The Rule of AB0 and 1 109 3. Boole's Main Theorems 112 4. Boole's Method 114 5. A More Sophisticated Approach 114 6. A Remark on Hailperin's System 115 7. Tying the Proof System to the Real World 116 8. The Connection with Boolean Rings 118 9. The Connection with Boolean Algebra 119 10. Boole's Use of Division 120 Appendix 4: Existential Import 123 iii iv CONTENTS Bibliography 125 Preface As an undergraduate I read portions of Boole's 1854 classic, The Laws of Thought, and came to the conclusion that Boole was rather inept at doing Boolean algebra. Much later, when studying the history of logic in the 19th century, a conversation with Alasdair Urquhart led me to the 1976 book of Theodore Hailperin that shows why Boole's methods work. This was when I ¯nally realized that trying to superimpose Boolean algebra, or Boolean rings, on Boole's work was a real mistake. Boole uses the ordinary number system, and not a two-element algebra. With the exception of Hailperin's book I do not know of a single history of logic or mathematics that properly explains Boole's work. Furthermore, even though the books and papers devoted to the development of mathematical logic in the mid 1800s are readily available today, the essential facts have not been written up in a concise yet comprehensive form for a modern audience. These notes intend to round out the picture with a brief but substantial account of the transition from Aristotelian logic to mathematical logic, starting with Whately's revival of Aristotelian logic The Elements of Logic in 1826, continuing through the work of De Morgan, Boole and Jevons, and concluding with modern versions of equational proof systems for Boolean algebra, Boolean rings, and a discussion of Hailperin's expos¶e of the work of Boole. Many of the sections are devoted to discussing a single book. Within such sections plain page number references (without a source cited) apply to the book being discussed in the section. Stanley Burris Waterloo, Ontario March, 2001 v vi PREFACE Prelude: The Creation of an Algebra of Logic The successful introduction of mathematical techniques to handle traditional Aristotelian logic was based entirely on the development of an equational logic for classes. We will trace this development through the works of De Morgan, Boole and Jevons.1 By studying equations involving the operations of union, intersection, and complement, they created an algebraic approach that led to an extension of traditional Aristotelian logic. The development of logic for mathematics was initiated by e®orts to ¯nd the axioms and rules of inference needed for an equational logic of classes. Some of the most fundamental perspectives of modern logic were not available to these pioneers. Above all they did not have a clear separation of logic into its syntatic and semantic components. For example, in 1874 Jevons says that A = B and B = A are really just \one equation accidentally written in two di®erent manners." The modern viewpoint says that the two equations are di®erent (as strings of symbols), but they have the same truth value under any given interpretation. De Morgan was fascinated by the study of equality insofar as it led to new forms of categorical propositions, but he did very little in the way of an equational logic formulation. The famous De Morgan laws he stated as ([4], p. 118): The contrary of PQ is p,q; that of P,Q is pq. Although he had many ideas regarding how one could make use of symbolism to give a fresh approach to syllogistic logic, it is curious that he did not use a symbol for equality in his work and continue to develop an equational logic of classes. Instead this was done, in a rather ba²ing manner, by Boole. A transparent approach would have to wait till the early 1860s, with the work of De Morgan's student Jevons. De Morgan was an inspiration for his younger friend, the school teacher Boole, as well as for Jevons. De Morgan's feud with the Scottish philosopher Sir William Hamilton of Edinburgh2 caused Boole to put aside his work in traditional mathematics (di®erential equations, the calculus of variations, etc.) in 1847 in order to apply algebra to logic. Revising this initial work on logic would be Boole's main interest till 1854. Then he returned to traditional mathematics. Boole views classical logic as reasoning about classes: given a collection 1, : : : , n of proposi- tions about classes one wants to ¯nd propositions about (some of) these classesP thatP follow from , : : : , . Boole's new approach to logic is builtPon two beliefs: P1 Pn 1. the meaning of such propositions can be expressed by equations, and 2. one can apply the symbolic methods of an augmented ordinary algebra to the equations of the premises to ¯nd the equations of the conclusions. The ¯rst item is handled convincingly by Boole, at least for universal propositions, but the second item is not. In the 1847 book he simply describes his algebraic methods and employs them. Seven years later, in his 1854 book, he is caught up in trying to explain why it is permissible to use terms in his equations that have no interpretation as classes. His explanations were, and still 1The names Boole and De Morgan are well known in logic circles, but not that of Jevons. Jevons is much better remembered for his contributions to economics|he is considered one of the fathers of mathematical economics, introducing the methods of calculus to the subject. In this arena one of his least successful and most memorable contributions was to tie economic cycles to sunspot cycles. 2Not to be confused with the mathematician of quaternion fame, Sir William Hamilton of Dublin. 1 2 PRELUDE: THE CREATION OF AN ALGEBRA OF LOGIC are, most unconvincing. In essence his defence was just that he was using the `symbolic method', and the requests for clari¯cation were mainly met with a number of new examples showing how to use his system. Boole discovered that ordinary algebra leads to a powerful algebraic system for analyzing logical arguments, but he really did not know why it worked. Indeed, it seems that the fact that it did work in many examples was quite enough to convince Boole that it would work in general|a masterful application of inductive reasoning to provide an equational approach to classical deductive reasoning. The fact that his methods provide an equational logic that can indeed correctly handle arguments about classes was not established until Theodore Hailperin's book appeared in 1976.3 Hailperin uses signed multisets to extend the collection of classes, after identifying classes with idempotent multisets. In this setting Boole's operations become meaningful, namely class + class may not be a class, but it is always a signed multiset. The justi¯cation of Boole's system likely requires more sophistication in modern algebra than was available in the 19th century. This would lead Jevons in the 1860s to create an alternative algebra of logic, essentially what is now called Boolean algebra.4 Boole's work is a clever interplay between traditional logic and the algebra of numbers. With Jevons, logic abandons the ties to numbers and joins its new companion, `Boolean' algebra, for a mature and enduring relationship. To have a good idea of where Boole and De Morgan were starting from we begin these notes with an overview of the influential 1826 logic text of Richard Whately. The notion of a class was well established in the traditional literature on Aristotelian logic, as well as the use of a single letter to denote a class, for example, using M to denote the class of men. However, using symbols to describe combinations of classes, for example, using A + B for the union of A and B, was not part of the traditional literature of either logic or mathematics. Variables and Constants In modern equational logic5 we use two kinds of symbols as simple names for the objects in the universe of discussion, namely variables, usually letters x; y; z; : : : from the end of the alphabet, and constants, usually letters a; b; c; : : : from the beginning of the alphabet, as well as the numerals 0; 1; : : : . The reason for the two kinds of symbols is that we treat the variables in an equation as universally quanti¯ed, but the constants are not quanti¯ed.
Recommended publications
  • The Incorrect Usage of Propositional Logic in Game Theory
    The Incorrect Usage of Propositional Logic in Game Theory: The Case of Disproving Oneself Holger I. MEINHARDT ∗ August 13, 2018 Recently, we had to realize that more and more game theoretical articles have been pub- lished in peer-reviewed journals with severe logical deficiencies. In particular, we observed that the indirect proof was not applied correctly. These authors confuse between statements of propositional logic. They apply an indirect proof while assuming a prerequisite in order to get a contradiction. For instance, to find out that “if A then B” is valid, they suppose that the assumptions “A and not B” are valid to derive a contradiction in order to deduce “if A then B”. Hence, they want to establish the equivalent proposition “A∧ not B implies A ∧ notA” to conclude that “if A then B”is valid. In fact, they prove that a truth implies a falsehood, which is a wrong statement. As a consequence, “if A then B” is invalid, disproving their own results. We present and discuss some selected cases from the literature with severe logical flaws, invalidating the articles. Keywords: Transferable Utility Game, Solution Concepts, Axiomatization, Propositional Logic, Material Implication, Circular Reasoning (circulus in probando), Indirect Proof, Proof by Contradiction, Proof by Contraposition, Cooperative Oligopoly Games 2010 Mathematics Subject Classifications: 03B05, 91A12, 91B24 JEL Classifications: C71 arXiv:1509.05883v1 [cs.GT] 19 Sep 2015 ∗Holger I. Meinhardt, Institute of Operations Research, Karlsruhe Institute of Technology (KIT), Englerstr. 11, Building: 11.40, D-76128 Karlsruhe. E-mail: [email protected] The Incorrect Usage of Propositional Logic in Game Theory 1 INTRODUCTION During the last decades, game theory has encountered a great success while becoming the major analysis tool for studying conflicts and cooperation among rational decision makers.
    [Show full text]
  • 46. on the Completeness O F the Leibnizian Modal System with a Restriction by Setsuo SAITO Shibaura Institute of Technology,Tokyo (Comm
    198 [Vol. 42, 46. On the Completeness o f the Leibnizian Modal System with a Restriction By Setsuo SAITO Shibaura Institute of Technology,Tokyo (Comm. by Zyoiti SUETUNA,M.J.A., March 12, 1966) § 1. Introduction. The purpose of this paper is to show the completeness of a modal system which will be called Lo in the following. In my previous paper [1], in order to show an example of defence of _.circular definition, the following definition was given: A statement is analytic if and only if it is consistent with every statement that expresses what is possible. This definition, roughly speaking, is materially equivalent to Carnap's definition of L-truth which is suggested by Leibniz' conception that a necessary truth must hold in all possible worlds (cf. Carnap [2], p.10). If "analytic" is replaced by "necessary" in the above definition, this definition becomes as follows: A statement is necessary if and only if it is consistent with every statement that expresses what is possible. This reformed definition is symbolized by modal signs as follows: Opm(q)[Qq~O(p•q)1, where p and q are propositional variables. Let us replace it by the following axiom-schema and rule: Axiom-schema. D a [Q,9 Q(a •,S)], where a, ,9 are arbitrary formulas. Rule of inference. If H Q p Q(a •p), then i- a, where a is an arbitrary formula and p is a propositional variable not contained in a. We call L (the Leibnizian modal system) the system obtained from the usual propositional calculus by adding the above axiom schema and rule and the rule of replacement of material equivalents.
    [Show full text]
  • Chapter 10: Symbolic Trails and Formal Proofs of Validity, Part 2
    Essential Logic Ronald C. Pine CHAPTER 10: SYMBOLIC TRAILS AND FORMAL PROOFS OF VALIDITY, PART 2 Introduction In the previous chapter there were many frustrating signs that something was wrong with our formal proof method that relied on only nine elementary rules of validity. Very simple, intuitive valid arguments could not be shown to be valid. For instance, the following intuitively valid arguments cannot be shown to be valid using only the nine rules. Somalia and Iran are both foreign policy risks. Therefore, Iran is a foreign policy risk. S I / I Either Obama or McCain was President of the United States in 2009.1 McCain was not President in 2010. So, Obama was President of the United States in 2010. (O v C) ~(O C) ~C / O If the computer networking system works, then Johnson and Kaneshiro will both be connected to the home office. Therefore, if the networking system works, Johnson will be connected to the home office. N (J K) / N J Either the Start II treaty is ratified or this landmark treaty will not be worth the paper it is written on. Therefore, if the Start II treaty is not ratified, this landmark treaty will not be worth the paper it is written on. R v ~W / ~R ~W 1 This or statement is obviously exclusive, so note the translation. 427 If the light is on, then the light switch must be on. So, if the light switch in not on, then the light is not on. L S / ~S ~L Thus, the nine elementary rules of validity covered in the previous chapter must be only part of a complete system for constructing formal proofs of validity.
    [Show full text]
  • An Introduction to Critical Thinking and Symbolic Logic: Volume 1 Formal Logic
    An Introduction to Critical Thinking and Symbolic Logic: Volume 1 Formal Logic Rebeka Ferreira and Anthony Ferrucci 1 1An Introduction to Critical Thinking and Symbolic Logic: Volume 1 Formal Logic is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License. 1 Preface This textbook has developed over the last few years of teaching introductory symbolic logic and critical thinking courses. It has been truly a pleasure to have beneted from such great students and colleagues over the years. As we have become increasingly frustrated with the costs of traditional logic textbooks (though many of them deserve high praise for their accuracy and depth), the move to open source has become more and more attractive. We're happy to provide it free of charge for educational use. With that being said, there are always improvements to be made here and we would be most grateful for constructive feedback and criticism. We have chosen to write this text in LaTex and have adopted certain conventions with symbols. Certainly many important aspects of critical thinking and logic have been omitted here, including historical developments and key logicians, and for that we apologize. Our goal was to create a textbook that could be provided to students free of charge and still contain some of the more important elements of critical thinking and introductory logic. To that end, an additional benet of providing this textbook as a Open Education Resource (OER) is that we will be able to provide newer updated versions of this text more frequently, and without any concern about increased charges each time.
    [Show full text]
  • INTERMEDIATE LOGIC – Glossary of Key Terms This Glossary Includes Terms That Are Defined in the Text in the Lesson and on the Page Noted
    1 GLOSSARY | INTERMEDIATE LOGIC BY JAMES B. NANCE INTERMEDIATE LOGIC – Glossary of key terms This glossary includes terms that are defined in the text in the lesson and on the page noted. It does not include the rules that are given in the appendices, but does include some key terms carried over from Introductory Logic. Algebraic identity Lesson 36, page 291 A rule of digital logic that can be used to simplify a proposition (see Appendix D). AND gate Lesson 32, page 266 A logic gate that performs the logical operation conjunction. Antecedent Lesson 4, page 27 In a conditional if p then q, the antecedent is the proposition represented by the p. Argument Introductory Logic, lesson 19, page 141 A set of statements, one of which appears to be implied or supported by the others. Biconditional Lesson 5, page 35 The logical operator “if and only if” symbolized by ≡, that joins two propositions and is true when both propositions have the same truth value, and false when their truth values differ. Binary number system Lesson 30, page 254 A base-two number system, using only the numerals 0 and 1 to represent any number (cf. the standard decimal number system, which is base ten, using the numerals 0 through 9). Bit Lesson 29, page 249 The smallest amount of information that a computer stores, having a binary value of 1 or 0. Bubble pushing Lesson 38, page 303 A technique used to simplify logic circuits by visually applying De Morgan’s theorem. Byte Lesson 29, page 249 A set of bits (usually eight) required to encode one character.
    [Show full text]
  • MGF1121 Course Outline
    MGF1121 Course Outline Introduction to Logic............................................................................................................. (3) (P) Description: This course is a study of both the formal and informal nature of human thought. It includes an examination of informal fallacies, sentential symbolic logic and deductive proofs, categorical propositions, syllogistic arguments and sorites. General Education Learning Outcome: The primary General Education Learning Outcome (GELO) for this course is Quantitative Reasoning, which is to understand and apply mathematical concepts and reasoning, and analyze and interpret various types of data. The GELO will be assessed through targeted questions on either the comprehensive final or an outside assignment. Prerequisite: MFG1100, MAT1033, or MAT1034 with a grade of “C” or better, OR the equivalent. Rationale: In order to function effectively and productively in an increasingly complex democratic society, students must be able to think for themselves to make the best possible decisions in the many and varied situations that will confront them. Knowledge of the basic concepts of logical reasoning, as offered in this course, will give students a firm foundation on which to base their decision-making processes. Students wishing to major in computer science, philosophy, mathematics, engineering and most natural sciences are required to have a working knowledge of symbolic logic and its applications. Impact Assessment: Introduction to Logic provides students with critical insight
    [Show full text]
  • Forall X: an Introduction to Formal Logic 1.30
    University at Albany, State University of New York Scholars Archive Philosophy Faculty Books Philosophy 12-27-2014 Forall x: An introduction to formal logic 1.30 P.D. Magnus University at Albany, State University of New York, [email protected] Follow this and additional works at: https://scholarsarchive.library.albany.edu/ cas_philosophy_scholar_books Part of the Logic and Foundations of Mathematics Commons Recommended Citation Magnus, P.D., "Forall x: An introduction to formal logic 1.30" (2014). Philosophy Faculty Books. 3. https://scholarsarchive.library.albany.edu/cas_philosophy_scholar_books/3 This Book is brought to you for free and open access by the Philosophy at Scholars Archive. It has been accepted for inclusion in Philosophy Faculty Books by an authorized administrator of Scholars Archive. For more information, please contact [email protected]. forallx An Introduction to Formal Logic P.D. Magnus University at Albany, State University of New York fecundity.com/logic, version 1.30 [141227] This book is offered under a Creative Commons license. (Attribution-ShareAlike 3.0) The author would like to thank the people who made this project possible. Notable among these are Cristyn Magnus, who read many early drafts; Aaron Schiller, who was an early adopter and provided considerable, helpful feedback; and Bin Kang, Craig Erb, Nathan Carter, Wes McMichael, Selva Samuel, Dave Krueger, Brandon Lee, Toan Tran, and the students of Introduction to Logic, who detected various errors in previous versions of the book. c 2005{2014 by P.D. Magnus. Some rights reserved. You are free to copy this book, to distribute it, to display it, and to make derivative works, under the following conditions: (a) Attribution.
    [Show full text]
  • The Propositional Logic of Principia Mathematica and Some of Its
    The propositional logic ofPM 93 2. Before and after Principia Mathematica One source which would have answered all questions is, of course, Russell. I imagine that he worked out all the demonstrations in detail and then condensed them to the current abbreviated form. At the least he must have had a sketch for The propositional logic of the complete demonstration. Presumably the next step would be to send them to Whitehead for comments. For a discussion of this process see Douglas Lackey's "The Whitehead Correspondence" [10]. In any case neither Russell's working Principia Mathematica and papers nor the letters to and responses from Whitehead concerning Part I, Section A are in the Russell Archives. There is however a letter from Whitehead to Russell some of its forerunners which indicates that, in an early draft of Part I, Section A, the demonstrations had not been written out in sufficient detail. Whitehead says, "Everything, even the object of the book, has been sacrificed to making the proofs look short and neat. It by Daniel J. O'Leary is essential, especially in the early parts that the proofs be written out fully-" (emphasis in original). This letter [31] had been later dated by Russell and a types­ cript [32]"prepared. On the bottom of the letter Russell has written, "Whitehead's criticism of *1-*5 ofPrincipia Mathematica". On the bottom of the typescript Rus­ sell wrote, "A criticism of my first draft of the Logic of Propositions for the begin­ ning of Principia Mathematica. Whitehead was entirely right." Russell assigned a I.
    [Show full text]
  • 9.6 Expanding the Rules of Inference: Replacement Rules 393
    M09_COPI1396_13_SE_C09.QXD 10/19/07 3:46 AM Page 393 9.6 Expanding the Rules of Inference: Replacement Rules 393 is the manager’s next-door neighbor; E—Mr. Jones’s annual earnings are exactly divisible by 3; T—$40,000 is exactly divisible by 3; R— Mr. Robinson is the manager’s next-door neighbor; H—Mr. Robinson lives halfway between Detroit and Chicago; D—Mr. Robinson lives in Detroit; S—Mr. Smith is the manager’s next-door neighbor.) 9. If Mr. Smith is the manager’s next-door neighbor, then Mr. Smith lives halfway between Detroit and Chicago. If Mr. Smith lives halfway between Detroit and Chicago, then he does not live in Chicago. Mr. Smith is the manager’s next-door neighbor. If Mr. Robinson lives in Detroit, then he does not live in Chicago. Mr. Robinson lives in Detroit. Mr. Smith lives in Chicago or else either Mr. Robinson or Mr. Jones lives in Chicago. If Mr. Jones lives in Chicago, then the manager is Jones. Therefore the manager is Jones. (S—Mr. Smith is the manager’s next-door neighbor; W—Mr. Smith lives halfway between Detroit and Chicago; L—Mr. Smith lives in Chicago; D—Mr. Robinson lives in Detroit; I—Mr. Robinson lives in Chicago; C—Mr. Jones lives in Chicago; B—The manager is Jones.) *10. If Smith once beat the editor at billiards, then Smith is not the editor. Smith once beat the editor at billiards. If the manager is Jones, then Jones is not the editor. The manager is Jones.
    [Show full text]
  • A History of Natural Deduction and Elementary Logic Textbooks
    A History of Natural Deduction and Elementary Logic Textbooks Francis Jeffry Pelletier 1 Introduction In 1934 a most singular event occurred. Two papers were published on a topic that had (apparently) never before been written about, the authors had never been in contact with one another, and they had (apparently) no common intellectual background that would otherwise account for their mutual interest in this topic. 1 These two papers formed the basis for a movement in logic which is by now the most common way of teaching elementary logic by far, and indeed is perhaps all that is known in any detail about logic by a number of philosophers (especially in North America). This manner of proceeding in logic is called ‘natural deduction’. And in its own way the instigation of this style of logical proof is as important to the history of logic as the discovery of resolution by Robinson in 1965, or the discovery of the logistical method by Frege in 1879, or even the discovery of the syllogistic by Aristotle in the fourth century BC.2 Yet it is a story whose details are not known by those most affected: those ‘or- dinary’ philosophers who are not logicians but who learned the standard amount of formal logic taught in North American undergraduate and graduate departments of philosophy. Most of these philosophers will have taken some (series of) logic courses that exhibited natural deduction, and may have heard that natural deduc- tion is somehow opposed to various other styles of proof systems in some number of different ways.
    [Show full text]
  • Logic Chapter 9
    Logic: A Brief Introduction Ronald L. Hall, Stetson University Chapter 9- Sentential Proofs 9.1 Introduction So far we have introduced three ways of assessing the validity of truth-functional arguments. The methods for proving validity are as follows: 1. The Truth Table Method: We can prove that a particular argument is valid if the complete interpretation of the conditional proposition that represents that argument is shown by a truth table to be tautological. 2. The Short-Cut Method of Assigning Truth-Values: We can prove that a particular argument is valid if it is impossible for the antecedent of the conditional proposition that expresses it to be true when the consequent of that proposition is assigned the truth-value of false. 3. The Valid Argument Form Method: We can show that a particular argument is valid if it is a substitution instance of one of the five valid argument forms we have introduced so far (Modus Ponens, Modus Tollens, Hypothetical Syllogism, Disjunctive Syllogism, and Constructive Dilemma). These same three methods can be used for proving invalidity , as follows: 1. The Truth Table Method: We can prove that a particular argument is invalid if the complete interpretation of the conditional proposition that represents that argument is shown by a truth table not to be tautological. 2. The Short-Cut Method of Assigning Truth-Values: We can prove that a particular argument is invalid if it is possible for the antecedent of the conditional proposition that expresses it to be true when the consequent of that proposition is assigned the truth-value of false.
    [Show full text]
  • Logic) 1 1.1 Formal Notation
    Universal generalization From Wikipedia, the free encyclopedia Contents 1 Absorption (logic) 1 1.1 Formal notation ............................................ 1 1.2 Examples ............................................... 1 1.3 Proof by truth table .......................................... 2 1.4 Formal proof ............................................. 2 1.5 References ............................................... 2 2 Associative property 3 2.1 Definition ............................................... 3 2.2 Generalized associative law ...................................... 4 2.3 Examples ............................................... 4 2.4 Propositional logic .......................................... 7 2.4.1 Rule of replacement ..................................... 7 2.4.2 Truth functional connectives ................................. 7 2.5 Non-associativity ........................................... 7 2.5.1 Nonassociativity of floating point calculation ......................... 8 2.5.2 Notation for non-associative operations ........................... 8 2.6 See also ................................................ 10 2.7 References ............................................... 10 3 Axiom 11 3.1 Etymology ............................................... 11 3.2 Historical development ........................................ 12 3.2.1 Early Greeks ......................................... 12 3.2.2 Modern development ..................................... 12 3.2.3 Other sciences ......................................... 13 3.3 Mathematical
    [Show full text]