Theory of (categorical) syllogisms (A4-6 about the three „figures”) Three terms: A, B, C Suppose that relation a holds between B and C and a or e holds.

Slides:



Advertisements
Similar presentations
Artificial Intelligence
Advertisements

Four Rules of Aristotelian Logic 1. Rule of Identity: A is A 2. Rule of Non-Contradiction: A is not (-A) 3. Rule of Excluded Middle: Either A or (-A)
An overview Lecture prepared for MODULE-13 (Western Logic) BY- MINAKSHI PRAMANICK Guest Lecturer, Dept. Of Philosophy.
Chapter 3 Elementary Number Theory and Methods of Proof.
The assertoric syllogism Paul Thom. The first figure a a a Barbara e e Celarent i i Darii Ferio o A B C.
Justification-based TMSs (JTMS) JTMS utilizes 3 types of nodes, where each node is associated with an assertion: 1.Premises. Their justifications (provided.
Inference and Reasoning. Basic Idea Given a set of statements, does a new statement logically follow from this. For example If an animal has wings and.
Logic. To Think Clearly Use reason, instead of relying on instinct alone What is Logic? – “the art of reasoning” – The study of truth – The ethics of.
Deduction: the categorical syllogism - 1 Logic: evaluating deductive arguments - the syllogism 4 A 5th pattern of deductive argument –the categorical syllogism.
Today’s Topics Introduction to Predicate Logic Venn Diagrams Categorical Syllogisms Venn Diagram tests for validity Rule tests for validity.
Aristotle 384 BC – 322 BC. Aristotle e.com/watch?v=tbg HbzrL3d0.
CSE (c) S. Tanimoto, 2008 Propositional Logic
Logic and Proof. Argument An argument is a sequence of statements. All statements but the first one are called assumptions or hypothesis. The final statement.
Deduction CIS308 Dr Harry Erwin. Syllogism A syllogism consists of three parts: the major premise, the minor premise, and the conclusion. In Aristotle,
So far we have learned about:
From Chapter 4 Formal Specification using Z David Lightfoot
Proof by Deduction. Deductions and Formal Proofs A deduction is a sequence of logic statements, each of which is known or assumed to be true A formal.
Introduction to Proofs ch. 1.6, pg. 87,93 Muhammad Arief download dari
EE1J2 – Discrete Maths Lecture 5 Analysis of arguments (continued) More example proofs Formalisation of arguments in natural language Proof by contradiction.
Deductive reasoning.
Circular Geometry Robust Constructions Proofs Chapter 4.
Categorical Syllogisms
Copyright © Curt Hill Rules of Inference What is a valid argument?
The physical reductive explainability of phenomenal consciousness and the logical impossibility of zombies Marco Giunti University of Cagliari (Italy)
MATH 224 – Discrete Mathematics
Copyright © Cengage Learning. All rights reserved. CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF ELEMENTARY NUMBER THEORY AND METHODS OF PROOF.
Logic A: Capital punishment is immoral. B: No it isn’t! A: Yes it is! B: Well, what do you know about it? A: I know more about it then you do! B: Oh yeah?
Logical Reasoning:Proof Prove the theorem using the basic axioms of algebra.
LOGICAL REASONING FOR CAT 2009.
Natural Deduction System for First Order Logic Student: Wei Lei Instructor: W. M. Farmer Department of Computing and Software McMaster University, Hamilton,
CATEGORICAL SYLLOGISMS
1 Introduction to Abstract Mathematics Chapter 2: The Logic of Quantified Statements. Predicate Calculus Instructor: Hayk Melikya 2.3.
CS6133 Software Specification and Verification
Fall 2008/2009 I. Arwa Linjawi & I. Asma’a Ashenkity 11 The Foundations: Logic and Proofs Introduction to Proofs.
Artificial Intelligence “Introduction to Formal Logic” Jennifer J. Burg Department of Mathematics and Computer Science.
Method of proofs.  Consider the statements: “Humans have two eyes”  It implies the “universal quantification”  If a is a Human then a has two eyes.
Chapter 7. Propositional and Predicate Logic Fall 2013 Comp3710 Artificial Intelligence Computing Science Thompson Rivers University.
CS104:Discrete Structures Chapter 2: Proof Techniques.
Chapter 14: Categorical Syllogisms. Elements of a Categorical Syllogism (pp ) Categorical syllogisms are deductive arguments. Categorical syllogisms.
CT214 – Logical Foundations of Computing Darren Doherty Rm. 311 Dept. of Information Technology NUI Galway
Discrete Mathematical Structures: Theory and Applications 1 Logic: Learning Objectives  Learn about statements (propositions)  Learn how to use logical.
1 Section 7.1 First-Order Predicate Calculus Predicate calculus studies the internal structure of sentences where subjects are applied to predicates existentially.
Beyond syllogisms of the three figures Aristotle (sometimes): every valid inference can be reduced to the „figures” A different claim : Assumption: If.
What is the theory of categories (predicable „things”)? Is it a logical theory? From the historical point of view: it was. Predicable things have some.
CS344 : Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 4- Logic.
Chapter 1 Logic and proofs
Aristotelian Logic.
Indirect Argument: Contradiction and Contraposition
Richard Dedekind ( ) The grandfather of mathematical structuralism
Chapter 7. Propositional and Predicate Logic
Deductive Logic, Categorical Syllogism
5 Categorical Syllogisms
Today’s Topics Introduction to Predicate Logic Venn Diagrams
Theme № 14. Conclusion The plan: 1. Essence of conclusion.
5.1 Standard Form, Mood, and Figure
The Prior Analytics theory of propositions
Chapter 10: Mathematical proofs
7.1 Rules of Implication I Natural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic.
Midterm Discussion.
Reasoning with the Propositional Calculus
Reasoning with the Propositional Calculus
Chapter 7. Propositional and Predicate Logic
Reason and Argument Chapter 7 (2/2).
September 9, 2004 Prof. Marie desJardins (for Prof. Matt Gaston)
Copyright © Cengage Learning. All rights reserved.
Reasoning with the Propositional Calculus
Reasoning with the Propositional Calculus
Chapter 5 Parallel Lines and Related Figures
Properties of Relational Logic
Critical Thinking Lecture 11 The Syllogism
Presentation transcript:

Theory of (categorical) syllogisms (A4-6 about the three „figures”) Three terms: A, B, C Suppose that relation a holds between B and C and a or e holds between A and B. Then there is a perfect syllogism about A and C, namely: By reference to the semantical definition. Medieval mnemonic names: Barbara, Celarent. Vowels refer to the forms of major, minor and conclusion. B, C: the first resp. second syllogism of the first figure. The third is called Darii, the fourth Ferio. They are called complete and have semantic justification again. But what is a figure?

How to reconstruct Aristotle’s combinatorics? How to characterise the figures (schémata)? Why do we have three (and not four) figures? We have three terms and two premises. One of the terms occurs in both propositions, it is called middle (medius, meson). The two others are called extremes, one of them is the major (meidzon), the other is the minor (elatton). The setting of major and minor is different in the different figures. Both premises express some of the four (a, e, i, o) relation. We are seeking for a proposition of the same form that expresses a relation between the two extremes. Premises are called major resp. minor after the extreme term included. In „this” (later: first) figure the major term is the predicate of the major premise and the minor is subject.

In the syllogisms stated in ch. 4-6 always the major is the predicate and the minor is the subject of the conclusion. If we take it as a general rule, we have four possibilities: The major is predicate and the minor is subject in the respective premise(first figure) The middle is predicated about both extremes (second figure) Both extremes are predicated about the middle (third figure) The major is subject and the minor is predicate of its premise (fourth figure, missing at Aristotle) But he does mention all the syllogisms belonging to the fourth figure as derivative syllogisms of the first figure! E.g. Calemes: Every A is B, No B is C, therefore no C is A. By Celarent (and change of the order of premises), we can conclude to „No A is C”, and by e-conversion, we can get Calemes. In this (traditional) reading A is the major, C is the minor term. A more Aristotelian reading: We have a pair of premises according to the second syllogism of the first figure (i.e., Celarent) with C as the major, A as the minor term and by conversion, we get the conclusion.

Alternative reading: The classification into figures belongs to pairs of premises, irrespective to the conclusion and the order of the premises. Either the middle term is subject in the one and predicate in the other premise, or predicate both times, or subject both times. We should decide which one is the major and which is the minor afterwards. The setting of the major and the minor term refers to some diagram. „this is also middle in position” Aristotle asks first how the major relates to the minor. But we could ask (with him) how the minor relates to the major. In the second and the third figure, we get the answer simply by changing the order of the premises. Or – what is virtually the same – by changing the role of the major and the minor term. E.g. Cesare and Camestres of the second figure. In the first figure, we need some conversion in addition.

In each figure, we have 4*4= 16 pairs of premises. If a pair does not give a syllogism, Aristotle proves this fact by pairs of opposite. examples. I. e., „Every B is A” and „No C is B” gives no conclusion, because it can happen both that every C is an A and that no C is an A – every horse is an animal but no stone is an animal.

Apparent reference to a diagram again. Potential: dunatos

Cesare and Camestres reduced to Celarent by repeated e-conversion and tacit change of order. Not complete because a deduction was needed.

Proof by reduction to impossibility (agein eis to adunaton): easy to reconstruct. Camestres: „Every N is M but no X is M, therefore no X is N” Let us suppose that some X is N (indirect hypothesis). Then some N is X (i-conversion). The second premise and this give that some N is not M (Ferio). Contradiction with the first premise. The other two syllogisms are proved by impossibility (only)

Third method of proof: ekthesis (exemplification, „setting-out”) Third figure, P is the major, R the minor and S the middle. …

A7: theory of reduction Darii is proved by reduction to impossibility, using Camestres. Camestres was reduced to Celarent, therefore no circularity there. (Ferio on a similar way.) Therefore, all syllogisms are reduced to Barbara and Celarent.

Modern reconstructions: Łukasiewicz 1951: Frege-Hilbert style calculus with four (not Aristotelian) axioms. Presupposes propositional logic as backgroud theory Objection: not a theory of consequence but a theory of the four relation within the frames of 0-order logic. The notion of consequence comes from there. Corcoran, 70es (several papers) : system of natural deduction. Starting schemes and transformation rules are the Aristotelian ones (i.e. Barbara, Celarent resp. conversion rules and rule of indirect proof).