The Prior Analytics theory of propositions

Slides:



Advertisements
Similar presentations
Geometry Chapter 2 Terms.
Advertisements

Formal Criteria for Evaluating Arguments
With examples from Number Theory
Discrete Math Methods of proof 1.
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.
Review of Probability.
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 Concepts Lecture Module 11.
(CSC 102) Discrete Structures Lecture 14.
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.
22C:19 Discrete Structures Logic and Proof Spring 2014 Sukumar Ghosh.
Formal Logic Proof Methods Direct Proof / Natural Deduction Conditional Proof (Implication Introduction) Reductio ad Absurdum Resolution Refutation.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
CSE115/ENGR160 Discrete Mathematics 01/31/12 Ming-Hsuan Yang UC Merced 1.
CSE115/ENGR160 Discrete Mathematics 02/01/11
So far we have learned about:
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.
C OURSE : D ISCRETE STRUCTURE CODE : ICS 252 Lecturer: Shamiel Hashim 1 lecturer:Shamiel Hashim second semester Prepared by: amani Omer.
Methods of Proof & Proof Strategies
CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.
A Brief Summary for Exam 1 Subject Topics Propositional Logic (sections 1.1, 1.2) –Propositions Statement, Truth value, Proposition, Propositional symbol,
Methods of Proofs PREDICATE LOGIC The “Quantifiers” and are known as predicate quantifiers. " means for all and means there exists. Example 1: If we.
10/17/2015 Prepared by Dr.Saad Alabbad1 CS100 : Discrete Structures Proof Techniques(1) Dr.Saad Alabbad Department of Computer Science
Chapter 18: Conversion, Obversion, and Squares of Opposition
Logical Reasoning:Proof Prove the theorem using the basic axioms of algebra.
READING #4 “DEDUCTIVE ARGUMENTS” By Robert FitzGibbons from Making educational decisions: an introduction to Philosophy of Education (New York & London:
1 Introduction to Abstract Mathematics Chapter 2: The Logic of Quantified Statements. Predicate Calculus Instructor: Hayk Melikya 2.3.
Chapter 2 Logic 2.1 Statements 2.2 The Negation of a Statement 2.3 The Disjunction and Conjunction of Statements 2.4 The Implication 2.5 More on Implications.
Chapter 2 Symbolic Logic. Section 2-1 Truth, Equivalence and Implication.
CSci 2011 Discrete Mathematics Lecture 4 CSci 2011.
CS104:Discrete Structures Chapter 2: Proof Techniques.
1 Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 2: Logic & Incidence Geometry Back To the Very Basic Fundamentals.
The Art About Statements Chapter 8 “Say what you mean and mean what you say” By Alexandra Swindell Class Four Philosophical Questions.
Lecture 041 Predicate Calculus Learning outcomes Students are able to: 1. Evaluate predicate 2. Translate predicate into human language and vice versa.
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
Discrete Mathematical Structures: Theory and Applications 1 Logic: Learning Objectives  Learn about statements (propositions)  Learn how to use logical.
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.
Chapter 1 Logic and proofs
3.3 Mathematical Induction 1 Follow me for a walk through...
Proof And Strategies Chapter 2. Lecturer: Amani Mahajoub Omer Department of Computer Science and Software Engineering Discrete Structures Definition Discrete.
Chapter 1 Logic and Proof.
Lecture 6 Modality: Possible worlds
Chapter 7. Propositional and Predicate Logic
2. The Logic of Compound Statements Summary
Copyright © Cengage Learning. All rights reserved.
3. The Logic of Quantified Statements Summary
Advanced Algorithms Analysis and Design
Argument An argument is a sequence of statements.
Knowledge Representation and Reasoning
Methods of proof Section 1.6 & 1.7 Wednesday, June 20, 2018
Induction and recursion
Today’s Topics Introduction to Predicate Logic Venn Diagrams
Theme № 14. Conclusion The plan: 1. Essence of conclusion.
Explorations in Artificial Intelligence
2.4 Deductive Reasoning.
Discrete Mathematics and its Applications
A Brief Summary for Exam 1
Computer Security: Art and Science, 2nd Edition
Elementary Number Theory & Proofs
Chapter 7. Propositional and Predicate Logic
September 9, 2004 Prof. Marie desJardins (for Prof. Matt Gaston)
Foundations of Discrete Mathematics
CSNB234 ARTIFICIAL INTELLIGENCE
Logic Logic is a discipline that studies the principles and methods used to construct valid arguments. An argument is a related sequence of statements.
RESOLUTION.
Foundations of Discrete Mathematics
Agenda Proofs (Konsep Pembuktian) Direct Proofs & Counterexamples
Presentation transcript:

The Prior Analytics theory of propositions An. Pr. A, ch. 1 (24a10ff) Premise: protasis (= haplé apophansis) Particular: en merei (= ou katholou) Singular: missing. Conclusion (sumperasma) has the same form.

Deduction: sullogismos It means valid inference. Sometimed inference in general, sometimes the special sort of inference investigated in An.Pr. Deduction comes about: genesthai ton sullogismon.

Maybe much simpler: „… by adding ‚is’ or ‚is not’”.

Definition of syllogism as valid inference in general. „Results”: sumbainei (follows) Complete syllogisms are the axioms of the system. They are evident by themselves, need no proof.

„To be in another as a whole” (en holói einai), „predicated” (katégoreiszthai): new paraphrases for the subject-predicate relation. huparkhei remains as central. This is a semantical definition of the truth of universal affirmative (type a) and universal negative/privative (e) propositions. No explicit mention of particular affirmative (i) and negative (o) propositions. Here we can suppose that the Hermeneutics theory about contradictory pairs remains in force.

A2: theory of conversion (antistrephein) The converse of a premise: change the role of subject and predicate Theorems first: e and i are convertible (i.e. the converse is true as well), a is weakly convertible (i. e. the i proposition with the converted terms follows), o is not convertible. Proof for e-conversion: Indirect proof: 1. Suppose that B belongs to some A (contradictory to the conclusion) 2. Let us take such an A, say C (exemplification [ekthesis]) 3. C is a B, and A belongs to it. [‚C is a B’ and ‚B belongs to C’ are apparently synonymous.] 4. Therefore, A belongs to some B – contradiction. First use of term variables for general proofs. Is C a singular or an universal term?

1. It refers to the previous result. 2. Tacitly refers to the De Int. thesis that contraries (‚A belongs to no B’, ‚A belongs to every B’) exclude each other – impossibility. i-conversion: reference to e-conversion again.

Refutation of o-conversion by counterexample. Makes it logic dependent from empirical facts? What was used? Contradictory and contrary pairs (De Int.) The rule of the indirect proof („proof by impossibility”): If a hypothesis leads to a contradiction (impossibility), the negation of it is proved. Existential import: from the thesis that contraries cannot be true together. Two interpretations: Empty terms are excluded altogether. (Łukasiewicz) a-propositions imply the nonemptiness of the subject term.

Extension to modal propositions: „It is necessary for A to belong to some B”, two traditional readings: De dicto: „A belongs to some B” is a necessary truth. De re: „For some B it is necessary to be an A”, i. e., A is a necessary property of some B-s. The i-conversion is at least plausible for the de dicto but not for the de re readings.