Aristotle's Assertoric Syllogistic and Modern Relevance Logic*
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Chapter 2 Introduction to Classical Propositional
CHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC 1 Motivation and History The origins of the classical propositional logic, classical propositional calculus, as it was, and still often is called, go back to antiquity and are due to Stoic school of philosophy (3rd century B.C.), whose most eminent representative was Chryssipus. But the real development of this calculus began only in the mid-19th century and was initiated by the research done by the English math- ematician G. Boole, who is sometimes regarded as the founder of mathematical logic. The classical propositional calculus was ¯rst formulated as a formal ax- iomatic system by the eminent German logician G. Frege in 1879. The assumption underlying the formalization of classical propositional calculus are the following. Logical sentences We deal only with sentences that can always be evaluated as true or false. Such sentences are called logical sentences or proposi- tions. Hence the name propositional logic. A statement: 2 + 2 = 4 is a proposition as we assume that it is a well known and agreed upon truth. A statement: 2 + 2 = 5 is also a proposition (false. A statement:] I am pretty is modeled, if needed as a logical sentence (proposi- tion). We assume that it is false, or true. A statement: 2 + n = 5 is not a proposition; it might be true for some n, for example n=3, false for other n, for example n= 2, and moreover, we don't know what n is. Sentences of this kind are called propositional functions. We model propositional functions within propositional logic by treating propositional functions as propositions. -
Marko Malink (NYU)
Demonstration by reductio ad impossibile in Posterior Analytics 1.26 Marko Malink (New York University) Contents 1. Aristotle’s thesis in Posterior Analytics 1. 26 ................................................................................. 1 2. Direct negative demonstration vs. demonstration by reductio ................................................. 14 3. Aristotle’s argument from priority in nature .............................................................................. 25 4. Priority in nature for a-propositions ............................................................................................ 38 5. Priority in nature for e-, i-, and o-propositions .......................................................................... 55 6. Accounting for Aristotle’s thesis in Posterior Analytics 1. 26 ................................................... 65 7. Parts and wholes ............................................................................................................................. 77 References ............................................................................................................................................ 89 1. Aristotle’s thesis in Posterior Analytics 1. 26 At the beginning of the Analytics, Aristotle states that the subject of the treatise is demonstration (ἀπόδειξις). A demonstration, for Aristotle, is a kind of deductive argument. It is a deduction through which, when we possess it, we have scientific knowledge (ἐπιστήμη). While the Prior Analytics deals with deduction in -
Theorem Proving in Classical Logic
MEng Individual Project Imperial College London Department of Computing Theorem Proving in Classical Logic Supervisor: Dr. Steffen van Bakel Author: David Davies Second Marker: Dr. Nicolas Wu June 16, 2021 Abstract It is well known that functional programming and logic are deeply intertwined. This has led to many systems capable of expressing both propositional and first order logic, that also operate as well-typed programs. What currently ties popular theorem provers together is their basis in intuitionistic logic, where one cannot prove the law of the excluded middle, ‘A A’ – that any proposition is either true or false. In classical logic this notion is provable, and the_: corresponding programs turn out to be those with control operators. In this report, we explore and expand upon the research about calculi that correspond with classical logic; and the problems that occur for those relating to first order logic. To see how these calculi behave in practice, we develop and implement functional languages for propositional and first order logic, expressing classical calculi in the setting of a theorem prover, much like Agda and Coq. In the first order language, users are able to define inductive data and record types; importantly, they are able to write computable programs that have a correspondence with classical propositions. Acknowledgements I would like to thank Steffen van Bakel, my supervisor, for his support throughout this project and helping find a topic of study based on my interests, for which I am incredibly grateful. His insight and advice have been invaluable. I would also like to thank my second marker, Nicolas Wu, for introducing me to the world of dependent types, and suggesting useful resources that have aided me greatly during this report. -
John P. Burgess Department of Philosophy Princeton University Princeton, NJ 08544-1006, USA [email protected]
John P. Burgess Department of Philosophy Princeton University Princeton, NJ 08544-1006, USA [email protected] LOGIC & PHILOSOPHICAL METHODOLOGY Introduction For present purposes “logic” will be understood to mean the subject whose development is described in Kneale & Kneale [1961] and of which a concise history is given in Scholz [1961]. As the terminological discussion at the beginning of the latter reference makes clear, this subject has at different times been known by different names, “analytics” and “organon” and “dialectic”, while inversely the name “logic” has at different times been applied much more broadly and loosely than it will be here. At certain times and in certain places — perhaps especially in Germany from the days of Kant through the days of Hegel — the label has come to be used so very broadly and loosely as to threaten to take in nearly the whole of metaphysics and epistemology. Logic in our sense has often been distinguished from “logic” in other, sometimes unmanageably broad and loose, senses by adding the adjectives “formal” or “deductive”. The scope of the art and science of logic, once one gets beyond elementary logic of the kind covered in introductory textbooks, is indicated by two other standard references, the Handbooks of mathematical and philosophical logic, Barwise [1977] and Gabbay & Guenthner [1983-89], though the latter includes also parts that are identified as applications of logic rather than logic proper. The term “philosophical logic” as currently used, for instance, in the Journal of Philosophical Logic, is a near-synonym for “nonclassical logic”. There is an older use of the term as a near-synonym for “philosophy of language”. -
C.S. Peirce's Abduction from the Prior Analytics
Providence College DigitalCommons@Providence Community Scholar Publications Providence College Community Scholars 7-1996 C.S. Peirce's Abduction from the Prior Analytics William Paul Haas Follow this and additional works at: https://digitalcommons.providence.edu/comm_scholar_pubs Haas, William Paul, "C.S. Peirce's Abduction from the Prior Analytics" (1996). Community Scholar Publications. 2. https://digitalcommons.providence.edu/comm_scholar_pubs/2 This Article is brought to you for free and open access by the Providence College Community Scholars at DigitalCommons@Providence. It has been accepted for inclusion in Community Scholar Publications by an authorized administrator of DigitalCommons@Providence. For more information, please contact [email protected]. WILLIAM PAUL HAAS July 1996 C.S. PEIRCE'S ABDUCTION FROM THE PRIOR ANALYTICS In his Ancient Formal Logic. Professor Joseph Bochenski finds Aristotle's description of syllogisms based upon hypotheses to be "difficult to understand." Noting that we do not have the treatise which Aristotle promised to write, Bochenski laments the fact that the Prior Analytics, where it is treated most explicitly, "is either corrupted or (which is more probable) was hastily written and contains logical errors." (1) Charles Sanders Peirce wrestled with the same difficult text when he attempted to establish the Aristotelian roots of his theory of abductive or hypothetical reasoning. However, Peirce opted for the explanation that the fault was with the corrupted text, not with Aristotle's exposition. Peirce interpreted the text of Book II, Chapter 25 thus: Accordingly, when he opens the next chapter with the word ' Ajray (¿y-q a word evidently chosen to form a pendant to 'Errctyuyrj, we feel sure that this is what he is coming to. -
A Quasi-Classical Logic for Classical Mathematics
Theses Honors College 11-2014 A Quasi-Classical Logic for Classical Mathematics Henry Nikogosyan University of Nevada, Las Vegas Follow this and additional works at: https://digitalscholarship.unlv.edu/honors_theses Part of the Logic and Foundations Commons Repository Citation Nikogosyan, Henry, "A Quasi-Classical Logic for Classical Mathematics" (2014). Theses. 21. https://digitalscholarship.unlv.edu/honors_theses/21 This Honors Thesis is protected by copyright and/or related rights. It has been brought to you by Digital Scholarship@UNLV with permission from the rights-holder(s). You are free to use this Honors Thesis in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s) directly, unless additional rights are indicated by a Creative Commons license in the record and/or on the work itself. This Honors Thesis has been accepted for inclusion in Theses by an authorized administrator of Digital Scholarship@UNLV. For more information, please contact [email protected]. A QUASI-CLASSICAL LOGIC FOR CLASSICAL MATHEMATICS By Henry Nikogosyan Honors Thesis submitted in partial fulfillment for the designation of Departmental Honors Department of Philosophy Ian Dove James Woodbridge Marta Meana College of Liberal Arts University of Nevada, Las Vegas November, 2014 ABSTRACT Classical mathematics is a form of mathematics that has a large range of application; however, its application has boundaries. In this paper, I show that Sperber and Wilson’s concept of relevance can demarcate classical mathematics’ range of applicability by demarcating classical logic’s range of applicability. -
Catalogue of Titles of Works Attributed to Aristotle
Catalogue of Titles of works attributed by Aristotle 1 To enhance readability of the translations and usability of the catalogues, I have inserted the following bold headings into the lists. These have no authority in any manuscript, but are based on a theory about the composition of the lists described in chapter 3. The text and numbering follows that of O. Gigon, Librorum deperditorum fragmenta. PART ONE: Titles in Diogenes Laertius (D) I. Universal works (ta kathalou) A. The treatises (ta syntagmatika) 1. The dialogues or exoterica (ta dialogika ex terika) 2. The works in propria persona or lectures (ta autopros pa akroamatika) a. Instrumental works (ta organika) b. Practical works (ta praktika) c. Productive Works (ta poi tika) d. Theoretical works (ta the r tika) . Natural philosophy (ta physiologia) . Mathematics (ta math matika) B. Notebooks (ta hypomn matika) II. Intermediate works (ta metaxu) III. Particular works (ta merika) PART TWO: Titles in the Vita Hesychii (H) This list is organized in the same way as D, with two exceptions. First, IA2c “productive works” has dropped out. Second, there is an appendix, organized as follows: IV. Appendix A. Intermediate or Particular works B. Treatises C. Notebooks D. Falsely ascribed works PART THREE: Titles in Ptolemy al-Garib (A) This list is organized in the same way as D, except it contains none of the Intermediate or Particular works. It was written in Arabic, and later translated into Latin, and then reconstructed into Greek, which I here translate. PART FOUR: Titles in the order of Bekker (B) The modern edition contains works only in IA2 (“the works in propria persona”), and replaces the theoretical works before the practical and productive, as follows. -
The Development of Mathematical Logic from Russell to Tarski: 1900–1935
The Development of Mathematical Logic from Russell to Tarski: 1900–1935 Paolo Mancosu Richard Zach Calixto Badesa The Development of Mathematical Logic from Russell to Tarski: 1900–1935 Paolo Mancosu (University of California, Berkeley) Richard Zach (University of Calgary) Calixto Badesa (Universitat de Barcelona) Final Draft—May 2004 To appear in: Leila Haaparanta, ed., The Development of Modern Logic. New York and Oxford: Oxford University Press, 2004 Contents Contents i Introduction 1 1 Itinerary I: Metatheoretical Properties of Axiomatic Systems 3 1.1 Introduction . 3 1.2 Peano’s school on the logical structure of theories . 4 1.3 Hilbert on axiomatization . 8 1.4 Completeness and categoricity in the work of Veblen and Huntington . 10 1.5 Truth in a structure . 12 2 Itinerary II: Bertrand Russell’s Mathematical Logic 15 2.1 From the Paris congress to the Principles of Mathematics 1900–1903 . 15 2.2 Russell and Poincar´e on predicativity . 19 2.3 On Denoting . 21 2.4 Russell’s ramified type theory . 22 2.5 The logic of Principia ......................... 25 2.6 Further developments . 26 3 Itinerary III: Zermelo’s Axiomatization of Set Theory and Re- lated Foundational Issues 29 3.1 The debate on the axiom of choice . 29 3.2 Zermelo’s axiomatization of set theory . 32 3.3 The discussion on the notion of “definit” . 35 3.4 Metatheoretical studies of Zermelo’s axiomatization . 38 4 Itinerary IV: The Theory of Relatives and Lowenheim’s¨ Theorem 41 4.1 Theory of relatives and model theory . 41 4.2 The logic of relatives . -
Introduction to Formal Logic II (3 Credit
PHILOSOPHY 115 INTRODUCTION TO FORMAL LOGIC II BULLETIN INFORMATION PHIL 115 – Introduction to Formal Logic II (3 credit hrs) Course Description: Intermediate topics in predicate logic, including second-order predicate logic; meta-theory, including soundness and completeness; introduction to non-classical logic. SAMPLE COURSE OVERVIEW Building on the material from PHIL 114, this course introduces new topics in logic and applies them to both propositional and first-order predicate logic. These topics include argument by induction, duality, compactness, and others. We will carefully prove important meta-logical results, including soundness and completeness for both propositional logic and first-order predicate logic. We will also learn a new system of proof, the Gentzen-calculus, and explore first-order predicate logic with functions and identity. Finally, we will discuss potential motivations for alternatives to classical logic, and examine how those motivations lead to the development of intuitionistic logic, including a formal system for intuitionistic logic, comparing the features of that formal system to those of classical first-order predicate logic. ITEMIZED LEARNING OUTCOMES Upon successful completion of PHIL 115, students will be able to: 1. Apply, as appropriate, principles of analytical reasoning, using as a foundation the knowledge of mathematical, logical, and algorithmic principles 2. Recognize and use connections among mathematical, logical, and algorithmic methods across disciplines 3. Identify and describe problems using formal symbolic methods and assess the appropriateness of these methods for the available data 4. Effectively communicate the results of such analytical reasoning and problem solving 5. Explain and apply important concepts from first-order logic, including duality, compactness, soundness, and completeness 6. -
The Beginnings of Formal Logic: Deduction in Aristotle's Topics Vs
Phronesis 60 (�0�5) �67-309 brill.com/phro The Beginnings of Formal Logic: Deduction in Aristotle’s Topics vs. Prior Analytics Marko Malink Department of Philosophy, New York University, 5 Washington Place, New York, NY 10003. USA [email protected] Abstract It is widely agreed that Aristotle’s Prior Analytics, but not the Topics, marks the begin- ning of formal logic. There is less agreement as to why this is so. What are the distinctive features in virtue of which Aristotle’s discussion of deductions (syllogismoi) qualifies as formal logic in the one treatise but not in the other? To answer this question, I argue that in the Prior Analytics—unlike in the Topics—Aristotle is concerned to make fully explicit all the premisses that are necessary to derive the conclusion in a given deduction. Keywords formal logic – deduction – syllogismos – premiss – Prior Analytics – Topics 1 Introduction It is widely agreed that Aristotle’s Prior Analytics marks the beginning of formal logic.1 Aristotle’s main concern in this treatise is with deductions (syllogismoi). Deductions also play an important role in the Topics, which was written before the Prior Analytics.2 The two treatises start from the same definition of what 1 See e.g. Cornford 1935, 264; Russell 1946, 219; Ross 1949, 29; Bocheński 1956, 74; Allen 2001, 13; Ebert and Nortmann 2007, 106-7; Striker 2009, p. xi. 2 While the chronological order of Aristotle’s works cannot be determined with any certainty, scholars agree that the Topics was written before the Prior Analytics; see Brandis 1835, 252-9; Ross 1939, 251-2; Bocheński 1956, 49-51; Kneale and Kneale 1962, 23-4; Brunschwig 1967, © koninklijke brill nv, leiden, ���5 | doi �0.��63/�5685�84-��34��86 268 Malink a deduction is (stated in the first chapter of each). -
Aristotle on Principles As Elements
Aristotle on Principles as Elements Marko Malink, New York University Draft, September 2016 Abstract: In his discussion of the four causes, Aristotle claims that ‘the hypotheses are material causes of the conclusion’ ( Physics 2.3, Metaphysics Δ 2). This claim has puzzled commentators since antiquity. It is usually taken to mean that the premises of any deduction are material causes of the conclusion. By contrast, I argue that the claim does not apply to deductions in general but only to scientific demonstrations. In Aristotle’s view, the theorems of a given science are composites composed of the indemonstrable premises from which they are demonstrated. Accordingly, these premises are elements, and hence material causes, of the theorems. Given this, Aristotle’s claim can be shown to be well-motivated and illuminating. 1. Hypotheses are material causes of the conclusion In Physics 2.3 and its doublet in Metaphysics Δ 2, Aristotle distinguishes the so-called four causes. The first of them is characterized as ‘that from which as a constituent something comes to be’. 1 Since antiquity, this type of cause is known as the ‘material cause’. 2 Aristotle illustrates it by a series of examples as follows: 1 τὸ ἐξ οὗ γίγνεταί τι ἐνυπάρχοντος, Phys. 2.3 194b24 (= Metaph. Δ 2 1013a24–5). 2 The ancient commentators refer to it as ὑλικὸν αἴτιον (Alex. Aphr. in Metaph. 349.2, 351.5, 353.20, Philop. in Phys. 243.21, 243.30, 246.25–247.11, 249.6, Simpl. in Phys. 314.27, 319.20, 320.13, Asclep. in Metaph. 305.22–4, 306.9–14). -
The Peripatetic Program in Categorical Logic: Leibniz on Propositional Terms
THE REVIEW OF SYMBOLIC LOGIC, Page 1 of 65 THE PERIPATETIC PROGRAM IN CATEGORICAL LOGIC: LEIBNIZ ON PROPOSITIONAL TERMS MARKO MALINK Department of Philosophy, New York University and ANUBAV VASUDEVAN Department of Philosophy, University of Chicago Abstract. Greek antiquity saw the development of two distinct systems of logic: Aristotle’s theory of the categorical syllogism and the Stoic theory of the hypothetical syllogism. Some ancient logicians argued that hypothetical syllogistic is more fundamental than categorical syllogistic on the grounds that the latter relies on modes of propositional reasoning such as reductio ad absurdum. Peripatetic logicians, by contrast, sought to establish the priority of categorical over hypothetical syllogistic by reducing various modes of propositional reasoning to categorical form. In the 17th century, this Peripatetic program of reducing hypothetical to categorical logic was championed by Gottfried Wilhelm Leibniz. In an essay titled Specimina calculi rationalis, Leibniz develops a theory of propositional terms that allows him to derive the rule of reductio ad absurdum in a purely categor- ical calculus in which every proposition is of the form AisB. We reconstruct Leibniz’s categorical calculus and show that it is strong enough to establish not only the rule of reductio ad absurdum,but all the laws of classical propositional logic. Moreover, we show that the propositional logic generated by the nonmonotonic variant of Leibniz’s categorical calculus is a natural system of relevance logic ¬ known as RMI→ . From its beginnings in antiquity up until the late 19th century, the study of formal logic was shaped by two distinct approaches to the subject. The first approach was primarily concerned with simple propositions expressing predicative relations between terms.