Today’s Topics Universes of Discourse

Slides:



Advertisements
Similar presentations
Chapter 1: The Foundations: Logic and Proofs 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Predicates and Quantifiers 1.4 Nested Quantifiers.
Advertisements

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2007 Chapter 1: (Part 2): The Foundations: Logic and Proofs.
Exam #3 is Friday. It will consist of proofs, plus symbolizations in predicate logic.
Discrete Mathematics Lecture 2 Alexander Bukharovich New York University.
For Friday, read chapter 6, section 2. As nongraded HW, do the problems on p Graded Homework #7 is due on Friday at the beginning of class.
EE1J2 - Slide 1 EE1J2 – Discrete Maths Lecture 6 Limitations of propositional logic Introduction to predicate logic Symbols, terms and formulae, Parse.
Formal Logic Mathematical Structures for Computer Science Chapter 1 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFormal Logic.
CSE115/ENGR160 Discrete Mathematics 01/20/11 Ming-Hsuan Yang UC Merced 1.
EE1J2 - Slide 1 EE1J2 – Discrete Maths Lecture 11 Introduction to Predicate Logic Limitations of Propositional Logic Predicates, quantifiers and propositions.
Chapter 1: The Foundations: Logic and Proofs
Logical Equivalence & Predicate Logic
Formal Logic Mathematical Structures for Computer Science Chapter Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFormal Logic.
Advanced Topics in FOL Chapter 18 Language, Proof and Logic.
Chapter 2 The Logic of Quantified Statements. Section 2.4 Arguments with Quantified Statements.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
PART TWO PREDICATE LOGIC. Chapter Seven Predicate Logic Symbolization.
Arguments with Quantified Statements M Universal Instantiation If some property is true for everything in a domain, then it is true of any particular.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
Hazırlayan DISCRETE COMPUTATIONAL STRUCTURES Propositional Logic PROF. DR. YUSUF OYSAL.
Predicates and Quantified Statements
Today’s Topics Introduction to Proofs Rules of Inference Rules of Equivalence.
1 Introduction to Abstract Mathematics Chapter 2: The Logic of Quantified Statements. Predicate Calculus Instructor: Hayk Melikya 2.3.
1 Introduction to Abstract Mathematics Predicate Logic Instructor: Hayk Melikya Purpose of Section: To introduce predicate logic (or.
No new reading for Wednesday. Keep working on chapter 5, section 3. Exam #3 is next Monday.
Fall 2008/2009 I. Arwa Linjawi & I. Asma’a Ashenkity 1 The Foundations: Logic and Proofs Predicates and Quantifiers.
Semantics of Predicate Calculus For the propositional calculus, an interpretation was simply an assignment of truth values to the proposition letters of.
Discrete Mathematics Mathematical reasoning: think logically; know how to prove Combinatorial analysis: know how to count Discrete structures: represent.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
PREDICATES AND QUANTIFIERS COSC-1321 Discrete Structures 1.
Mathematics for Comter I Lecture 3: Logic (2) Propositional Equivalences Predicates and Quantifiers.
1 Introduction to Abstract Mathematics Chapter 3: The Logic of Quantified Statements. Predicate Calculus Instructor: Hayk Melikya 3.1.
Section 1.4. Propositional Functions Propositional functions become propositions (and have truth values) when their variables are each replaced by a value.
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.
رياضيات متقطعة لعلوم الحاسب MATH 226. Chapter 1 Predicates and Quantifiers 1.4.
Logic Hubert Chan [O1 Abstract Concepts] [O2 Proof Techniques]
Presented by: Tutorial Services The Math Center
3. The Logic of Quantified Statements Summary
CSE15 Discrete Mathematics 01/23/17
Formal Modeling Concepts
Chapter 3 The Logic of Quantified Statements
Logic Hubert Chan [O1 Abstract Concepts] [O2 Proof Techniques]
Predicate Calculus Discussion #14 Chapter 2, Section 1 1/20.
Discussion #14 Predicate Calculus
Proposition & Predicates
Today’s Topics Introduction to Predicate Logic Venn Diagrams
CMSC Discrete Structures
The Foundations: Logic and Proofs
CS201: Data Structures and Discrete Mathematics I
CS 1502 Formal Methods in Computer Science
Predicate Calculus Discussion #14 Chapter 2, Section 1.
1st-order Predicate Logic (FOL)
First Order Logic Rosen Lecture 3: Sept 11, 12.
Introduction to Predicates and Quantified Statements I
Discrete Mathematics Lecture 4 & 5: Predicate and Quantifier
Computer Security: Art and Science, 2nd Edition
Discrete Mathematics Lecture 3: Predicate and Quantifier
Discrete Mathematics CMP-200 Propositional Equivalences, Predicates & Quantifiers, Negating Quantified Statements Abdul Hameed
Discrete Mathematics Lecture 4 & 5: Predicate and Quantifier
For Wednesday, read chapter 8, section 2 (pp )
Predicates and Quantifiers
TRUTH TABLES.
Discrete Mathematics Lecture 4 Logic of Quantified Statements
CPSC 121: Models of Computation
CS201: Data Structures and Discrete Mathematics I
Logic Logic is a discipline that studies the principles and methods used to construct valid arguments. An argument is a related sequence of statements.
Predicate Calculus. Predicate Calculus Topics Predicates Variables and instantiation Quantifiers Logical expressions Bound and free variables.
Herbrand Semantics Computational Logic Lecture 15
Inference Rules for Quantified Propositions
1st-order Predicate Logic (FOL)
Presentation transcript:

Today’s Topics Universes of Discourse Truth Functional Expansions of Quantified Formulae Expansions, Consistency and Validity

Truth Functional Expansions Every quantified formula ranges over a universe of discourse. The elements in the universe are the things that have the properties or stand in the relations described by the formula, they are the values of the bound variables. Quantified formulas make claims about the entire universe of discourse.

Truth Functional Expansions A quantified formula makes a claim about the elements in its universe of discourse. Replacing a variable with an element in the universe, we get an instance of the formula. Consider the formula ‘(x)(Fx  Gx)’ and the 2 element universe {a, b}. ‘Fa  Ga’ is one instance, ‘Fb  Gb’ is another. If every element is substituted for the bound variables, we get a truth functional expansion.

Specifying a universe of discourse We can specify a universe of discourse. Consider the 3 element universe {a, b, c} ‘(x)(Fx  Gx)’ says of these elements that ‘[(Fa  Ga)  (Fb  Gb)]  (Fc  Gc)’ ‘(x)(Fx  Gx)’ says of these elements that ‘[(Fa  Ga) v (Fb  Gb)] v (Fc  Gc)’ Now, if we know the properties of ‘a,’ ‘b,’ and ‘c,’ we can determine if either of the formulas is true in the universe.

The truth-functional expansion of a universally quantified proposition is a conjunction of the instances, the truth-functional expansion of an existentially quantified proposition is a disjunction of the instances.

Interpretations of the Extension of Predicates Knowing the properties of the elements in a universe means knowing the extension of the predicates being used—the set or subset of objects having the property or standing in the relation A description of the extension of the predicates in a universe is called an interpretation of that universe

Consider the following chart: F G a + - b + + c - - This chart presents an interpretation of the 3 element universe {a, b, c} and the predicates F and G. It says that ‘a’ is an F but not a G, ‘b’ is both F and G, and ‘c’ is neither F nor G. (x)(Fx  Gx) is FALSE in this universe, but (x)(Fx ● Gx) is TRUE

The truth-functional expansion of a universally quantified proposition is a conjunction of the instances, the truth-functional expansion of an existentially quantified proposition is a disjunction of the instances.

Expansions can be used to show that a statement, or set of statements, is consistent or that an argument is non-valid.

To show that a statement, or set of statements, is consistent, show that there is some interpretation in which all the statements are true

Let Px = x is a philosopher Mx = x is male Fx = x is female ( x)(Px ● Mx) and ( y)(Py ● Fy) are consistent. Consider the 2 element universe {a, b} where a is Al Hayward and b is Bambi Robinson. In that universe, both claims are true, so the pair is consistent

To show that an argument is non-valid, first generate a truth functional expansion for the premises and the conclusion, then use the abbreviated truth table method to show non-validity, I.e., that the premises can be true and the conclusion false.

Consider the argument: (x)(Px  Mx), (x)(Qx  Mx) (x)(Px  Qx) Expand this argument across the 2 element universe {a, b} to get: {[(Pa  Ma) ● (Pb  Mb)] ● [(Qa  Ma) ●(Qb  Mb)]} (Pa  Qa)  (Pb  Qb) If Pa, Pb, Ma and Mb are true, while either Qa or Qb is false, the non-validity of the argument is established.

Alternatively, you can simply create an interpretation of the predicates under which the argument is shown to be non-valid In the previous example, let Px = x is greater than 6, Mx = x is greater than 4, Qx = x is greater than 10.

Try some on your own. Download the Handout Expansions Study guide and review it. Download the Handout Expansions Exercises and create some expansions of your own and then determine whether the quantified formulas are true or false in a specified universe.