Today’s Topics Relational predicates Multiple quantification Expansions of relational predicates.

Slides:

Advertisements

Similar presentations

Predicate Logic Colin Campbell. A Formal Language Predicate Logic provides a way to formalize natural language so that ambiguity is removed. Mathematical.

Advertisements

1 First order theories (Chapter 1, Sections 1.4 – 1.5)

Rosen 1.3 Propositional Functions Propositional functions (or predicates) are propositions that contain variables. Ex: Let P(x) denote x > 3 P(x) has.

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

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2007 Chapter 1: (Part 2): The Foundations: Logic and Proofs.

DISCRETE MATHEMATICS I LECTURES CHAPTER 3 Dr. Adam P. Anthony Spring 2011 Some material adapted from lecture notes provided by Dr. Chungsim Han and Dr.

Today’s Topics Limits to the Usefulness of Venn’s Diagrams Predicates (Properties and Relations) Variables (free, bound, individual, constants)

RMIT University; Taylor's College This is a story about four people named Everybody, Somebody, Anybody and Nobody. There was an important job to be done.

Copyright © Cengage Learning. All rights reserved. CHAPTER 1 SPEAKING MATHEMATICALLY SPEAKING MATHEMATICALLY.

Exam #3 is Friday. It will consist of proofs, plus symbolizations in predicate logic.

Discrete Structures Chapter 1 Part B Fundamentals of Logic Nurul Amelina Nasharuddin Multimedia Department 1.

I.1 ii.2 iii.3 iv.4 1+1=. i.1 ii.2 iii.3 iv.4 1+1=

Review Test 5 You need to know: How to symbolize sentences that include quantifiers of overlapping scope Definitions: Quantificational truth, falsity and.

March 5: more on quantifiers We have encountered formulas and sentences that include multiple quantifiers: Take, for example: UD: People in Michael’s office.

CSE115/ENGR160 Discrete Mathematics 02/10/11 Ming-Hsuan Yang UC Merced 1.

I.1 ii.2 iii.3 iv.4 1+1=. i.1 ii.2 iii.3 iv.4 1+1=

Logic In Part 2 Modules 1 through 5, our topic is symbolic logic. We will be studying the basic elements and forms that provide the structural foundations.

The Language of Propositional Logic The Syntax and Semantics of PL.

Predicates & Quantifiers Goal: Introduce predicate logic, including existential & universal quantiﬁcation Introduce translation between English sentences.

The Foundations: Logic and Proofs

ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.

Artificial Intelligence 4. Knowledge Representation Course V231 Department of Computing Imperial College, London © Simon Colton.

(CSC 102) Lecture 7 Discrete Structures. Previous Lectures Summary Predicates Set Notation Universal and Existential Statement Translating between formal.

Quantifiers, Predicates, and Names Kareem Khalifa Department of Philosophy Middlebury College Universals, by Dena Shottenkirk.

PART TWO PREDICATE LOGIC. Chapter Seven Predicate Logic Symbolization.

Logic Disjunction A disjunction is a compound statement formed by combining two simple sentences using the word “OR”. A disjunction is true when at.

Digraphs and Relations Warm Up. The Divisibility Relation Let “|” be the binary relation on N×N such that a|b (“a divides b”) iff there is an n ∈ N such.

Copyright © Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS.

1.6 Introduction to Solving Equations

Properties from Algebra

Chapter 2: Basic Structures: Sets, Functions, Sequences, and Sums (1)

Nested Quantifiers Section 1.5.

1 Sections 1.3 and 1.4 Predicates & Quantifiers. 2 Propositional Functions In a mathematical assertion, such as x < 3, there are two parts: –the subject,

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.

1.7 Introduction to Solving Inequalities Objectives: Write, solve, and graph linear inequalities in one variable. Solve and graph compound linear inequalities.

No new reading for Wednesday. Keep working on chapter 5, section 3. Exam #3 is next Monday.

Lecture 7 – Jan 28, Chapter 2 The Logic of Quantified Statements.

For Wednesday Read chapter 9, sections 1-3 Homework: –Chapter 7, exercises 8 and 9.

Discrete Structures – CNS 2300

For Friday Read chapter 8 Homework: –Chapter 7, exercises 2 and 10 Program 1, Milestone 2 due.

2.3 Diagrams and 2.4 Algebraic Reasoning. You will hand this in P. 88, 23.

Copyright © Peter Cappello 2011 Predicates & Quantifiers.

Objective: To prove and apply theorems about angles Proving Angles Congruent (2-6)

Properties Objective: To use the properties of numbers. Do Now 1.) = 3.) ( 2  1 )  4 = 2.) =4.) 2  ( 1  4 ) =

1.6 Introduction to Solving Equations Objectives: Write and solve a linear equation in one variable. Solve a literal equation for a specified variable.

1 Outline Quantifiers and predicates Translation of English sentences Predicate formulas with single variable Predicate formulas involving multiple variables.

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.

1 Introduction to Abstract Mathematics Chapter 3: The Logic of Quantified Statements. Predicate Calculus Instructor: Hayk Melikya 3.1.

Chapter Ten Relational Predicate Logic. 1. Relational Predicates We now broaden our coverage of predicate logic to include relational predicates. This.

Section 1.4. Propositional Functions Propositional functions become propositions (and have truth values) when their variables are each replaced by a value.

Section 1.5. Section Summary Nested Quantifiers Order of Quantifiers Translating from Nested Quantifiers into English Translating Mathematical Statements.

1 You Never Escape Your… Relations EQUIVALENCE RELATION Presented by K.Senguttuvan, PGT Kendriya Vidyalaya, Gachibowli, Hyderabad. 2.

Artificial Intelligence Knowledge Representation.

Propositional Logic. Assignment Write any five rules each from two games which you like by using propositional logic notations.

Discrete Mathematical الرياضيات المتقطعة. Example 12 June OR Q(x,y): x+y=x-y a) Q(1,1): 2=0 False b) Q(2,0): 2+0=2-0 True c) Q(1,y): 1+y=1-y False(take.

DISCRETE COMPUTATIONAL STRUCTURES CSE 2353 Fall 2010 Most slides modified from Discrete Mathematical Structures: Theory and Applications by D.S. Malik.

3. The Logic of Quantified Statements Summary

Lesson 1-4 Solving Inequalities.

1.7 Introduction to Solving Inequalities

1.7 Introduction to Solving Inequalities

Chapter 3 The Logic of Quantified Statements

Predicates & Quantifiers

Week #2 – 4/6 September 2002 Prof. Marie desJardins

Introduction to Predicates and Quantified Statements I

Discrete Mathematics Lecture 4 & 5: Predicate and Quantifier

Properties of Equality

Discrete Mathematics Lecture 4 Logic of Quantified Statements

Algebra 1 Section 2.4.

Presentation transcript:

Today’s Topics Relational predicates Multiple quantification Expansions of relational predicates

Relational Predicates Assert relations that exist between objects Always have at least 2 variables Depending on the predicate, have or lack properties of –Symmetry –Transitivity –Reflexivity The order of the variables in a relational predicate is crucial

Symbolizing with multiple quantifiers When symbolizing a quantified sentence with multiple quantifiers, it is frequently a good idea to paraphrase inward. Work from the gross external structure of an English sentence toward the finer structures

Any thief can pick any lock (  x)(If x is a thief, then x can pick any lock) (  x)(Tx  x can pick any lock) (  x)(Tx  (  y)(If y is a lock, then x can pick it)) (  x)(Tx  (  y)(Ly  Pxy))

The order of quantifiers is significant 1.(  x)(  y)Lxy says “everybody loves somebody or other” 2.(  x)(  y)Lxy says, “there is at least one person who loves everyone” 3.(  y)(  x)Lxy says “somebody is loved by everyone” 4.(  y)(  x)Lxy says “everybody is loved by somebody or other” In a 3 element universe {a, b, c} where Lab, Lba, Lbb, Lbc, and Lcc are true: 1 is true, 2 is true, 3 is false and 4 is true

Truth Functional Expansions of Formulas Using Relational Predicates A truth functional expansion of a formula using relational predicates works just like a truth functional expansion of a formula using only monadic predicates.

Consider the 2 element universe {a,b} The truth functional expansion of (  x)(  y)Lxy is: [Laa v Lab]  [Lba v Lbb] The truth functional expansion of (  x)(  y)Lxy is: [Laa  Lab] v [Lba  Lbb]

Interpretations of Universes with Relational Predicates Providing an interpretation of a universe using relational predicates is a bit more difficult than with monadic predicates. We can provide an exhaustive list of all of the ordered sets of elements in the universe R – ab – ac – bc

Alternatively, we can use a graphic representation of the extension of a predicate. In the following diagrams, the circle represents the universe. The numbers in the circles are the elements in the universe. An arrow running from one number to another, 1  2, means that 1 bears the relation in question to 2, but not that 2 bears the relation to 1 unless there is another arrow, 2  1

Is the formula true or false in the universe as interpreted?

It is FALSE. There is no single object which bears the B relationship to everything in the universe. 8 comes close, but 8 does not bear B to itself, so 8 fails to bear B to everything. A small change in the diagram, however, makes the formula true in the universe.

This formula is true in the universe as interpreted,

Is the formula true or false in the universe as interpreted?

The formula in universe II is TRUE—every object in the universe bears B to some object or other. The formula in universe III is TRUE— everything in the universe bears B to some identifiable thing (2) including 2. The formula in universe IV is FALSE The formula in universe V is TRUE.