Predicate Logic. Universal Quantifier Everything of a certain kind has a certain property (for every, for all)

Slides:



Advertisements
Similar presentations
1.3 Predicates and Quantifiers
Advertisements

The Logic of Quantified Statements
Chapter 2 Section 8 Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
L41 Lecture 2: Predicates and Quantifiers.. L42 Agenda Predicates and Quantifiers –Existential Quantifier  –Universal Quantifier 
2009/91 Predicates and Quantifiers (§1.3) In the sentence “x is greater than 3”: The phrase “x” denotes the subject - the object or entity that the sentence.
Sets. A set is a well-defined collection of values of the same kind (objects) Objects can be numbers, people, letters, days, may be sets themselves Examples.
Discrete Structures Chapter 1 Part B Fundamentals of Logic Nurul Amelina Nasharuddin Multimedia Department 1.
1 Predicates and quantifiers Chapter 8 Formal Specification using Z.
Discrete Structures Chapter 3: The Logic of Quantified Statements
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.
10 May 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Formal.
Copyright © Cengage Learning. All rights reserved. CHAPTER 1 SPEAKING MATHEMATICALLY SPEAKING MATHEMATICALLY.
Predicates and Quantifiers
Predicates & Quantifiers Goal: Introduce predicate logic, including existential & universal quantification Introduce translation between English sentences.
22 March 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Formal.
Chapter 1: The Foundations: Logic and Proofs
Formal Logic Mathematical Structures for Computer Science Chapter Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFormal Logic.
(CSC 102) Lecture 7 Discrete Structures. Previous Lectures Summary Predicates Set Notation Universal and Existential Statement Translating between formal.
Theory and Applications
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
Copyright © Cengage Learning. All rights reserved. CHAPTER 3 THE LOGIC OF QUANTIFIED STATEMENTS THE LOGIC OF QUANTIFIED STATEMENTS.
1 Predicate (Relational) Logic 1. Introduction The propositional logic is not powerful enough to express certain types of relationship between propositions.
Copyright © Curt Hill Quantifiers. Copyright © Curt Hill Introduction What we have seen is called propositional logic It includes.
Math 51/COEN 19 Day 3, 1.4 Quantifiers 1. 3 Predicates A lot like functions that return booleans Let P(x) denote x
Chapter 2: Basic Structures: Sets, Functions, Sequences, and Sums (1)
(CSC 102) Lecture 8 Discrete Structures. Previous Lectures Summary Predicates Set Notation Universal and Existential Statement Translating between formal.
Predicates and Quantified Statements
Lecture 4: Predicates and Quantifiers; Sets.
Chapter 2 The Logic of Quantified Statements. Section 2.1 Intro to Predicates & Quantified Statements.
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,
Lecture 7 – Jan 28, Chapter 2 The Logic of Quantified Statements.
Fall 2008/2009 I. Arwa Linjawi & I. Asma’a Ashenkity 1 The Foundations: Logic and Proofs Predicates and Quantifiers.
Discrete Structures – CNS 2300
CS 285- Discrete Mathematics Lecture 4. Section 1.3 Predicate logic Predicate logic is an extension of propositional logic that permits concisely reasoning.
CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.
Predicates and Quantifiers Dr. Yasir Ali. 1.Predicates 2.Quantifiers a.Universal Quantifiers b.Existential Quantifiers 3.Negation of Quantifiers 4.Universal.
1 CMSC 250 Chapter 2, Predicate Logic. 2 CMSC 250 Definitions l Subject / predicate John / went to the store. The sky / is blue. l Propositional logic-
Predicate Logic One step stronger than propositional logic Copyright © Curt Hill.
Copyright © Peter Cappello 2011 Predicates & Quantifiers.
1 1 Devon M. Simmonds University of North Carolina, Wilmington CSC133 Discrete Mathematical Structures TIME: Tuesday/Thursday 9:30 – 10:45am in Office.
Albert Gatt LIN3021 Formal Semantics Lecture 3. Aims This lecture is divided into two parts: 1. We make our first attempts at formalising the notion of.
Tautology. In logic, a tautology (from the Greek word ταυτολογία) is a formula that is true in every possible interpretation.logic Greek formulainterpretation.
Section 1.5 and 1.6 Predicates and Quantifiers. Vocabulary Predicate Domain Universal Quantifier Existential Quantifier Counterexample Free variable Bound.
Sets and Basic Operations on Sets Notation A set will usually be denoted by a capital letter, such as, A,B,X, Y,..., whereas lower-case letters, a, b,
PREDICATES AND QUANTIFIERS COSC-1321 Discrete Structures 1.
2004/9/15fuzzy set theory chap02.ppt1 Classical Logic the forms of correct reasoning - formal logic.
Section 1.4. Propositional Functions Propositional functions become propositions (and have truth values) when their variables are each replaced by a value.
Propositional Logic. Assignment Write any five rules each from two games which you like by using propositional logic notations.
Thinking Mathematically Basic Set Concepts. A “set” is a collection of objects. Each object is called an “element” of the set. Often the objects in a.
Lecture 1-3: Quantifiers and Predicates. Variables –A variable is a symbol that stands for an individual in a collection or set. –Example, a variable.
رياضيات متقطعة لعلوم الحاسب MATH 226. Chapter 1 Predicates and Quantifiers 1.4.
3. The Logic of Quantified Statements Summary
Chapter 3 The Logic of Quantified Statements
Predicates & Quantifiers
Speaking Mathematically
Negations of Quantified Statements
Discrete Structure II: Introduction
CS201: Data Structures and Discrete Mathematics I
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
Discrete Mathematics Lecture 4 & 5: Predicate and Quantifier
Discrete Mathematics Lecture 3: Predicate and Quantifier
Department of Computer Science Abdul Wali Khan University Mardan
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
Discrete Mathematics Lecture 4 & 5: Predicate and Quantifier
Predicates and Quantifiers
CS201: Data Structures and Discrete Mathematics I
Presentation transcript:

Predicate Logic

Universal Quantifier Everything of a certain kind has a certain property (for every, for all)

Universal quantifier

Existential quantifier

Constraints

Universal quantification with constraint  D | P Q Existential quantification with constraint  D | P Q Where D is declaration, P is predicate acting as constraint and Q is predicate being quantified

Recast with Constraints

Examples For every natural number n, less than or equal to 10, n squared is less than or equal to a hundred.  n :  | n  10 n 2  100 or  n :  (n  10  n 2  100) For some natural number n, less than or equal to 10, n squared is 64.  n :  | n  10 n 2 = 64 or  n :  (n  10  n 2 = 64)

Free variables

Free Variables

 y :  x = y 2, x is free variable, y is a bound variable; y can be replaced by almost any name.  p :  x = p 2, the meaning of the existential quantification is unchanged  x :  x = x 2, x no longer free

Mixing quantifiers Predicate begins with two quantifiers, one existential and one universal Must take care about changing their order, as in general this is not possible  x :  (  y :  y > x) – given any integer we can always find bigger than it `  y :  (  x :  y > x) – we can find an integer that is bigger than all the integers

Example Sao Paolo is bigger than any other city in the same country Rephrase it to there is a certain country to which Sao Paolo belongs, and Sao Paolo is bigger than any other city in that country Formally stated  co : country Sao Paolo is in co   ci : city ci is in co   ci is Sao Paolo  Soa Paolo is bigger than ci

Negation of quantifiers The negation of ‘Everything of a certain kind has a certain property’ is ‘at least one thing of that kind does not have that property’ Example  n :  | n > 5 n 2 > every natural number greater than 5 has a square that is greater than 100 Its negation  n :  | n > 5 n 2  some natural number greater than 5 has a square that is not greater than 100 In general (  D | P Q)  (  D | P (  Q))

Negation of quantifiers The negation of ‘at least one thing of a certain kind has a certain property’ is ‘Everything of that kind does not have that property’ Example  n :  | n > 5 n 2 = 100 – there is a natural number greater than 5 whose square is 100 Its negation  n :  | n > 5 n 2  every natural number greater than 5 has a square that is not 100 In general (   D | P Q)  (  D | P (  Q))

Example Sao Paolo is bigger than any city in Europe Rephrase as follows: for every city c if c is in Europe then Sao Paolo is bigger than c Formally can be written as  c : city c is in Europe  Sao Paolo is bigger than c or  c : city  (c is in Europe  Sao Paolo is bigger than c)

Equality

1 + 1 = 2 First day of fasting = first Ramadan

Equality : property Symmetric; if s=t then t=s Transitivity; s=t, t=u, then s=u

Uniqueness and quantity

Let x loves y mean that x is in love with y, and let Person be the set of all people Symbolizing proposition ‘only Romeo loves Juliet’ Romeo loves Juliet   p : Person p loves Juliet  p = Romeo

Statement ‘there is at most one person with whom Romeo is in love’ Formally written  p, q : Person Romeo loves p  Romeo loves q  p = q if p and q are two people that Romeo loves, then they must be the same person Statement ‘no more than two visitors are permitted’

The notion of ‘at least one’ can be formalised using existential quantifier Statement ‘at least one person has applied’  p : Person : p  Applicants Statement ‘there are at least two applicants’; we use equality  p, q : Applicants p  q Statement ‘there is exactly one book on my desk’  b : Book b  Desk  (  c : Book | c  Desk c = b)

Definite Description We may describe an object in terms of its properties without giving it a name Examples indicate there is a unique object with certain properties - the man who shot John Lennon - the woman who discovered radium - the oldest faculty in UPM

Definite Description The  -notation is use for definite description of object We write (  x : a | p) to denote the unique object x from a such that p Examples indicate there is a unique object with certain properties (  x : Person | x shot John Lennon) (  y : Person | y discovered radium) (  z : Faculty | z is the oldest faculties in UPM) Marie Curie = (  y : Person | y discovered radium) Marie Curie  Person  Marie Curie discovered radium

Definite Description