Universal Introduction and Quantifier Exchange Rules.

Slides:



Advertisements
Similar presentations
Artificial Intelligence
Advertisements

Chapter 1: The Foundations: Logic and Proofs 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Predicates and Quantifiers 1.4 Nested Quantifiers.
1-1 Copyright © 2015, 2010, 2007 Pearson Education, Inc. Chapter 21, Slide 1 Chapter 21 Comparing Two Proportions.
L41 Lecture 2: Predicates and Quantifiers.. L42 Agenda Predicates and Quantifiers –Existential Quantifier  –Universal Quantifier 
F22H1 Logic and Proof Week 7 Clausal Form and Resolution.
Unlocking Calculus Getting started on Integrals Unlocking Calculus 1 The Integral  What is it? –The area underneath a curve  Why is it useful? –It.
Testing Hypotheses About Proportions Chapter 20. Hypotheses Hypotheses are working models that we adopt temporarily. Our starting hypothesis is called.
1. 2 Exam 1Sentential LogicTranslations (+) Exam 2Sentential LogicDerivations Exam 3Predicate LogicTranslations Exam 4Predicate LogicDerivations 6
Proofs in Predicate Logic A rule of inference applies only if the main operator of the line is the right main operator. So if the line is a simple statement,
3.3 Differentiation Formulas
Logic 3 Tautological Implications and Tautological Equivalences
The Basics of Regression continued
1 Hypothesis Testing In this section I want to review a few things and then introduce hypothesis testing.
Existential Introduction Kareem Khalifa Department of Philosophy Middlebury College.
EE1J2 - Slide 1 EE1J2 – Discrete Maths Lecture 6 Limitations of propositional logic Introduction to predicate logic Symbols, terms and formulae, Parse.
Logical and Rule-Based Reasoning Part I. Logical Models and Reasoning Big Question: Do people think logically?
Fall 2002CMSC Discrete Structures1 Let’s proceed to… Mathematical Reasoning.
Mathematical Induction
Section 1.3: Predicates and Quantifiers
The Foundations: Logic and Proofs
Copyright © Curt Hill Rules of Inference What is a valid argument?
Proofs in Predicate Logic A rule of inference applies only if the main operator of the line is the right main operator. So if the line is a simple statement,
Comparing Two Proportions
1 Georgia Tech, IIC, GVU, 2006 MAGIC Lab Rossignac Lecture 03: PROOFS Section 1.5 Jarek Rossignac CS1050: Understanding.
Deduction, Proofs, and Inference Rules. Let’s Review What we Know Take a look at your handout and see if you have any questions You should know how to.
MATH 224 – Discrete Mathematics
Mathematical Arguments and Triangle Geometry
Existential Elimination Kareem Khalifa Department of Philosophy Middlebury College 
Chapter 3 – Set Theory  .
Proofs1 Elementary Discrete Mathematics Jim Skon.
Chapter 1 Logic Section 1-1 Statements Open your book to page 1 and read the section titled “To the Student” Now turn to page 3 where we will read the.
1 Sections 1.5 & 3.1 Methods of Proof / Proof Strategy.
Quantifiers, Predicates, and Names Kareem Khalifa Department of Philosophy Middlebury College Universals, by Dena Shottenkirk.
Fallacies The proposition [(p  q)  q]  p is not a tautology, because it is false when p is false and q is true. This type of incorrect reasoning is.
1 Predicate (Relational) Logic 1. Introduction The propositional logic is not powerful enough to express certain types of relationship between propositions.
Pythagorean Theorem. History of Pythagorean Theorem Review The Pythagorean theorem takes its name from the ancient Greek mathematician Pythagoras (569.
CS Introduction to AI Tutorial 8 Resolution Tutorial 8 Resolution.
Hazırlayan DISCRETE COMPUTATIONAL STRUCTURES Propositional Logic PROF. DR. YUSUF OYSAL.
Natural Deduction Proving Validity. The Basics of Deduction  Argument forms are instances of deduction (true premises guarantee the truth of the conclusion).
Hypothetical Derivations Kareem Khalifa Department of Philosophy Middlebury College.
Week 4 - Friday.  What did we talk about last time?  Floor and ceiling  Proof by contradiction.
Chapter Nine Predicate Logic Proofs. 1. Proving Validity The eighteen valid argument forms plus CP and IP that are the proof machinery of sentential logic.
Mathematics for Comter I Lecture 3: Logic (2) Propositional Equivalences Predicates and Quantifiers.
Lecture 041 Predicate Calculus Learning outcomes Students are able to: 1. Evaluate predicate 2. Translate predicate into human language and vice versa.
Today’s Topics Argument forms and rules (review)
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
Metalogic Soundness and Completeness. Two Notions of Logical Consequence Validity: If the premises are true, then the conclusion must be true. Provability:
Geometry- Lesson 11 Unknown Angle Proofs- Proofs of Known Facts 1.
Statistics 22 Comparing Two Proportions. Comparisons between two percentages are much more common than questions about isolated percentages. And they.
Note starter Scour your notes for when we used the limit process to find a derivative, then fill in the table. FunctionDerivative.
Chapter 1 Logic and proofs
Comparing Two Proportions
The Sine Rule The Sine Rule is used for cases in which the Cosine Rule cannot be applied. It is used to find: 1. An unknown side, when we are given two.
Whiteboardmaths.com © 2004 All rights reserved
Formal Logic CSC 333.
Rationale Behind the Precise Formulation of the Four Quantifier Rules
Comparing Two Proportions
Existential Elimination
CS 1502 Formal Methods in Computer Science
Mathematical Reasoning
Comparing Two Proportions
CS 270 Math Foundations of CS
The Sine Rule The Sine Rule is used for cases in which the Cosine Rule cannot be applied. It is used to find: 1. An unknown side, when we are given two.
Universal Elimination
Proofs in Predicate Logic
The Sine Rule The Sine Rule is used for cases in which the Cosine Rule cannot be applied. It is used to find: 1. An unknown side, when we are given two.
Predicates and Quantifiers
Mathematical Reasoning
Logical and Rule-Based Reasoning Part I
Chapter 8 Natural Deduction
Presentation transcript:

Universal Introduction and Quantifier Exchange Rules

Overview Universal Introduction English Example The Logical Mechanics Quantifier Exchange Rules Examples

An example Take any triangle ABC. Draw line a through points A and B. Draw line b through point C and parallel to line a. Since lines a and b are parallel, <BAC = < B'CA and <ABC = <BCA'. It is obvious that <B'CA + <ACB + <BCA' = 180 degrees. Thus <ABC + <BCA + <CAB = 180 degrees.

Another example Take your typical journalist. He clearly has an incentive to report newsworthy events. Reporting on these events inevitably involves emphasizing previously unknown risks. Thus, journalists emphasize previously unknown risks.

What exactly have we done here? We’ve taken a representative instance, and because it is representative, we draw a universal conclusion from it. Representative instances: Triangle ABC, “Your typical journalist” Universal Conclusions: All triangles’ vertices sum to 180 degrees, All journalists emphasize risks. This is the core of Universal Introduction (  I ).

A closer look at the logic… 1.  x(Jx  Ix)A 2.  x(Ix  Ex)A   x(Jx  Ex) 3. Ja  Ia 1  E 4. Ia  Ea 2  E 5. Ja  Ea 3,4HS 6.  x(Jx  Ex) 5  I 1. Journalists have an incentive to report on newsworthy events. 2. Reporting on newsworthy events  emphasizing risk. So journalists emphasize risk. 3. Your typical journalist has an incentive to report newsworthy events. 4. If he has this incentive, then he emphasizes risks. 5. So your typical journalist emphasizes risk. 6. So all journalists emphasize risk.

The rule:  I Let Ф be a formula containing a name , and let Ф  /  be the result of replacing all occurrences of  in Ф by some variable  not already in Ф. Then from Ф infer   Ф  / , provided that  does not occur in any hypothesis whose hypothetical derivation has not yet ended or in any assumption.  xFx├  x(Fx v Gx) 1.  xFx A 2. Fa 1  E 3. Fa v Ga 2vI 4.  x(Fx v Gx) 3  I

What you can’t do with  I You cannot infer a universally quantified statement from a statement involving a name that occurs in any hypothesis whose hypothetical derivation has not yet ended or a name that occurs in any assumption. English Example: Khalifa is right handed. So everyone is right handed.

The English Example made Formal Let k= Khalifa and Rx = x is right handed So the prohibition states that the following is INCORRECT: 1. RkA 2.  xRx1  I That would be a hasty generalization, as should be obvious from the English.

Proof strategies If the main operator is →, ↔, v, &, or ~, don’t forget what you’ve already learned—they still hold good. If the main operator is , then first see if you can use  I. If there are existentially quantified premises, you may have to first hypothesize for  E before applying  I. If the main operator is , first try to get the conclusion by  I. If there are universal premises, you may have to first apply  E before applying  I. ~I remains a nuclear option.

Quantifier exchange rules: Examples All students are nice  Not a single student is not nice.  Φ  ~  ~Φ Some students are not nice  Not all students are nice.  ~Φ  ~  Φ All students are non-nice  Not a single student is nice.  ~Φ  ~  Φ Some students are nice  Not all students are non-nice.  Φ  ~  ~Φ

Quantifier exchange rules (QE, see Nolt, p.238) Think of these as the functional equivalent of DeMorgan’s Laws (DM) applied to quantifiers You take a ~ and “distribute” it through a quantified statement, switching  to  (or vice versa), and placing the ~ on the other side of the quantifier. These are derived rules for predicate logic.

Sample: Nolt  x(Fx→Gx) ├  xFx →  xGx 1.  x(Fx → Gx) A 2. |  xFx H for →I 3. |Fa2  E 4.|Fa→Ga1  E 5.|Ga 3,4 →E 6.|  xGx5  I 7.  xFx →  xGx 2-6 →I

 x(Fx→Gx), ~  xGx ├  x~Fx 1.  x(Fx→Gx)A 2. ~  xGxA 3.  x~Gx2 QE 4. Fa → Ga1  E 5. ~Ga3  E 6. ~Fa4,5 MT 7.  x~Fx6  I

 x  yRxy ├  y  xRxy 1.  x  yRxyA 2. |  yRayH for  E 3.| Rab2  E 4.|  xRxb3  I 5.|  y  xRxy4  E 6.  y  xRxy1, 2-5  E