10.4 THE BOOLEAN ARITHMETICAL RESULTS

Size: px
Start display at page:

Download "10.4 THE BOOLEAN ARITHMETICAL RESULTS"

Transcription

1 10.4 THE BOOLEAN ARITHMETICAL RESULTS The numerical detailed calculations of these 2 6 = 64 possible problems relative to each of one of the five different hypothesis described above constitutes the following five bulky computation work, each of one has 64 syllogistic cases numbered in sequence from the first, A 1 A 2 F 1 (NR. 1), to the last, O 1 O 2 F 4 (NR. 64), for each one of the five hypothesis (among others), that is: 1 st HYPOTHESIS: 1 st PREMISE is the MAJOR. The MIDDLE, SUBJECT and syllogisms are in a SYMMETRICAL SITUATION meaning a LOGICAL EQUALITY, both in comprehension and extension. (SEE APPENDIX: ANNEX 1 - "ARISTO13.XLS"). 2 nd HYPOTHESIS: 1 st PREMISE is the MAJOR. The MIDDLE, SUBJECT and syllogisms are in an ASYMMETRICAL SITUATION, meaning a LOGICAL IMPLICATION, both in comprehension and in extension (SEE APPENDIX: ANNEX 2 - "ARISTO14.XLS"). 337

2 3 rd HYPOTHESIS: 1 st PREMISE is the MINOR. The MIDDLE, SUBJECT and syllogisms are in a REVERSE situation of a LOGICAL IMPLICATION, both in comprehension and in extension (SEE APPENDIX: ANNEX 3 - "ARISTO15.XLS"). 4 th HYPOTHESIS: 1 st PREMISE is the MAJOR. The MIDDLE TERMS form part of a LOGICAL IMPLICATION, both in comprehension and extension; but the SUBJECT and the PREDICATE TERMS are in a SYMMETRICAL SITUATION, meaning a LOGICAL EQUALITY, both in comprehension and extension, for all the four possible FIGURES (special SYLLOGISTIC MOODS) (SEE APPENDIX: ANNEX 4 - "ARISTO18.XLS"). 5 th HYPOTHESIS: 1 st PREMISE is the MINOR. The MIDDLE TERMS form part of a REVERSE LOGICAL IMPLICATION both in comprehension and extension; but the SUBJECT and PREDICATE TERMS are in a SYMMETRICAL SITUATION, meaning a LOGICAL EQUALITY, both in comprehension and extension for all the four possible FIGURES (special SYLLOGISTIC MOODS) (SEE APPENDIX: ANNEX 5 - "ARISTO19.XLS"). Thus, the final confrontation among these 5x64=320 results obtained by Boolean Arithmetic Equations applied to the respective PREMISES and MOODS (or FIGURES) of the ARISTOTELIAN SYLLOGISMS by the numerical detailed calculations of the tables "ARISTO13.XLS" (1 st HYPOTHESIS), "ARISTO14.XLS" (2 nd HYPOTHESIS), "ARISTO15.XLS" (3 rd HYPOTHESIS), "ARISTO18.XLS" (4 th HYPOTHESIS) and "ARISTO19.XLS" (5 th HYPOTHESIS), are in the table named ARISTO16.XLS, annexed in the APPENDIX of this book (see APPENDIX: ANNEX 6). From the table ARISTO16.XLS annexed (See APPENDIX: ANNEX 6), we make the table ARISTO20.XLS (see APPENDIX: ANNEX 7) which has the fifteen valid results and the table ARISTO21.XLS (see APPENDIX: ANNEX 8) which has the forty-five nonvalid results Thus, after undoubtedly proving through Boolean Arithmetic Equations at least by one of that five hypothesis, it shows that there are fifteen syllogisms of the sort desired; all these VALID SOLUTION are in the following TABLE: 338

3 NUMBER SYLLOGISM LATIN MNEMONIC PROVED BY 1/1 <A1 A2 A3> F1 barbara 1 st and 4 th HYPOTHESIS. 6/2 <A1 E2 E3> F2 camestres 1 st HYPOTHESIS 8/3 <A1 E2 E3> F4 camenes 1 st HYPOTHESIS 9/4 <A1 I2 I3> F1 daraptis 1 st and 3 rd HYPOTHESIS 11/5 <A1 I2 I3> F3 datisis 1 st and 4 th HYPOTHESIS. 14/6 <A1 O2 O3> F2 baroko 1 st HYPOTHESIS 17/7 <E1 A2 E3> F1 celarent 1 st, 2 nd and 4 th HYPOTHESIS 18/8 <E1 A2 E3> F2 cesare 1 st, 2 nd and 4 th HYPOTHESIS 25/9 <E1 I2 O3> F1 ferio 1 st and 4 th HYPOTHESIS 26/10 <E1 I2 O3> F2 festino 1 st and 4 th HYPOTHESIS 27/11 <E1 I2 O3> F3 feriso 1 st and 4 th HYPOTHESIS 28/12 <E1 I2 O3> F4 fresison 1 st and 4 th HYPOTHESIS 35/13 <I1 A2 I3> F3 disamis 1 st, 3 rd and 5 th HYPOTHESIS 36/14 <I1 A2 I3> F4 dimaris 1 st HYPOTHESIS 51/15 <O1 A2 O3> F3 bokardo 1 st and 5 th HYPOTHESIS TABLE 24 Using the same words used by Hilbert & Ackermann [05], we can observe the following: However, our method has not yielded all the Aristotelian syllogisms. Rather, the four syllogisms, Darapti, Bamalip 1, Felapton, and Fesapo, are missing from the list just obtained. This discrepancy is due to the fact that the meaning of the universal affirmative statement ( All A is B ), traditional since Aristotle, is not fully consistent with our interpretation of the formula X Y. According to Aristotle the sentence All A is B is valid only when there are objects which are A. Our deviation from Aristotle in this respect is justified by the mathematical applications of logic, in which the Aristotelian interpretation would not be useful. In fact the following TABLE, shows the four results obtained in the page 5 of the table ARISTO20.XLS, which corresponds to the above mentioned by Hilbert: NUMBER SYLLOGISM LATIN MNEMONIC NOT PROVED 3/1 st <A1 A2 i3> F1 darapti (WITHOUT DEMONSTRATION) 4/2 nd <A1 A2 I3> F4 bramantip 2 (WITHOUT DEMONSTRATION) 19/3 rd <E1 A2 O3> F3 felapton (WITHOUT DEMONSTRATION) 20/4 th <E1 A2 O3> F4 fesapo (WITHOUT DEMONSTRATION) TABLE 25 But, there are other five Aristotelian syllogisms, considered as a second solution of the problem, which appear as NOTE in the pages 1 and 2 of the table ARISTO20.XLS whose NOTES we present in the following TABLE: 1 Also bramantip 339

4 SYLLOGISM LATIN MNEMONIC SOLUTION NOTE/(I) <A1 A2 I3> F1 barbari (NOT FOUND) NOTE/(II) <A1 E2 O3> F2 camestrop (NOT FOUND) NOTE/(III) <A1 E2 O3> F4 camenop (NOT FOUND) NOTE/(IV) <E1 A2 O3> F1 celaront (NOT FOUND) NOTE/(v) <E1 A2 O3> F2 cesaro (NOT FOUND) TABLE 26 It is very important to observe that these former nine case (four from TABLE 25 and five from TABLE 26), have always both premises universal (affirmative or negative) and the conclusion is particular (affirmative or negative). In Carney & Scheer [06], we find the following set of six rules as conditions of validity traditionally stated: Rule 1: The middle term must be distributed at least one once. Rule 2: No term undistributed in the premises may be distributed in the conclusion. Rule 3: If both premises are negative (EE, EO, OE, or OO), no conclusion is possible. Rule 4: If one premises is negative, the conclusion must be negative. Rule 5: If neither premise is negative, the conclusion must be affirmative (A or I) Rule 6: If both premises are universal (AA, EA, or AE), the conclusion cannot be particular (I or O). That is: If a syllogism satisfy all these six rules, it is regarded as valid. If it fails to satisfy one or more of these rules, it is invalid. If a rule does not apply, the rule is satisfied. Thus, all these nine referred syllogisms disobey clearly the above Rule 6. But now we have a question of principles: The results obtained is a consequence of the application of the Boolean Arithmetical Equations; for this reason its results serve to prove and justify the truthfulness of these rules, as we can see if one makes a confronting examination with the results of those fifteen VALID SOLUTION of TABLE 24: From the table ARISTO16.XLS annexed, we make the table ARISTO21.XLS which has the results of the forty-five syllogisms where INVALID SOLUTIONS were found. But, it is very important to point out one of this forty-five cases of INVALID SOLUTION mathematically demonstrated, exactly the first of page 1 (NR. 2) of the table ARISTO21.XLS. It corresponds to the syllogistic mood of the FIGURE 2, and has the first and the second premises universal affirmatives, <A1 A2 M3> F2, where the 2 Also bamalip 340

5 CONCLUSION M3 does not exist (neither A3, E3, I3, nor O3) in any of those five hypothesis adopted. Now, we can use practically the same Boole s words [02] concerning to the present essay: The mathematical condition in question, therefore, - the irreducibility of the final equation to the form 0 = 0" (or in ours Boolean Arithmetic, [0000] 2.{2;X 32 X 31 } = 0), adequately represents the logical condition of there being no middle term, or common medium of comparison, in the given premises. I am not aware that the distinction occasioned by the presence or absence of middle term, is the strict sense here understood, has been noticed by logicians before. The distinction, though real and deserving attention, is indeed by no means an obvious one, and it would have been unnoticed in the present instance but for the peculiarity of its mathematical expression. What appears to be novel in the above case is the proof of the existence of combinations of premises in which there is absolutely no medium of comparison. When such a medium of comparison, or true middle term, does exist, the condition that its quantification in both premises together shall exceed the quantification as a single whole, has been ably and clearly shewn by Professor De Morgan to be necessary to lawful inference (Cambridge Memoirs, Vol. VIII. Part 3). And this is undoubtedly the true principle of the Syllogism, viewed from the standing-point of Arithmetic. Indeed, after studying thoroughly the syllogistic system, Lukasiewicz [03] ends his study with the following unforgettable words: With the solution of this problem the main researches on the syllogistic of Aristotle goes through. Only rest a problem, or better, a mysterious point which bide one s explanation: for withhold all the false expressions of the system it is necessary and sufficient to withhold axiomatically only one false expression, that is, the syllogistic mood of the second figure with universal affirmative premises and conclusion particular affirmative. It s not exist any other appropriate expression for such ending. The explanation of this curious logic fact perhaps might to conduct to new discovery in the field of logic. 341

6 Now this is what happened, with the INVALID SOLUTION mathematically demonstrated on page 1 (NR. 2) of the table ARISTO21.XLS referred above, which has, as we have seen, the first and the second universal affirmative premises, <A1 A2 M3> F2, and the CONCLUSION M3 will not be neither A3, E3, I3, nor O3, in any of those five hypothesis adopted. This study is only a mathematical application of the principles of Boolean Arithmetical Equations to the system of Aristotelian Syllogisms. However, it is possible to use this important branch of human knowledge to make a mathematical connection between LOGIC and COMPUTATION. Perhaps, this fundamental knowledge in Boolean Arithmetic might be used as a set-up in software computing, as Boolean Algebra is used presently in the Ultra Very Large Semiconductor Integrated (UVLSI) circuits of the hardware computing. In the APPENDIX of this book, we have the following ANNEXES above mentioned: ANNEX 1 1 st HYPOTHESIS: 1 st PREMISE is the MAJOR. The MIDDLE, SUBJECT and PREDICATE TERMS of the four FIGURES (special SYLLOGISTIC MOODS) of the syllogisms are in a SYMMETRICAL SITUATION meaning a LOGICAL EQUALITY, both in comprehension and extension. ("ARISTO13.XLS"). ANNEX 2 2 n HYPOTHESIS: 1 st PREMISE is the MAJOR. The MIDDLE, SUBJECT and PREDICATE TERMS of the four FIGURES (special SYLLOGISTIC MOODS) of the syllogisms are in an ASYMMETRICAL SITUATION, meaning a LOGICAL IMPLICATION, both in comprehension and extension ( ARISTO14.XLS"). ANNEX 3 3 rd HYPOTHESIS: 1 st PREMISE is the MINOR. The MIDDLE, SUBJECT and syllogisms are in a REVERSE situation of a LOGICAL IMPLICATION, both in comprehension and extension ("ARISTO15.XLS"). ANNEX 4 4 th HYPOTHESIS: 1 st PREMISE is the MAJOR. The MIDDLE TERMS form part of a LOGICAL IMPLICATION, both in comprehension and extension; but the SUBJECT and the PREDICATE TERMS are in a SYMMETRICAL SITUATION, meaning a LOGICAL EQUALITY, both in comprehension and extension, for all the four possible FIGURES (special SYLLOGISTIC MOODS) ("ARISTO18.XLS"). 342

7 ANNEX 5 5 th HYPOTHESIS: 1 st PREMISE is the MINOR. The MIDDLE TERMS form part of a REVERSE LOGICAL IMPLICATION both in comprehension and extension; but the SUBJECT and PREDICATE TERMS are in a SYMMETRICAL SITUATION, meaning a LOGICAL EQUALITY, both in comprehension and extension for all the four possible FIGURES (special SYLLOGISTIC MOODS) ("ARISTO19.XLS"). ANNEX 6 ARISTO16.XLS (16 pages) ANNEX 7 ARISTO20.XLS (5 pages) ANNEX 8 ARISTO21.XLS (12 pages) BIBLIOGRAPHY [01] De Morgan, A. - Formal Logic: or, The Calculus of Inference, Necessary and Probable, London :Taylor and Walton, Booksellers and Publishers to University College, 28, Upper Gover Streey, 1947, p [02] Boole, G. - - The Mathematical Analysis of Logic Being an essay towards a calculus of deductive reasoning, Cambridge: MacMillan, Barklay, & MacMillan; London: George Bell, 1847; Reprinted by Oxford Basil Blackwell, 1965, p.11, 13 and 43. [03] Lukasiewicz, J., Aristotle s Syllogistic from the Stand point of Modern Formal logic, Clarendom Press, Oxford, The tag referred is the free translation to the English of the last paragraph of the Spanish version of La Silogistica de Aristoteles desde el punto de vista de la Logica Formal Moderna, Editorial Tecnos, Madrid, 1977, pp. 69 and 76. [04] Gardner, C. K., 1958, Logic machines and diagrams, McGraw-Hill Book Company, Inc., New York Toronto London, p.33. [05] Hilbert D. & Ackermann, W., Principles of Mathematical Logic, Chelsea Publishing Company, New York, 1950, p. 53. [06] Carney, J. D., & Scheer, R. K., Fundamentals of Logic, The MacMillan Company, New York / Collier-MacMillan Limited, London, 1964, p

Syllogistics = Monotonicity + Symmetry + Existential Import

Syllogistics = Monotonicity + Symmetry + Existential Import Syllogistics = Monotonicity + Symmetry + Existential Import Jan van Eijck July 4, 2005 Abstract Syllogistics reduces to only two rules of inference: monotonicity and symmetry, plus a third if one wants

More information

Core Logic. 1st Semester 2006/2007, period a & b. Dr Benedikt Löwe. Core Logic 2006/07-1ab p. 1/5

Core Logic. 1st Semester 2006/2007, period a & b. Dr Benedikt Löwe. Core Logic 2006/07-1ab p. 1/5 Core Logic 1st Semester 2006/2007, period a & b Dr Benedikt Löwe Core Logic 2006/07-1ab p. 1/5 Aristotle s work on logic. The Organon. Categories On Interpretation Prior Analytics Posterior Analytics Topics

More information

Methodology of Syllogistics.

Methodology of Syllogistics. Methodology of Syllogistics. Start with a list of obviously valid moods (perfect syllogisms = axioms )......and a list of conversion rules, derive all valid moods from the perfect syllogisms by conversions,

More information

Aristotle s Syllogistic

Aristotle s Syllogistic Aristotle s Syllogistic 1. Propositions consist of two terms (a subject and a predicate) and an indicator of quantity/quality: every, no, some, not every. TYPE TAG IDIOMATIC TECHNICAL ABBREVIATION Universal

More information

Review. Logical Issues. Mental Operations. Expressions (External Signs) Mental Products

Review. Logical Issues. Mental Operations. Expressions (External Signs) Mental Products Review Mental Operations Mental Products Expressions (External Signs) Logical Issues Apprehension Idea Term Predicability Judgment Enunciation Proposition Predication Reasoning Argument Syllogism Inference

More information

Equivalence of Syllogisms

Equivalence of Syllogisms Notre Dame Journal of Formal Logic Volume 45, Number 4, 2004 Equivalence of Syllogisms Fred Richman Abstract We consider two categorical syllogisms, valid or invalid, to be equivalent if they can be transformed

More information

From syllogism to common sense: a tour through the logical landscape. Categorical syllogisms

From syllogism to common sense: a tour through the logical landscape. Categorical syllogisms From syllogism to common sense: a tour through the logical landscape Categorical syllogisms Part 2 Mehul Bhatt Oliver Kutz Thomas Schneider 17 November 2011 Thomas Schneider Categorical syllogisms What

More information

ARISTOTLE S PROOFS BY ECTHESIS

ARISTOTLE S PROOFS BY ECTHESIS Ewa Żarnecka Bia ly ARISTOTLE S PROOFS BY ECTHESIS 1. The proofs by ecthesis (εχϑεσιζ translated also as the English exposition and the German Heraushebung) are mentioned in a few fragments of Aristotle

More information

From syllogism to common sense: a tour through the logical landscape Categorical syllogisms

From syllogism to common sense: a tour through the logical landscape Categorical syllogisms From syllogism to common sense: a tour through the logical landscape Categorical syllogisms Mehul Bhatt Oliver Kutz Thomas Schneider 10 November 2011 Thomas Schneider Categorical syllogisms 1 Why are we

More information

An Interpretation of Aristotelian Logic According to George Boole

An Interpretation of Aristotelian Logic According to George Boole An Interpretation of Aristotelian Logic According to George Boole Markos N. Dendrinos Technological Educational Institute of Athens (TEI-A), Department of Library Science and Information Systems, 12210,

More information

Note: To avoid confusion with logical jargon, "nvt" means "not validated as tautologous"

Note: To avoid confusion with logical jargon, nvt means not validated as tautologous Rationale of rendering quantifiers as modal operators 2016 by Colin James III All rights reserved. Definition Axiom Symbol Name Meaning 2-tuple Ordinal 1 p=p T Tautology proof 11 3 2 p@p F Contradiction

More information

arxiv: v6 [math.lo] 7 Jun 2014

arxiv: v6 [math.lo] 7 Jun 2014 Aristotle s Logic Computed by Parametric Probability and Linear Optimization Joseph W. Norman University of Michigan jwnorman@umich.edu June, 2014 arxiv:1306.6406v6 [math.lo] 7 Jun 2014 1 INTRODUCTION

More information

Logical Arithmetic 1: The Syllogism

Logical Arithmetic 1: The Syllogism Logical Arithmetic 1: The Syllogism By Vern Crisler Copyright 1999, 2007, 2011, 2013 1. Introduction 2. Rules of Logical Arithmetic 3. Sample Syllogisms 4. Invalidity 5. Decision Procedure 6. Exercises

More information

Chapter 2: Introduction to Propositional Logic

Chapter 2: Introduction to Propositional Logic Chapter 2: Introduction to Propositional Logic PART ONE: History and Motivation Origins: Stoic school of philosophy (3rd century B.C.), with the most eminent representative was Chryssipus. Modern Origins:

More information

Aristotle s Syllogistic and Core Logic

Aristotle s Syllogistic and Core Logic HISTORY AND PHILOSOPHY OF LOGIC, 00 (Month 200x), 1 27 Aristotle s Syllogistic and Core Logic by Neil Tennant Department of Philosophy The Ohio State University Columbus, Ohio 43210 email tennant.9@osu.edu

More information

Arguments in Ordinary Language Chapter 5: Translating Ordinary Sentences into Logical Statements Chapter 6: Enthymemes... 33

Arguments in Ordinary Language Chapter 5: Translating Ordinary Sentences into Logical Statements Chapter 6: Enthymemes... 33 Table of Contents A Note to the Teacher... v Further tudy of imple yllogisms Chapter 1: Figure in yllogisms... 1 Chapter 2: ood in yllogisms... 5 Chapter 3: Reducing yllogisms to the First Figure... 11

More information

Logical Calculus 1. by Vern Crisler

Logical Calculus 1. by Vern Crisler Logical Calculus 1 by Vern Crisler Copyright 2000; 2005; 2011, 2012 1. Introduction 2. Sommers & the Square of Opposition 3. Syllogisms in Functional Notation 4. Valid Arguments 5. Invalidity 6. Solving

More information

CHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC

CHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC 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,

More information

cse541 LOGIC FOR COMPUTER SCIENCE

cse541 LOGIC FOR COMPUTER SCIENCE cse541 LOGIC FOR COMPUTER SCIENCE Professor Anita Wasilewska Spring 2015 LECTURE 2 Chapter 2 Introduction to Classical Propositional Logic PART 1: Classical Propositional Model Assumptions PART 2: Syntax

More information

Lecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)

Lecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook) Lecture 2 Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits Reading (Epp s textbook) 2.1-2.4 1 Logic Logic is a system based on statements. A statement (or

More information

Precis of Aristotle s Modal Syllogistic

Precis of Aristotle s Modal Syllogistic Philosophy and Phenomenological Research Philosophy and Phenomenological Research Vol. XC No. 3, May 2015 doi: 10.1111/phpr.12185 2015 Philosophy and Phenomenological Research, LLC Precis of Aristotle

More information

A FRAGMENT OF BOOLE S ALGEBRAIC LOGIC SUITABLE FOR TRADITIONAL SYLLOGISTIC LOGIC

A FRAGMENT OF BOOLE S ALGEBRAIC LOGIC SUITABLE FOR TRADITIONAL SYLLOGISTIC LOGIC A FRAGMENT OF BOOLE S ALGEBRAIC LOGIC SUITABLE FOR TRADITIONAL SYLLOGISTIC LOGIC STANLEY BURRIS 1. Introduction Boole introduced his agebraic approach to logic in 1847 in an 82 page monograph, The Mathematical

More information

THE LOGIC OF COMPOUND STATEMENTS

THE LOGIC OF COMPOUND STATEMENTS THE LOGIC OF COMPOUND STATEMENTS All dogs have four legs. All tables have four legs. Therefore, all dogs are tables LOGIC Logic is a science of the necessary laws of thought, without which no employment

More information

Published online: 08 Jan To link to this article:

Published online: 08 Jan To link to this article: This article was downloaded by: [Neil Tennant] On: 11 January 2014, At: 04:29 Publisher: Taylor & Francis Informa Ltd Registered in England and Wales Registered Number: 1072954 Registered office: Mortimer

More information

COMP 2600: Formal Methods for Software Engineeing

COMP 2600: Formal Methods for Software Engineeing COMP 2600: Formal Methods for Software Engineeing Dirk Pattinson Semester 2, 2013 What do we mean by FORMAL? Oxford Dictionary in accordance with convention or etiquette or denoting a style of writing

More information

Ternary Dialectical Informatics

Ternary Dialectical Informatics Ternary Dialectical Informatics Nikolay Petrovich Brusentsov and Julia Sergeevna Vladimirova Moscow State University {ramil,vladimirova}@cs.msu.su Abstract. Modern binary informatics with its so-called

More information

Boole s Algebra of Logic 1847

Boole s Algebra of Logic 1847 Annotated Version of Boole s Algebra of Logic 1847 as presented in his booklet The Mathematical Analysis of Logic Being an Essay Towards a Calculus of Deductive Reasoning by Stanley N Burris Pure Mathematics

More information

8. Reductio ad absurdum

8. Reductio ad absurdum 8. Reductio ad absurdum 8.1 A historical example In his book, The Two New Sciences, 10 Galileo Galilea (1564-1642) gives several arguments meant to demonstrate that there can be no such thing as actual

More information

The Science of Proof: Mathematical Reasoning and Its Limitations. William G. Faris University of Arizona

The Science of Proof: Mathematical Reasoning and Its Limitations. William G. Faris University of Arizona The Science of Proof: Mathematical Reasoning and Its Limitations William G. Faris University of Arizona ii Contents 1 Introduction 1 1.1 Introduction.............................. 1 1.2 Syntax and semantics........................

More information

Proseminar on Semantic Theory Fall 2013 Ling 720 Propositional Logic: Syntax and Natural Deduction 1

Proseminar on Semantic Theory Fall 2013 Ling 720 Propositional Logic: Syntax and Natural Deduction 1 Propositional Logic: Syntax and Natural Deduction 1 The Plot That Will Unfold I want to provide some key historical and intellectual context to the model theoretic approach to natural language semantics,

More information

Chapter 2: The Logic of Compound Statements

Chapter 2: The Logic of Compound Statements Chapter 2: he Logic of Compound Statements irst: Aristotle (Gr. 384-322 BC) Collection of rules for deductive reasoning to be used in every branch of knowledge Next: Gottfried Leibniz (German, 17th century)

More information

A statement is a sentence that is definitely either true or false but not both.

A statement is a sentence that is definitely either true or false but not both. 5 Logic In this part of the course we consider logic. Logic is used in many places in computer science including digital circuit design, relational databases, automata theory and computability, and artificial

More information

1.1 Statements and Compound Statements

1.1 Statements and Compound Statements Chapter 1 Propositional Logic 1.1 Statements and Compound Statements A statement or proposition is an assertion which is either true or false, though you may not know which. That is, a statement is something

More information

A SIMPLE AXIOMATIZATION OF LUKASIEWICZ S MODAL LOGIC

A SIMPLE AXIOMATIZATION OF LUKASIEWICZ S MODAL LOGIC Bulletin of the Section of Logic Volume 41:3/4 (2012), pp. 149 153 Zdzis law Dywan A SIMPLE AXIOMATIZATION OF LUKASIEWICZ S MODAL LOGIC Abstract We will propose a new axiomatization of four-valued Lukasiewicz

More information

Propositional Logic. Spring Propositional Logic Spring / 32

Propositional Logic. Spring Propositional Logic Spring / 32 Propositional Logic Spring 2016 Propositional Logic Spring 2016 1 / 32 Introduction Learning Outcomes for this Presentation Learning Outcomes... At the conclusion of this session, we will Define the elements

More information

Part I: Propositional Calculus

Part I: Propositional Calculus Logic Part I: Propositional Calculus Statements Undefined Terms True, T, #t, 1 False, F, #f, 0 Statement, Proposition Statement/Proposition -- Informal Definition Statement = anything that can meaningfully

More information

Propositional Calculus

Propositional Calculus CHAPTER - 1 Propositional Calculus Introduction Logic means reasoning. One of the important aims of logic is to provide rules through which one can determine the validity of any particular argument. Logic

More information

Boole s Algebra of Logic 1847

Boole s Algebra of Logic 1847 Annotated Version of Boole s Algebra of Logic 1847 as presented in his booklet The Mathematical Analysis of Logic Being an Essay Towards a Calculus of Deductive Reasoning by Stanley N Burris Pure Mathematics

More information

Chapter 1 Elementary Logic

Chapter 1 Elementary Logic 2017-2018 Chapter 1 Elementary Logic The study of logic is the study of the principles and methods used in distinguishing valid arguments from those that are not valid. The aim of this chapter is to help

More information

Propositions and Proofs

Propositions and Proofs Chapter 2 Propositions and Proofs The goal of this chapter is to develop the two principal notions of logic, namely propositions and proofs There is no universal agreement about the proper foundations

More information

Chapter 1, Logic and Proofs (3) 1.6. Rules of Inference

Chapter 1, Logic and Proofs (3) 1.6. Rules of Inference CSI 2350, Discrete Structures Chapter 1, Logic and Proofs (3) Young-Rae Cho Associate Professor Department of Computer Science Baylor University 1.6. Rules of Inference Basic Terminology Axiom: a statement

More information

CHAPTER 11. Introduction to Intuitionistic Logic

CHAPTER 11. Introduction to Intuitionistic Logic CHAPTER 11 Introduction to Intuitionistic Logic Intuitionistic logic has developed as a result of certain philosophical views on the foundation of mathematics, known as intuitionism. Intuitionism was originated

More information

Self-reproducing programs. And Introduction to logic. COS 116, Spring 2012 Adam Finkelstein

Self-reproducing programs. And Introduction to logic. COS 116, Spring 2012 Adam Finkelstein Self-reproducing programs. And Introduction to logic. COS 6, Spring 22 Adam Finkelstein Midterm One week from today in class Mar 5 Covers lectures, labs, homework, readings to date Old midterms will be

More information

ESSLLI 2007 COURSE READER. ESSLLI is the Annual Summer School of FoLLI, The Association for Logic, Language and Information

ESSLLI 2007 COURSE READER. ESSLLI is the Annual Summer School of FoLLI, The Association for Logic, Language and Information ESSLLI 2007 19th European Summer School in Logic, Language and Information August 6-17, 2007 http://www.cs.tcd.ie/esslli2007 Trinity College Dublin Ireland COURSE READER ESSLLI is the Annual Summer School

More information

Ibn Sina s explanation of reductio ad absurdum. Wilfrid Hodges Herons Brook, Sticklepath, Okehampton November 2011

Ibn Sina s explanation of reductio ad absurdum. Wilfrid Hodges Herons Brook, Sticklepath, Okehampton November 2011 1 Ibn Sina s explanation of reductio ad absurdum. Wilfrid Hodges Herons Brook, Sticklepath, Okehampton November 2011 http://wilfridhodges.co.uk 2 WESTERN LOGIC THE BIG NAMES Latin line through Boethius

More information

Propositional Logic. Argument Forms. Ioan Despi. University of New England. July 19, 2013

Propositional Logic. Argument Forms. Ioan Despi. University of New England. July 19, 2013 Propositional Logic Argument Forms Ioan Despi despi@turing.une.edu.au University of New England July 19, 2013 Outline Ioan Despi Discrete Mathematics 2 of 1 Order of Precedence Ioan Despi Discrete Mathematics

More information

3.0. OBJECTIVES 3.1.INTRODUCTION

3.0. OBJECTIVES 3.1.INTRODUCTION 1 UNIT 3 INDIRECT PROOF Contents 1.0 Objectives 3.1.Introduction 3.2.The Meaning of Indirect Proof 3.3.Application of Indirect Proof 3.4.Examples 3.5.Exercises on Indirect Proof 3.6 Indirect Proof and

More information

Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014

Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014 Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014 1. Translate each of the following English sentences into formal statements using the logical operators (,,,,, and ). You may also use mathematical

More information

No Syllogisms for the Numerical Syllogistic

No Syllogisms for the Numerical Syllogistic No Syllogisms for the Numerical Syllogistic Ian Pratt-Hartmann School of Computer Science, University of Manchester, Manchester M13 9PL, UK ipratt@csmanacuk Abstract The numerical syllogistic is the extension

More information

Poincaré s Thesis CONTENTS. Peter Fekete

Poincaré s Thesis CONTENTS. Peter Fekete Poincaré s Thesis CONTENTS Peter Fekete COPYWRITE PETER FEKETE 6 TH OCT. 2011 NO PART OF THIS PAPER MAY BE REPRODUCED OR TRANSMITTED IN ANY FORM OR BY ANY MEANS ELECTRONIC OR MECHANICAL, INCLUDING PHOTOCOPY,

More information

FORMAL PROOFS DONU ARAPURA

FORMAL PROOFS DONU ARAPURA FORMAL PROOFS DONU ARAPURA This is a supplement for M385 on formal proofs in propositional logic. Rather than following the presentation of Rubin, I want to use a slightly different set of rules which

More information

Predicate language is more expressive than propositional language. It is used to express object properties and relations between objects.

Predicate language is more expressive than propositional language. It is used to express object properties and relations between objects. PREDICATE CALCULUS Predicate language is more expressive than propositional language. It is used to express object properties and relations between objects. A relation R on D 1,D 2,...,D n is a subset

More information

A Quick Lesson on Negation

A Quick Lesson on Negation A Quick Lesson on Negation Several of the argument forms we have looked at (modus tollens and disjunctive syllogism, for valid forms; denying the antecedent for invalid) involve a type of statement which

More information

Learning Goals of CS245 Logic and Computation

Learning Goals of CS245 Logic and Computation Learning Goals of CS245 Logic and Computation Alice Gao April 27, 2018 Contents 1 Propositional Logic 2 2 Predicate Logic 4 3 Program Verification 6 4 Undecidability 7 1 1 Propositional Logic Introduction

More information

From Greek philosophers to circuits: An introduction to boolean logic. COS 116, Spring 2011 Sanjeev Arora

From Greek philosophers to circuits: An introduction to boolean logic. COS 116, Spring 2011 Sanjeev Arora From Greek philosophers to circuits: An introduction to boolean logic. COS 116, Spring 2011 Sanjeev Arora Midterm One week from today in class Mar 10 Covers lectures, labs, homework, readings to date You

More information

Discrete Mathematics

Discrete Mathematics Discrete Mathematics Yi Li Software School Fudan University March 13, 2017 Yi Li (Fudan University) Discrete Mathematics March 13, 2017 1 / 1 Review of Lattice Ideal Special Lattice Boolean Algebra Yi

More information

Lecture 11: Measuring the Complexity of Proofs

Lecture 11: Measuring the Complexity of Proofs IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Advanced Course on Computational Complexity Lecture 11: Measuring the Complexity of Proofs David Mix Barrington and Alexis Maciel July

More information

Lecture Notes for MATH Mathematical Logic 1

Lecture Notes for MATH Mathematical Logic 1 Lecture Notes for MATH2040 - Mathematical Logic 1 Michael Rathjen School of Mathematics University of Leeds Autumn 2009 Chapter 0. Introduction Maybe not all areas of human endeavour, but certainly the

More information

Propositional Calculus - Hilbert system H Moonzoo Kim CS Division of EECS Dept. KAIST

Propositional Calculus - Hilbert system H Moonzoo Kim CS Division of EECS Dept. KAIST Propositional Calculus - Hilbert system H Moonzoo Kim CS Division of EECS Dept. KAIST moonzoo@cs.kaist.ac.kr http://pswlab.kaist.ac.kr/courses/cs402-07 1 Review Goal of logic To check whether given a formula

More information

Sample Copy. Not For Distribution.

Sample Copy. Not For Distribution. A Text Book of 'Logic and Sets' (Skill Enhancement Course) CBCS Pattern i Publishing-in-support-of, EDUCREATION PUBLISHING RZ 94, Sector - 6, Dwarka, New Delhi - 110075 Shubham Vihar, Mangla, Bilaspur,

More information

Part Two: The Basic Components of the SOFL Specification Language

Part Two: The Basic Components of the SOFL Specification Language Part Two: The Basic Components of the SOFL Specification Language SOFL logic Module Condition Data Flow Diagrams Process specification Function definition and specification Process decomposition Other

More information

Manual of Logical Style (fresh version 2018)

Manual of Logical Style (fresh version 2018) Manual of Logical Style (fresh version 2018) Randall Holmes 9/5/2018 1 Introduction This is a fresh version of a document I have been working on with my classes at various levels for years. The idea that

More information

Formal Logic. Critical Thinking

Formal Logic. Critical Thinking ormal Logic Critical hinking Recap: ormal Logic If I win the lottery, then I am poor. I win the lottery. Hence, I am poor. his argument has the following abstract structure or form: If P then Q. P. Hence,

More information

Piotr Kulicki The Use of Axiomatic Rejection

Piotr Kulicki The Use of Axiomatic Rejection Piotr Kulicki The Use of Axiomatic Rejection 1. Introduction The central point of logic is an entailment relation, which in different contexts is expressed as an implication in a system, syntactic derivability

More information

Introduction to Metalogic

Introduction to Metalogic Philosophy 135 Spring 2008 Tony Martin Introduction to Metalogic 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: Remarks: (i) sentence letters p 0, p 1, p 2,... (ii)

More information

Logic - recap. So far, we have seen that: Logic is a language which can be used to describe:

Logic - recap. So far, we have seen that: Logic is a language which can be used to describe: Logic - recap So far, we have seen that: Logic is a language which can be used to describe: Statements about the real world The simplest pieces of data in an automatic processing system such as a computer

More information

Resolution (14A) Young W. Lim 8/15/14

Resolution (14A) Young W. Lim 8/15/14 Resolution (14A) Young W. Lim Copyright (c) 2013-2014 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version

More information

Propositional logic (revision) & semantic entailment. p. 1/34

Propositional logic (revision) & semantic entailment. p. 1/34 Propositional logic (revision) & semantic entailment p. 1/34 Reading The background reading for propositional logic is Chapter 1 of Huth/Ryan. (This will cover approximately the first three lectures.)

More information

CSC Discrete Math I, Spring Propositional Logic

CSC Discrete Math I, Spring Propositional Logic CSC 125 - Discrete Math I, Spring 2017 Propositional Logic Propositions A proposition is a declarative sentence that is either true or false Propositional Variables A propositional variable (p, q, r, s,...)

More information

10 LOGIC Introduction. Objectives

10 LOGIC Introduction. Objectives 10 LOGIC Chapter 10 Logic Objectives After studying this chapter you should understand the nature of propositional logic; understand the connectives NOT, OR, AND; understand implication and equivalence;

More information

Logic and Propositional Calculus

Logic and Propositional Calculus CHAPTER 4 Logic and Propositional Calculus 4.1 INTRODUCTION Many algorithms and proofs use logical expressions such as: IF p THEN q or If p 1 AND p 2, THEN q 1 OR q 2 Therefore it is necessary to know

More information

Chapter Summary. Propositional Logic. Predicate Logic. Proofs. The Language of Propositions (1.1) Applications (1.2) Logical Equivalences (1.

Chapter Summary. Propositional Logic. Predicate Logic. Proofs. The Language of Propositions (1.1) Applications (1.2) Logical Equivalences (1. Chapter 1 Chapter Summary Propositional Logic The Language of Propositions (1.1) Applications (1.2) Logical Equivalences (1.3) Predicate Logic The Language of Quantifiers (1.4) Logical Equivalences (1.4)

More information

Logic. Logic is a discipline that studies the principles and methods used in correct reasoning. It includes:

Logic. Logic is a discipline that studies the principles and methods used in correct reasoning. It includes: Logic Logic is a discipline that studies the principles and methods used in correct reasoning It includes: A formal language for expressing statements. An inference mechanism (a collection of rules) to

More information

03 Review of First-Order Logic

03 Review of First-Order Logic CAS 734 Winter 2014 03 Review of First-Order Logic William M. Farmer Department of Computing and Software McMaster University 18 January 2014 What is First-Order Logic? First-order logic is the study of

More information

2. Associative Law: A binary operator * on a set S is said to be associated whenever (A*B)*C = A*(B*C) for all A,B,C S.

2. Associative Law: A binary operator * on a set S is said to be associated whenever (A*B)*C = A*(B*C) for all A,B,C S. BOOLEAN ALGEBRA 2.1 Introduction Binary logic deals with variables that have two discrete values: 1 for TRUE and 0 for FALSE. A simple switching circuit containing active elements such as a diode and transistor

More information

Parry Syllogisms FRED JOHNSON

Parry Syllogisms FRED JOHNSON 414 Notre Dame Journal of Formal Logic Volume 40, Number 3, Summer 1999 Parry Syllogisms FRED JOHNSON Abstract Parry discusses an extension of Aristotle s syllogistic that uses four nontraditional quantifiers.

More information

Informal Statement Calculus

Informal Statement Calculus FOUNDATIONS OF MATHEMATICS Branches of Logic 1. Theory of Computations (i.e. Recursion Theory). 2. Proof Theory. 3. Model Theory. 4. Set Theory. Informal Statement Calculus STATEMENTS AND CONNECTIVES Example

More information

185.A09 Advanced Mathematical Logic

185.A09 Advanced Mathematical Logic 185.A09 Advanced Mathematical Logic www.volny.cz/behounek/logic/teaching/mathlog13 Libor Běhounek, behounek@cs.cas.cz Lecture #1, October 15, 2013 Organizational matters Study materials will be posted

More information

FOUNDATION OF COMPUTER SCIENCE ETCS-203

FOUNDATION OF COMPUTER SCIENCE ETCS-203 ETCS-203 TUTORIAL FILE Computer Science and Engineering Maharaja Agrasen Institute of Technology, PSP Area, Sector 22, Rohini, Delhi 110085 1 Fundamental of Computer Science (FCS) is the study of mathematical

More information

Propositional Equivalence

Propositional Equivalence Propositional Equivalence Tautologies and contradictions A compound proposition that is always true, regardless of the truth values of the individual propositions involved, is called a tautology. Example:

More information

5. Use a truth table to determine whether the two statements are equivalent. Let t be a tautology and c be a contradiction.

5. Use a truth table to determine whether the two statements are equivalent. Let t be a tautology and c be a contradiction. Statements Compounds and Truth Tables. Statements, Negations, Compounds, Conjunctions, Disjunctions, Truth Tables, Logical Equivalence, De Morgan s Law, Tautology, Contradictions, Proofs with Logical Equivalent

More information

Why Learning Logic? Logic. Propositional Logic. Compound Propositions

Why Learning Logic? Logic. Propositional Logic. Compound Propositions Logic Objectives Propositions and compound propositions Negation, conjunction, disjunction, and exclusive or Implication and biconditional Logic equivalence and satisfiability Application of propositional

More information

Logic and Propositional Calculus

Logic and Propositional Calculus CHAPTER 4 Logic and Propositional Calculus 4.1 INTRODUCTION Many algorithms and proofs use logical expressions such as: IF p THEN q or If p 1 AND p 2, THEN q 1 OR q 2 Therefore it is necessary to know

More information

CHAPTER 1. MATHEMATICAL LOGIC 1.1 Fundamentals of Mathematical Logic

CHAPTER 1. MATHEMATICAL LOGIC 1.1 Fundamentals of Mathematical Logic CHAPER 1 MAHEMAICAL LOGIC 1.1 undamentals of Mathematical Logic Logic is commonly known as the science of reasoning. Some of the reasons to study logic are the following: At the hardware level the design

More information

Preprints of the Federated Conference on Computer Science and Information Systems pp

Preprints of the Federated Conference on Computer Science and Information Systems pp Preprints of the Federated Conference on Computer Science and Information Systems pp. 35 40 On (in)validity of Aristotle s Syllogisms Relying on Rough Sets Tamás Kádek University of Debrecen Faculty of

More information

1 The Foundation: Logic and Proofs

1 The Foundation: Logic and Proofs 1 The Foundation: Logic and Proofs 1.1 Propositional Logic Propositions( 명제 ) a declarative sentence that is either true or false, but not both nor neither letters denoting propositions p, q, r, s, T:

More information

8. Reductio ad absurdum

8. Reductio ad absurdum 8. Reductio ad absurdum 8.1 A historical example In his book, The Two New Sciences, Galileo Galilea (1564-1642) gives several arguments meant to demonstrate that there can be no such thing as actual infinities

More information

A syllogistic system for propositions with intermediate quantifiers

A syllogistic system for propositions with intermediate quantifiers A syllogistic system for propositions with intermediate quantifiers Pasquale Iero 1, Allan Third 2, and Paul Piwek 1 1 School of Computing and Communications, The Open University, UK 2 Knowledge Media

More information

HANDOUT AND SET THEORY. Ariyadi Wijaya

HANDOUT AND SET THEORY. Ariyadi Wijaya HANDOUT LOGIC AND SET THEORY Ariyadi Wijaya Mathematics Education Department Faculty of Mathematics and Natural Science Yogyakarta State University 2009 1 Mathematics Education Department Faculty of Mathematics

More information

4 Derivations in the Propositional Calculus

4 Derivations in the Propositional Calculus 4 Derivations in the Propositional Calculus 1. Arguments Expressed in the Propositional Calculus We have seen that we can symbolize a wide variety of statement forms using formulas of the propositional

More information

Announcements CompSci 102 Discrete Math for Computer Science

Announcements CompSci 102 Discrete Math for Computer Science Announcements CompSci 102 Discrete Math for Computer Science Read for next time Chap. 1.4-1.6 Recitation 1 is tomorrow Homework will be posted by Friday January 19, 2012 Today more logic Prof. Rodger Most

More information

A Strong Relevant Logic Model of Epistemic Processes in Scientific Discovery

A Strong Relevant Logic Model of Epistemic Processes in Scientific Discovery A Strong Relevant Logic Model of Epistemic Processes in Scientific Discovery (Extended Abstract) Jingde Cheng Department of Computer Science and Communication Engineering Kyushu University, 6-10-1 Hakozaki,

More information

III SEMESTER CORE COURSE

III SEMESTER CORE COURSE BA PHILOSOPHY PROGRAMME III SEMESTER CORE COURSE SYMBOLIC LOGIC AND INFORMATICS ( 2014 Admission onwards) (CU-CBCSS) UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION Calicut university P.O, Malappuram

More information

The statement calculus and logic

The statement calculus and logic Chapter 2 Contrariwise, continued Tweedledee, if it was so, it might be; and if it were so, it would be; but as it isn t, it ain t. That s logic. Lewis Carroll You will have encountered several languages

More information

On Axiomatic Rejection for the Description Logic ALC

On Axiomatic Rejection for the Description Logic ALC On Axiomatic Rejection for the Description Logic ALC Hans Tompits Vienna University of Technology Institute of Information Systems Knowledge-Based Systems Group Joint work with Gerald Berger Context The

More information

Dynamic Semantics. Dynamic Semantics. Operational Semantics Axiomatic Semantics Denotational Semantic. Operational Semantics

Dynamic Semantics. Dynamic Semantics. Operational Semantics Axiomatic Semantics Denotational Semantic. Operational Semantics Dynamic Semantics Operational Semantics Denotational Semantic Dynamic Semantics Operational Semantics Operational Semantics Describe meaning by executing program on machine Machine can be actual or simulated

More information

First Order Logic (1A) Young W. Lim 11/18/13

First Order Logic (1A) Young W. Lim 11/18/13 Copyright (c) 2013. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software

More information

Recall that the expression x > 3 is not a proposition. Why?

Recall that the expression x > 3 is not a proposition. Why? Predicates and Quantifiers Predicates and Quantifiers 1 Recall that the expression x > 3 is not a proposition. Why? Notation: We will use the propositional function notation to denote the expression "

More information

Logic, Sets, and Proofs

Logic, Sets, and Proofs Logic, Sets, and Proofs David A. Cox and Catherine C. McGeoch Amherst College 1 Logic Logical Operators. A logical statement is a mathematical statement that can be assigned a value either true or false.

More information

Mat 243 Exam 1 Review

Mat 243 Exam 1 Review OBJECTIVES (Review problems: on next page) 1.1 Distinguish between propositions and non-propositions. Know the truth tables (i.e., the definitions) of the logical operators,,,, and Write truth tables for

More information