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

Similar documents
Methodology of Syllogistics.

Aristotle s Syllogistic

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

Syllogistics = Monotonicity + Symmetry + Existential Import

10.4 THE BOOLEAN ARITHMETICAL RESULTS

Equivalence of Syllogisms

arxiv: v6 [math.lo] 7 Jun 2014

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

An Interpretation of Aristotelian Logic According to George Boole

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

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

ARISTOTLE S PROOFS BY ECTHESIS

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

Precis of Aristotle s Modal Syllogistic

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

Aristotle s Syllogistic and Core Logic

Logical Arithmetic 1: The Syllogism

Aristotle on Circular Proof

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

Logical Calculus 1. by Vern Crisler

THE LOGIC OF COMPOUND STATEMENTS

Published online: 08 Jan To link to this article:

Proof by Assumption of the Possible in Prior Analytics 1.15

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

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

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

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

Propositional Logic. Jason Filippou UMCP. ason Filippou UMCP) Propositional Logic / 38

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

Logic (3A) Young W. Lim 11/2/13

Traditional Logic. CS 3234: Logic and Formal Systems. Martin Henz and Aquinas Hobor. August 19, Generated on Monday 23 August, 2010, 14:10

Logic (3A) Young W. Lim 10/31/13

Logic (3A) Young W. Lim 10/29/13

The Logic of Compound Statements cont.

Formal (natural) deduction in propositional logic

Validity, the Squeezing Argument and Alternative Semantic Systems: the Case of Aristotelian Syllogistic

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

(ÀB Ä (A Â C)) (A Ä ÀC) Á B. This is our sample argument. Formal Proofs

Propositional Logic. Chrysippos (3 rd Head of Stoic Academy). Main early logician. AKA Modern Logic AKA Symbolic Logic. AKA Boolean Logic.

(Refer Slide Time: 02:20)

A diagrammatic calculus of syllogisms

A Survey of Inductive Generalization

Aristotle Metaphysics. Aristotle Metaphysics

AN INTRODUCTION TO SEPARATION LOGIC. 2. Assertions

The Logic and Metaphysics of Leibniz

Symbolic Logic 3. For an inference to be deductively valid it is impossible for the conclusion to be false if the premises are true.

8. Reductio ad absurdum

TABLEAU SYSTEM FOR LOGIC OF CATEGORIAL PROPOSITIONS AND DECIDABILITY

cis32-ai lecture # 18 mon-3-apr-2006

Propositional Calculus

Logical Form 5 Famous Valid Forms. Today s Lecture 1/26/10

COSE212: Programming Languages. Lecture 1 Inductive Definitions (1)

Proposition logic and argument. CISC2100, Spring 2017 X.Zhang

Where are my glasses?

Discrete Mathematics

Chapter 1 Elementary Logic

A Critical Examination of Ibn-Sina s Theory of the Conditional Syllogism

Chapter 11: Automated Proof Systems

Formal Logic. Critical Thinking

Logical Structures in Natural Language: First order Logic (FoL)

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

Piotr Kulicki The Use of Axiomatic Rejection

INTRODUCTION TO LOGIC. Propositional Logic. Examples of syntactic claims

What is logic, the topic of this course? There are at least two answers to that question.

CHAPTER 10. Gentzen Style Proof Systems for Classical Logic

INTRODUCTION TO LOGIC 1 Sets, Relations, and Arguments. Why logic? Arguments

The propositional and relational syllogistic

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

n logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional)

Higher Quantity Syllogisms

Class 29 - November 3 Semantics for Predicate Logic

Propositional Language - Semantics

A Quick Lesson on Negation

Logic for Liberal Arts Students. Part 3. The Logic of Arguments

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

Syllogistic Logic and its Extensions

The Importance of Being Formal. Martin Henz. February 5, Propositional Logic

PHI Searle against Turing 1

Citation for published version (APA): van Rooij, R. (2012). The propositional and relational syllogistic. Logique et Analyse, 55(217),

THE LOGIC OF ESSENTIALISM

Propositional Logic Review

COMP 2600: Formal Methods for Software Engineeing

THE LOGIC OF COMPOUND STATEMENTS

Lecture 4: Proposition, Connectives and Truth Tables

Propositional Logic: Methods of Proof (Part II)

Formal Logic Lecture 11

Predicate Calculus. Lila Kari. University of Waterloo. Predicate Calculus CS245, Logic and Computation 1 / 59

Aristotle, Boole, and Chu Duality since 350 BC

a. ~p : if p is T, then ~p is F, and vice versa

First-Order Logic. Peter Antal

On Axiomatic Rejection for the Description Logic ALC

Aristotle, Boole, and Categories

Logic Overview, I. and T T T T F F F T F F F F

A SIMPLE AXIOMATIZATION OF LUKASIEWICZ S MODAL LOGIC

COSE212: Programming Languages. Lecture 1 Inductive Definitions (1)

HANDOUT AND SET THEORY. Ariyadi Wijaya

3/29/2017. Logic. Propositions and logical operations. Main concepts: propositions truth values propositional variables logical operations

Notes on Inference and Deduction

Logic Background (1A) Young W. Lim 12/14/15

Logics - Introduction

Transcription:

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 On Sophistical Refutations (De Sophisticis Elenchis) Core Logic 2006/07-1ab p. 2/5

The Categories. Aristotle, Categories: The ten categories (1b25). Substance Quality Quantity Relation Where The two ways of predication. When Position Having Action Passion essential predication: Socrates is a human being ; human IS SAID OF Socrates Grice: IZZing accidental predication: Socrates is wise ; wisdom IS IN Socrates Grice: HAZZing Core Logic 2006/07-1ab p. 3/5

Essential predication. essential : You cannot deny the predicate without changing the meaning of the subject. animal IS SAID OF human. human IS SAID OF Socrates. IS SAID OF is a transitive relation. Related to the category tree: Genus. Species. Human. Animal. Dog. Individual. Socrates. Aristotle. Lassie. Boomer. Core Logic 2006/07-1ab p. 4/5

Substances. Universal substances human, animal Particular substances Socrates, Aristotle Universal accidents wisdom Particular accidents Plato ( ). The universal substances are the (only) real things. Aristotle ( ). Without the particular substances, nothing would exist. Core Logic 2006/07-1ab p. 5/5

Matter & Form. Categories / De anima: There are three kinds of substance: matter, form and the compound of the two. Matter is potentiality; form is actuality. Aristotle in the Metaphysics: Primary substances cannot be compounds, not even of matter and form. Matter cannot be primary, therefore, the primary substance is the form. Metaphysics Z (1037a6): it is also clear that the soul is the primary substance, the body is matter, and man or animal is composed of the two as universal. The intricate connection between the analysis of predication (philosophy of language, semantics, logic) and the analysis of the soul will become important in the medieval context. Core Logic 2006/07-1ab p. 6/5

The most famous syllogism. Every man is mortal. Socrates is a man. Socrates is mortal. Proper name / Particular substance Core Logic 2006/07-1ab p. 7/5

A more typical syllogism. Every animal is mortal. Every man is an animal. Every man is mortal. Every B is an A. Every C is a B. a valid mood mood = modus Every C is an A. Barbara Core Logic 2006/07-1ab p. 8/5

Another valid mood. Every philosopher is mortal. Some teacher is a philosopher. Some teacher is mortal. Every B is an A. Some C is a B. Some C is an A. Darii Core Logic 2006/07-1ab p. 9/5

A similar but invalid mood. Darii Every B is an A. Some C is a B. Some C is an A. Every A is a B. Some C is a B. Some C is an A. Every philosopher is mortal. Some nonphilosopher is mortal. Some nonphilosopher is a philosopher. Core Logic 2006/07-1ab p. 10/5

Yet another very similar mood. Darii Every B is an A. Some C is a B. The invalid mood Every A is a B. Some C is a B. Datisi Every B is a A. Some B is a C. Some C is an A. Some C is an A. Some C is an A. Some C is a B and Some B is a C are intuitively equivalent. Every B is an A and Every A is a B aren t. Core Logic 2006/07-1ab p. 11/5

A first conversion rule. This yields a simple formal (syntactical) conversion rule: Some X is a Y can be converted to Some Y is an X. This rule is validity-preserving and syntactical. Core Logic 2006/07-1ab p. 12/5

Back to Darii and Datisi. Darii Dati si Every B is an A. Some C is a B. Some C is an A. Every B is a A. Some B is a C. Some C is an A. Simple Conversion Some X is a Y Some Y is an X Core Logic 2006/07-1ab p. 13/5

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, and find counterexamples for all other moods. Core Logic 2006/07-1ab p. 14/5

Notation (1). Syllogistics is a term logic, not propositional or predicate logic. We use capital letters A, B, and C for terms, and sometimes X and Y for variables for terms. Terms (termini) form part of a categorical proposition. Each categorical proposition has two terms: a subject and a predicate, connected by a copula. Every B is an A. Core Logic 2006/07-1ab p. 15/5

Notation (2). There are four copulae: The universal affirmative: Every is a. The universal negative: No is a. The particular affirmative: Some is a. The particular negative: Some is not a. a e i o Every B is an A. AaB No B is an A. AeB Some B is an A. AiB Some B is not an A. AoB Contradictories: a o & e i. Core Logic 2006/07-1ab p. 16/5

Notation (3). Every B is an A Aa B Barbara Every C is a B Ba C Every C is an A Aa C Each syllogism contains three terms and three categorial propositions. Each of its categorial propositions contains two of its terms. Two of the categorial propositions are premises, the other is the conclusion. The term which is the predicate in the conclusion, is called the major term, the subject of the conclusion is called the minor term, the term that doesn t occur in the conclusion is called the middle term. Core Logic 2006/07-1ab p. 17/5

Notation (4). Every B is an A A a B Barbara Every C is a B B a C Every C is an A A a C Major term / Minor term / Middle term Only one of the premises contains the major term. This one is called the major premise, the other one the minor premise. Ist Figure A B, B C : A C IIIrd Figure A B, C B : A C IInd Figure B A, B C : A C IVth Figure B A, C B : A C Core Logic 2006/07-1ab p. 18/5

Notation (5). If you take a figure, and insert three copulae, you get a mood. Ist Figure: A a B, B a C : A a C Barbara Core Logic 2006/07-1ab p. 19/5

Combinatorics of moods. With four copulae and three slots, we get 4 3 = 64 moods from each figure, i.e., 4 64 = 256 in total. Of these, 24 have been traditionally seen as valid. A a B, B i C : A i C D a r i i Darii A a B, C i B : A i C D a t i s i Datisi Core Logic 2006/07-1ab p. 20/5

The 24 valid moods (1). Ist figure AaB, BaC : AaC Barbara AeB, BaC : AeC Celarent AaB, BiC : AiC Darii AeB, BiC : AoC Ferio AaB, BaC : AiC Barbari AeB, BaC : AoC Celaront IInd figure BeA, BaC : AeC Cesare BaA, BeC : AeC Camestres BeA, BiC : AoC Festino BaA, BoC : AoC Baroco BeA, BaC : AoC Cesaro BaA, BeC : AoC Camestrop Core Logic 2006/07-1ab p. 21/5

The 24 valid moods (2). IIIrd figure AaB, CaB : AiC Darapti AiB, CaB : AiC Disamis AaB, CiB : AiC Datisi AeB, CaB : AoC Felapton AoB, CaB : AoC Bocardo AeB, CiB : AoC Ferison IVth figure BaA, CaB : AiC Bramantip BaA, CeB : AeC Camenes BiA, CaB : AiC Dimaris BeA, CaB : AoC Fesapo BeA, CiB : AoC Fresison BaA, CeB : AoC Camenop Core Logic 2006/07-1ab p. 22/5

Reminder. In syllogistics, all terms are nonempty. Barbari. AaB, BaC: AiC. Every unicorn is a white horse. Every white horse is white. Some unicorn is white. In particular, this white unicorn exists. Core Logic 2006/07-1ab p. 23/5

The perfect moods. Aristotle discusses the first figure in Analytica Priora I.iv, identifies Barbara, Celarent, Darii and Ferio as perfect and then concludes Core Logic 2006/07-1ab p. 24/5

Axioms of Syllogistics. So the Axioms of Syllogistics according to Aristotle are: Barbara. AaB, BaC : AaC Celarent. AeB, BaC: AeC Darii. AaB, BiC : AiC Ferio. AeB, BiC: AoC Core Logic 2006/07-1ab p. 25/5

Simple and accidental conversion. Simple (simpliciter). XiY Y ix. XeY Y ex. Accidental (per accidens). XaY XiY. XeY XoY. Core Logic 2006/07-1ab p. 26/5

Syllogistic proofs (1). We use the letters t ij for terms and the letters k i stand for copulae. We write a mood in the form for example, t 11 k 1 t 12 t 21 k 2 t 22 t 31 k 3 t 32, AaB BaC AaC for Barbara. We write M i for t i1 k i t i2 and define some operations on moods. Core Logic 2006/07-1ab p. 27/5

Syllogistic proofs (2). For i {1, 2, 3}, the operation s i can only be applied if k i is either i or e. In that case, s i interchanges t i1 and t i2. For i {1, 2}, let p i be the operation that changes k i to its subaltern (if it has one), while p 3 is the operation that changes k 3 to its superaltern (if it has one). Let m be the operation that exchanges M 1 and M 2. For i {1, 2}, let c i be the operation that first changes k i and k 3 to their contradictories and then exchanges M i and M 3. Let per π be the permutation π of the letters A, B, and C, applied to the mood. per BaA AaB AaC BaC BaC AaC Core Logic 2006/07-1ab p. 28/5

Syllogistic proofs (3). Given any set B of basic moods, a B-proof of a mood M = M 1, M 2 :M 3 is a sequence o 1,..., o n of operations such that Only o 1 can be of the form c 1 or c 2 (but doesn t have to be). The sequence of operations, if applied to M, yields an element of B. Core Logic 2006/07-1ab p. 29/5

Syllogistic proofs (4). s 1, m, s 3, per AC is a proof of Disamis (from Darii) : s 1 AiB BiA m CaB CaB per AaB CaB CaB BiA BiA BiC s 3 AiC AiC AiC CiA AiC s 2 is a proof of Datisi (from Darii) : AaB CiB AiC s 2 AaB BiC AiC Core Logic 2006/07-1ab p. 30/5

Syllogistic proofs (5). c 1, per BC is a proof of Bocardo by contradiction (from Barbara) : AoB CaB AoC per AaC AaB c 1 CaB BaC AaB AaC Core Logic 2006/07-1ab p. 31/5

Syllogistic proofs (6). Let B be a set of moods and M be a mood. We write B M if there is B-proof of M. Core Logic 2006/07-1ab p. 32/5

Mnemonics (1). Bárbara, Célarént, Darií, Ferióque prióris, Césare, Cámestrés, Festíno, Baróco secúndae. Tértia Dáraptí, Disámis, Datísi, Felápton, Bocárdo, Feríson habét. Quárta ínsuper áddit Brámantíp, Camenés, Dimáris, Fesápo, Fresíson. These words are more full of meaning than any that were ever made. (Augustus de Morgan) Core Logic 2006/07-1ab p. 33/5

Mnemonics (2). The first letter indicates to which one of the four perfect moods the mood is to be reduced: B to Barbara, C to Celarent, D to Darii, and F to Ferio. The letter s after the ith vowel indicates that the corresponding proposition has to be simply converted, i.e., a use of s i. The letter p after the ith vowel indicates that the corresponding proposition has to be accidentally converted ( per accidens ), i.e., a use of p i. The letter c after the first or second vowel indicates that the mood has to be proved indirectly by proving the contradictory of the corresponding premiss, i.e., a use of c i. The letter m indicates that the premises have to be interchanged ( moved ), i.e., a use of m. All other letters have only aesthetic purposes. Core Logic 2006/07-1ab p. 34/5

A metatheorem. We call a proposition negative if it has either e or o as copula. Theorem (Aristotle). If M is a mood with two negative premises, then B BCDF M. Core Logic 2006/07-1ab p. 35/5

Metaproof (1). Suppose o := o 1,..., o n is a B BCDF -proof of M. The s-rules don t change the copula, so if M has two negative premises, then so does s i (M). The superaltern of a negative proposition is negative and the superaltern of a positive proposition is positive. Therefore, if M has two negative premises, then so does p i (M). The m-rule and the per-rules don t change the copula either, so if M has two negative premises, then so do m(m) and per π (M). As a consequence, if o 1 c i, then o(m) has two negative premisses.we check that none of Barbara, Celarent, Darii and Ferio has two negative premisses, and are done, as o cannot be a proof of M. Core Logic 2006/07-1ab p. 36/5

Metaproof (2). So, o 1 = c i for either i = 1 or i = 2. By definition of c i, this means that the contradictory of one of the premisses is the conclusion of o 1 (M). Since the premisses were negative, the conclusion of o 1 (M) is positive. Since the other premiss of M is untouched by o 1, we have that o 1 (M) has at least one negative premiss and a positive conclusion. The rest of the proof o 2,..., o n may not contain any instances of c i. Note that none of the rules s, p, m and per change the copula of the conclusion from positive to negative. So, o(m) still has at least one negative premiss and a positive conclusion. Checking Barbara, Celarent, Darii and Ferio again, we notice that none of them is of that form. Therefore, o is not a B BCDF -proof of M. Contradiction. q.e.d. Core Logic 2006/07-1ab p. 37/5

Other metatheoretical results. If M has two particular premises (i.e., with copulae i or o ), then BCDF M (Exercise 10). If M has a positive conclusion and one negative premiss, then BCDF M. If M has a negative conclusion and one positive premiss, then BCDF M. If M has a universal conclusion (i.e., with copula a or e ) and one particular premiss, then BCDF M. Core Logic 2006/07-1ab p. 38/5