Existential Introduction Kareem Khalifa Department of Philosophy Middlebury College.

Slides:



Advertisements
Similar presentations
Artificial Intelligence
Advertisements

Formal Criteria for Evaluating Arguments
Nested Quantifiers Needed to express statements with multiple variables Example 1: “x+y = y+x for all real numbers”  x  y(x+y = y+x) where the domains.
The Logic of Quantified Statements
The Foundations: Logic and Proofs
CPSC 121: Models of Computation Unit 6 Rewriting Predicate Logic Statements Based on slides by Patrice Belleville and Steve Wolfman.
Exercises with the Material Conditional
1 Philosophy 1100 Title:Critical Reasoning Instructor:Paul Dickey Website:
Reasoning about Abortion Kareem Khalifa Department of Philosophy Middlebury College.
Refutation, Part 1: Counterexamples & Reductio Kareem Khalifa Philosophy Department Middlebury College.
F22H1 Logic and Proof Week 7 Clausal Form and Resolution.
1. 2 Exam 1Sentential LogicTranslations (+) Exam 2Sentential LogicDerivations Exam 3Predicate LogicTranslations Exam 4Predicate LogicDerivations 6
Induction and recursion
Philosophy 1100 Today: Hand Back “Nail that Claim” Exercise! & Discuss
Discussion #17 1/15 Discussion #17 Derivations. Discussion #17 2/15 Topics Derivations  proofs in predicate calculus Inference Rules with Quantifiers.
Categorical Syllogisms Always have two premises Consist entirely of categorical claims May be presented with unstated premise or conclusion May be stated.
1 Chapter 7 Propositional and Predicate Logic. 2 Chapter 7 Contents (1) l What is Logic? l Logical Operators l Translating between English and Logic l.
Conditional Statements & Material Implication Kareem Khalifa Department of Philosophy Middlebury College.
Logical and Rule-Based Reasoning Part I. Logical Models and Reasoning Big Question: Do people think logically?
Section 1.3: Predicates and Quantifiers
Copyright © Curt Hill Rules of Inference What is a valid argument?
Inference is a process of building a proof of a sentence, or put it differently inference is an implementation of the entailment relation between sentences.
Deduction, Induction, & Truth Kareem Khalifa Department of Philosophy Middlebury College.
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.
Chains of Inference Kareem Khalifa Department of Philosophy Middlebury College.
Existential Elimination Kareem Khalifa Department of Philosophy Middlebury College 
1 Chapter 7 Propositional and Predicate Logic. 2 Chapter 7 Contents (1) l What is Logic? l Logical Operators l Translating between English and Logic l.
Universal Introduction and Quantifier Exchange Rules.
Quantifiers, Predicates, and Names Kareem Khalifa Department of Philosophy Middlebury College Universals, by Dena Shottenkirk.
Symbolic Language and Basic Operators Kareem Khalifa Department of Philosophy Middlebury College.
The Science of Good Reasons
First Order Logic Lecture 2: Sep 9. This Lecture Last time we talked about propositional logic, a logic on simple statements. This time we will talk about.
Truth Tables and Validity Kareem Khalifa Department of Philosophy Middlebury College pqrSp v qr & s~(p v q)~p~q~p & ~q~(p v q) -> (r & s) (~p & ~q) ->
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
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 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Spring 2006-Lecture 8.
Introduction to Derivations in Sentential Logic PHIL 121: Methods of Reasoning April 8, 2013 Instructor:Karin Howe Binghamton University.
Hazırlayan DISCRETE COMPUTATIONAL STRUCTURES Propositional Logic PROF. DR. YUSUF OYSAL.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Hypothetical Derivations Kareem Khalifa Department of Philosophy Middlebury College.
Basic Inference Rules Kareem Khalifa Department of Philosophy Middlebury College.
1 Introduction to Abstract Mathematics Chapter 2: The Logic of Quantified Statements. Predicate Calculus Instructor: Hayk Melikya 2.3.
1 Introduction to Abstract Mathematics Proofs in Predicate Logic , , ~, ,  Instructor: Hayk Melikya Purpose of Section: The theorems.
CS 285- Discrete Mathematics Lecture 4. Section 1.3 Predicate logic Predicate logic is an extension of propositional logic that permits concisely reasoning.
Predicates and Quantifiers Dr. Yasir Ali. 1.Predicates 2.Quantifiers a.Universal Quantifiers b.Existential Quantifiers 3.Negation of Quantifiers 4.Universal.
Chapter 7. Propositional and Predicate Logic Fall 2013 Comp3710 Artificial Intelligence Computing Science Thompson Rivers University.
Philosophy and Logic The Process of Correct Reasoning.
Dr. Naveed Riaz Design and Analysis of Algorithms 1 1 Formal Methods in Software Engineering Lecture # 25.
First-Order Logic Semantics Reading: Chapter 8, , FOL Syntax and Semantics read: FOL Knowledge Engineering read: FOL.
Chapter 5. Section 5.1 Climbing an Infinite Ladder Suppose we have an infinite ladder: 1.We can reach the first rung of the ladder. 2.If we can reach.
Lecture 041 Predicate Calculus Learning outcomes Students are able to: 1. Evaluate predicate 2. Translate predicate into human language and vice versa.
2004/9/15fuzzy set theory chap02.ppt1 Classical Logic the forms of correct reasoning - formal logic.
Chapter Ten Relational Predicate Logic. 1. Relational Predicates We now broaden our coverage of predicate logic to include relational predicates. This.
Metalogic Soundness and Completeness. Two Notions of Logical Consequence Validity: If the premises are true, then the conclusion must be true. Provability:
1 Section 7.3 Formal Proofs in Predicate Calculus All proof rules for propositional calculus extend to predicate calculus. Example. … k.  x p(x) P k+1.
Theorems and Shortcuts Kareem Khalifa Department of Philosophy Middlebury College.
Uniqueness Quantifier ROI for Quantified Statement.
Chapter 5 1. Chapter Summary  Mathematical Induction  Strong Induction  Recursive Definitions  Structural Induction  Recursive Algorithms.
Chapter 7. Propositional and Predicate Logic
Introduction to Logic for Artificial Intelligence Lecture 2
Symbolic Language and Basic Operators
Today’s Topics Universes of Discourse
Existential Elimination
CS201: Data Structures and Discrete Mathematics I
Computer Security: Art and Science, 2nd Edition
Universal Elimination
Chapter 7. Propositional and Predicate Logic
Predicates and Quantifiers
CPSC 121: Models of Computation
CS201: Data Structures and Discrete Mathematics I
Presentation transcript:

Existential Introduction Kareem Khalifa Department of Philosophy Middlebury College

SURPRISE! Translate the following: Anyone who is respected respects his/her respecter. Hence, Bob is respected, as he respects someone. Let –R be a 2-place predicate = “…respects…” –b is a name for “Bob.” You have until 11:20 to complete this.

Overview Why this matters Predicate logic is just propositional logic on (minor) steroids The First New Rule of Inference: –Existential Introduction Sample Exercises

Why this matters Recall: there are valid inferences that predicate logic promised to render valid. This will also make you more adept at evaluating and offering reasons involving statements involving “some.”

Predicate Logic: An Extension of Propositional Logic Recall: proofs are like games. –You have an initial position (premises), and using a set of pre-established rules (of inference), you move towards a goal (conclusion) Proofs are still like games in predicate logic! –There are just four more basic rules you can use.

The First Rule: Existential Introduction (  I) English Example: –Khalifa is a professor. So someone is a professor. Logical Example: 1.PkA 2.  xPx1  I General rule: –Given any formula with a name (i.e. a-t) in it, add an existential quantifier, and replace each name with a variable. –See Nolt, p. 225 for fancier definition

Three more examples Al loves himself. 1. LaaA …So someone loves Al. (1 st Example) 2.  xLxa1  I …So Al loves someone. (2 nd Example) 2’.  xLax1  I …So someone loves him/herself. (3 rd Example) 2’’.  xLxx1  I

A fourth, fancier example Al loves himself. So someone loves someone. 1. LaaA 2.  yLay1  I 3.  x  yLxy2  I IMPORTANT: when you apply  I twice, you always work from the inside out (right to left). Otherwise, you’re breaking the rule that students are perpetually tempted to break (applying rules to parts of propositions, as opposed to applying rules to the whole proposition).

Do NOT do the following 1.LabA 2.  xLxx1  I Think about the inference you’ve just made: –Al loves Beth. So someone loves him/herself. –Clearly invalid! Al may still love Beth, but Al and Beth may nevertheless both hate themselves.

A closely related but legitimate move 1.FaA 2.GbA 3.  xFx1  I 4.  xGx2  I 5.  xFx &  xGx3,4 &I This is OK, because although it is using the same variable x for two unrelated terms, it is not saying that one thing is both F and G. Ex. Al is friendly; Beth is grumpy. So someone is friendly and someone is grumpy. If this confuses you, it’s usually fine to use distinct variables (e.g. y on line 4), but you will still need to be able to interpret statements like line 5 correctly.

Some things to keep in mind… So long as the main operator is ~, v, &, , or , your proof strategies from propositional logic still hold good. If your main operator is , then consider proving a singular statement to which you can subsequently apply  I.

Sample Exercises, Nolt Lab ├  xLxb 1. LabA 2.  xLxb1  I

8.1.2 #2. Lab ├  xLax 1. LabA 2.  xLax1  I

8.1.3 #3 Laa ├  xLxx 1. LaaA 2.  xLxx1  I

8.1.7 #7 ~  x  yRxy ├ ~Rab 1. ~  x  yRxyA 2. |RabH for ~I 3.|  yRay2  I 4.|  x  yRxy3  I 5.|  x  yRxy & ~  x  yRxy1,4 &I 6. ~Rab2-5 ~I

8.1.9 #9 ├ Fa →  xFx 1. | FaH for →I 2.|  xFx1  I 3. Fa →  xFx1-2 →I