Chapter 2: The Logic of Quantified Statements. January 22, 2010
|
|
- Winfred French
- 6 years ago
- Views:
Transcription
1 Chapter 2: The Logic of Quantified Statements January 22, 2010
2 Outline Introduction to Predicates and Quantified Statements I Introduction to Predicates and Quantified Statements II Statements Containing Multiple Quantifiers
3 2.1- Introduction to Predicates and Quantified Statements I
4 Basic Facts and Notation for Sets A set is some collection of objects, which we call elements of the set. For example, and are examples of sets. A = { blue, red, yellow} B = {0, 2, 5, 13, 4} To write the fact that an object x is an element of a set A, we write x A x / A will denote the fact that x is not an element of A.
5 We will use the following notation for familiar sets of numbers: (1) R for the set of all real numbers (2) Z for the set of all integers (3) Q for the set of all rational numbers (4) N for the set of all natural numbers (i.e. positive integers) By putting + or in the superscript, we indicate the set of positive or negative numbers. For example, R + denotes the set of all positive real numbers.
6 Ex. x + 4 > 9 is not a statement because its truth (or falsity) depends on what value we assign to x. Ex. If we do not define who she is, then She is a student at Ryerson is technically not a statement. Such statements are called predicates. They are not statements unless we interpret the variables in them as particular elements of some prescribed set.
7 DEFINITION: A predicate is a sentence that contains a finite number of variables and becomes a statement once these variables are assigned specific values. The domain of a predicate variable is the set of all values that can be substituted for the variable. Suppose P(x) is the predicate x + 4 > 9 the domain can be any set of numbers (R, Z,...,) in which its operations (+,,... ) make sense. A predicate could involve any number of variables, for example Q(x, y) is the predicate x is divisible by y 3.
8 DEFINITION: If P(x) is a predicate whose truth domain is D, the truth set of P(x) is the set of all elements of D which make P(x) true when they are substituted for x. We write the truth set for P(x) as {x D P(x)} which we read as the set of all x in D such that P(x) is true. Ex. Let Q(n) be the predicate n divides 5 If the truth domain is Z, then the truth set is { 5, 1, 1, 5} If the truth domain is N then the truth set is {1, 5}
9 One way to turn a predicate P(x) into a statement is to use the universal quantifier, which is the symbol and means for all ( for any, for each ). DEFINITION: Let Q(x) be a predicate and D be the truth domain for x. A universal statement is a statement of the form x D, Q(x). It is true if and only if Q(x) is true for every x in D. If there is any x in D for which Q(x) is false, the universal statement will be false. The value of x for which Q(x) is false is called a counterexample for the universal statement.
10 Ex. Let D = { 5, 8, 9, 11} and consider the statement x D, x 2 + x > 2 Show that this statement is true: Solution: We check that x 2 + x > 2 is true for all x D. (This is called the method of exhaustion) x D, x 2 + x > 2 is true. ( 5) 2 + ( 5) > > > > 2
11 Ex. Now show that x R, x 2 + x > 2 is false Solution: It suffices to find one value of x R for which it is not the case that x 2 + x > 2. In other words, we are looking for a counterexample in R. One such counterexample is x = 1: ( 1) 2 + ( 1) 2 Therefore x R, x 2 + x > 2 is false.
12 Another way to turn a predicate Q(x) into a statement is to use the existential quantifier,, which means there exists ( there is a, for some, there is at least one ). DEFINITION: Let Q(x) be a predicate and D the truth domain of x. An existential statement is a statement of the form x D such that Q(x). It is true if and only if Q(x) is true for at least one element of x of D. It will be false if Q(x) is false for all x D.
13 Ex. Show that the statement n Z such that n 2 = n is true. Solution: It suffices to find one integer such that n 2 = n. Obviously, one such integer is n = 1. Ex. Given the truth domain A = {2, 7, 3, 5}, show that the existential statement n A such that n 2 = n is false. Solution: Clearly ( 7) Since there is no element n A for which n 2 = n, this existential statement is false.
14 Given a statement involving quantifiers, it is generally possible to translate it into English in a variety of ways: Ex. x R, x 2 0 This can be translated as The square of every real number is non-negative. Every real number has a non-negative square. x has a non-negative square, for any real number x. No real number can have a negative square.
15 One of the most common types of universal statements is the universal conditional statement: x, if P(x) then Q(x). Ex. Translate the following statements: (a) x R, if x 3, then x 2 9 translation: if a real number is at least 3, then its square is at least 9. (b) no bird is a mammal translation: x, if x is a bird, then x is not a mammal.
16 Consider the statement x, if x Z, then x Q. We can rewrite it as: x Z, x Q. [we restricted the truth domain to integers] Consider the statement x D, P(x). We can rewrite it as: x, if x D, then P(x).
17 Consider the statement if a number is an integer, then it is a rational number. Although it is a universal statement, it does not contain the key words all or every or any or each. This is an example of an implicit universal quantification. Consider the statement the number 24 can be written as a sum of two even integers. This is an example of an implicit existential quantification and we could rewrite it as even integers m and n such that 24 = m + n.
18 DEFINITION: If P(x) and Q(x) are predicates with the same domain D, the notation P(x) Q(x) means that every element of x D which is in the truth set for P(x) is also in the truth set of Q(x). Equivalently, x, P(x) Q(x). The notation P(x) Q(x) means that the universal statement x, P(x) Q(x) is true (P(x) and Q(x) have the same truth sets).
19 Ex. Let Q(n) be n is a factor of 8 ; R(n) be n is a factor of 4 ; S(n) be n < 5 and n 3 and suppose the domain of n is N. The truth sets are: Q(n) : {1, 2, 4, 8} R(n) : {1, 2, 4} S(n) : {1, 2, 4} Then R(n) S(n), R(n) Q(n), S(n) Q(n).
20 2.2 - Introduction to Predicates and Quantified Statements II
21 NEGATION OF A UNIVERSAL STATEMENT THEOREM: The negation of a statement of the form x D, Q(x) is logically equivalent to a statement of the form x D such that Q(x). We can write it as ( ) x D, Q(x) x D such that Q(x). Ex. the negation of All engineering students must take calculus is there are some engineering students who do not have to take calculus.
22 Ex. the negation of primes p, p is odd is a prime p such that p is not odd. NEGATION OF AN EXISTENTIAL STATEMENT THEOREM: The negation of a statement of the form x D such that Q(x) is logically equivalent to a statement of the form x D, Q(x). We can write it as ( ) x D such that Q(x) x D, Q(x).
23 Ex. the negation of some birds are mammals is no birds are mammals. Ex. the negation of a triangle T such that the sum of the angles of T equals 200 o is triangles T, the sum of the angles of T does not equal 200 o.
24 Suppose we want to negate a universal conditional statement x, P(x) Q(x). Then ( ) ( ) x, P(x) Q(x) x such that P(x) Q(x). But, So ( ) P(x) Q(x) ( ) x, P(x) Q(x) P(x) Q(x) x such that ( ) P(x) Q(x).
25 Ex. The negation of integers n, if n is even, then n is divisible by 4 is divisible by 4. an integer n such that n is even and n is not Ex. The negation of a person p such that p is blond and p does not have blue eyes is people p, if p is blond then p has blue eyes.
26 Suppose we are looking at quantified statements which refer to a finite domain D = {x 1, x 2,..., x n }. Saying the statement x D, P(x) is true, is equivalent to saying that P(x) is true for every x i D: P(x 1 ) P(x 2 ) P(x n ). Saying the statement x D such that P(x) is equivalent to the saying that P(x) is true for some x i D: P(x 1 ) P(x 2 ) P(x n ).
27 Ex. Suppose D = {1, 1} where P(x) is the predicate x 2 = 1 and Q(x) is the predicate x 2 = x. Then x D, P(x) is true because P(1) P( 1) is true. And x D such that Q(x) is true because Q(1) Q( 1) is true. If we have a universal statement x D, if P(x) then Q(x), then the statement is vacuously true if and only if P(x) is false for every x D.
28 DEFINITION: Consider a universal conditional statement x D, if P(x) then Q(x). (1) Its contrapositive is x D, if Q(x) then P(x). (2) Its converse is x D, if Q(x) then P(x). (3) Its inverse x D, if P(x) then Q(x). Ex. Consider the statement x R, if x > 2 then 3x + 2 > 8. Contrapositive: x R, if 3x then x 2. Converse: x R, if 3x + 2 > 8 then x > 2. Inverse: x R, if x 2 then 3x
29 The usual equivalences (and non-equivalences) are also true for universal conditional statements; namely: conditional statement its contrapositive conditional statement its converse conditional statement its inverse converse inverse.
30 Ex. Negate the following statements: Added: January 22 (1) some people like red" it is not true that some people like red no people like red people p, p does not like red (2) all dogs are loyal it is not true that all dogs are loyal some dogs are disloyal a dog d such that d is disloyal (3) The sum of any two irrational numbers is irrational it is not true that the sum of any two irrational numbers is irrational" there are some irrational numbers whose sum is rational irrational numbers m, n such that m + n is rational
31 Added: January 22 (4) The product of any irrational number and any rational number is irrational It is not true that the product of any irrational number and rational number is irrational there exists an irrational number and a rational number whose product is not irrational
32 Consider rewording the original sentence: Added: January 22 rational numbers q and irrational numbers i, (q i) is irrational q Q and i I, (q i) I (where I is the set of irrational numbers) The negation was: there exists an irrational number and a rational number whose product is not irrational" In other words: q Q and i I such that (q i) / I Generally, ( x D, Q(x)) x D such that Q(x) and ( x D such that Q(x)) x D, Q(x)
33 Added: January 22 (5) For all integers n, if n 2 is even then n is even. It is not true that for all integers n, if n 2 is even then n is even. ambiguous So how to we negate conditional statements? Let Q(n) be if n 2 is even, then n is even. So our statement becomes integers n, Q(n). The negation is: it is not true that integers n, Q(n) Or simply some integer n such that Q(n) ( ) Now we need to negate Q(n): if n 2 is even, then n is even
34 ( ) if n 2 is even, then n is even Added: January 22 We did this back in Section 1.2: ( (p q) ( p q) ( p) ( q) p q ) if n 2 is even, then n is even n 2 is even and n is odd
35 Added: January 22 So back to the question: (5) For all integers n, if n 2 is even then n is even. We gave the negation to be: some integer n such that Q(n) But Q(n) is n 2 is even and n is odd We now have: some integer n such that n 2 is even and n is odd. In ( general, ) x D, if P(x) then Q(x) x D such that P(x) and Q(x)
36 Added: January 22 (6) people p, if p is blond, then p has blue eyes. Again, we can treat this as people p, Q(p). Then the negation is people p such that Q(p). Which is simply people p such that p is blond and p does not have blue eyes.
37 Added: January 22 Ex. Negate the following: (7) If an integer is divisible by 2, then it is even. (8) For every real number x, if x(x + 1) > 0 then x > 0 or x < 1
38 Added: January 22 Ex. Negate the following: (7) If an integer is divisible by 2, then it is even. Equivalently, x Z, if x is divisible by 2, then x is even. x Z, if P(x) then Q(x) Negation: x Z such that P(x) and Q(x) Answer: x Z such that x is divisible by 2 and x is not even.
39 Added: January 22 (8) For every real number x, if x(x + 1) > 0 then x > 0 or x < 1 Equivalently, x R, if P(x) then Q(x) where P(x) = x(x + 1) > 0 and Q(x) = x > 0 or x < 1 Negation: x R such that P(x) and Q(x). DeMorgan s ( Law: ) (x > 0) (x < 1) (x > 0) (x < 1) (x 0) (x 1) Answer: x R such that x(x + 1) > 0 and both x 0 and x 1
40 Modified: January 22 DEFINITION: (1) x, P(x) is a sufficient condition for Q(x) means x, if P(x) then Q(x). Ex. people p, if p is eligible to vote, then p is at least 18 years old. The truth of the condition of p is eligible to vote" is sufficient to ensure the truth of the condition p is at least 18 years old." (2) x, P(x) only if Q(x) means x, if Q(x), then P(x) or, equivalently x, if P(x) then Q(x).
41 Modified: January 22 (3) x, P(x) is a necessary condition for Q(x) means x, if P(x) then Q(x) or equivalently x, if Q(x) then P(x). Ex. vote. people p, if p is at least 18 years old then p is eligible to The condition of p is at least 18 years old" is necessary for the condition p is eligible to vote." If p were younger than 18, then p would not be eligible to vote.
42 Modified: January 22
43 Ex. Rewrite each as a universal conditional statement: (a) Squareness is a sufficient condition for rectangularity. x, if x is a square, then x is a rectangle. (b) A product of two integers is odd only if both of them are odd. m, n Z, if mn is odd, then m, n are both odd
44 2.3 - Statements Containing Multiple Quantifiers
45 Consider the statement x R, y R, such that x < y What it means: For every real number x, there is a larger real number y. (TRUE) Consider the statement y R, such that x R, x < y What it means: There exists a real number y such that it is larger than any real number x. (FALSE) Conclusion: By reversing the order of quantifiers in a statement, that statement may change considerably.
46 Question: Given a statement of the form x D, y E such that P(x, y) or x D such that y E, P(x, y) how do we verify whether such a statement is true or false?
47 To check the truth value of the statement we can think of it as a game: x D, y E such that P(x, y) allow someone else to pick any element x D. you must respond by finding an element y E that works for that particular x. if you have no response, then you lose and the statement must be false. If you can always respond with a good choice of y, then you win and the statement is true.
48 Ex.2.3, 9 Let D = E = { 2, 1, 0, 1, 2} Is the following true? x D, y E such that x + y = 0 For each element in D, we must be able to find an element in E that makes the sum of the two elements equal to 0: If x = 2, then we choose y = 2 If x = 1, then we choose y = 1 If x = 0, then we choose y = 0 If x = 1, then we choose y = 1 If x = 2, then we choose y = 2 Yes, the statement is true. [Alternately, for each integer x D, the integer x is in D as well, including 0 and for all integers x, x + ( x) = 0.]
49 To check the truth value of the statement we can think of it as a game: x D, such that y E, P(x, y) we choose one fixed element x D your opponent tries to find a value of y E for which P(x, y) fails if your opponent can find no such value for y, then you have won and the statement is true. If your opponent finds a y E which disproves P(x, y), then you have lost and the statement is false.
50 Ex. 2.3, 9 Let D = E = { 2, 1, 0, 1, 2}. Is the following true? x D such that y E, x + y = y Let us choose x = 0. Then 0 + y = y for any y E because the elements of E are real numbers.
51 The reciprocal of a real number a is a real number b such that ab = 1. Ex. Rewrite these true statements using quantifiers and variables: (a) Every nonzero real number has a reciprocal nonzero real number x, y R such that xy = 1. (b) There is a real number with no reciprocal z R such that u R, zu 1. (c) There is a smallest positive integer m N such that n N, m n.
52 Suppose we want to negate the statement x D, y E such that P(x, y) Then, we have ( ) x D, y E such that P(x, y) x D such that ( ) y E such that P(x, y) x D such that y E, P(x, y) Similarly, ( we can show that ) x D such that y E, P(x, y) x D, y E such that P(x, y).
53 As we have seen, the order of quantifiers matters. However, if the quantifiers are identical, then the order is irrelevant. Ex. x R and y R, x y = y x is logically equivalent to y R and x R, x y = y x (similarly if there are two existential quantifiers). Note: The following is also true ( ) (1) x D, P(x) x x D P(x) ( ) (2) x D, P(x) x x D P(x).
54 Added: January 22 ( ) (1) x D, P(x) x x D P(x) Ex. For every x Z, 3x is positive. ( ) Equivalently, x, if x Z then 3x is positive ( ) (2) x D, P(x) x x D P(x). Ex. There exists a black dog d such that d has brown eyes. ( ) Equivalently, a dog d d D and d has brown eyes where D is the set of all black dogs.
THE LOGIC OF QUANTIFIED STATEMENTS
CHAPTER 3 THE LOGIC OF QUANTIFIED STATEMENTS Copyright Cengage Learning. All rights reserved. SECTION 3.2 Predicates and Quantified Statements II Copyright Cengage Learning. All rights reserved. Negations
More informationTHE LOGIC OF QUANTIFIED STATEMENTS. Predicates and Quantified Statements I. Predicates and Quantified Statements I CHAPTER 3 SECTION 3.
CHAPTER 3 THE LOGIC OF QUANTIFIED STATEMENTS SECTION 3.1 Predicates and Quantified Statements I Copyright Cengage Learning. All rights reserved. Copyright Cengage Learning. All rights reserved. Predicates
More informationSection Summary. Section 1.5 9/9/2014
Section 1.5 Section Summary Nested Quantifiers Order of Quantifiers Translating from Nested Quantifiers into English Translating Mathematical Statements into Statements involving Nested Quantifiers Translated
More informationChapter 3. The Logic of Quantified Statements
Chapter 3. The Logic of Quantified Statements 3.1. Predicates and Quantified Statements I Predicate in grammar Predicate refers to the part of a sentence that gives information about the subject. Example:
More informationTHE LOGIC OF QUANTIFIED STATEMENTS
CHAPTER 3 THE LOGIC OF QUANTIFIED STATEMENTS Copyright Cengage Learning. All rights reserved. SECTION 3.1 Predicates and Quantified Statements I Copyright Cengage Learning. All rights reserved. Predicates
More informationQuantifiers. P. Danziger
- 2 Quantifiers P. Danziger 1 Elementary Quantifiers (2.1) We wish to be able to use variables, such as x or n in logical statements. We do this by using the two quantifiers: 1. - There Exists 2. - For
More information5. Use a truth table to determine whether the two statements are equivalent. Let t be a tautology and c be a contradiction.
Statements Compounds and Truth Tables. Statements, Negations, Compounds, Conjunctions, Disjunctions, Truth Tables, Logical Equivalence, De Morgan s Law, Tautology, Contradictions, Proofs with Logical Equivalent
More informationSection 2.1: Introduction to the Logic of Quantified Statements
Section 2.1: Introduction to the Logic of Quantified Statements In the previous chapter, we studied a branch of logic called propositional logic or propositional calculus. Loosely speaking, propositional
More informationLecture 3. Logic Predicates and Quantified Statements Statements with Multiple Quantifiers. Introduction to Proofs. Reading (Epp s textbook)
Lecture 3 Logic Predicates and Quantified Statements Statements with Multiple Quantifiers Reading (Epp s textbook) 3.1-3.3 Introduction to Proofs Reading (Epp s textbook) 4.1-4.2 1 Propositional Functions
More informationMat 243 Exam 1 Review
OBJECTIVES (Review problems: on next page) 1.1 Distinguish between propositions and non-propositions. Know the truth tables (i.e., the definitions) of the logical operators,,,, and Write truth tables for
More informationPredicate Calculus lecture 1
Predicate Calculus lecture 1 Section 1.3 Limitation of Propositional Logic Consider the following reasoning All cats have tails Gouchi is a cat Therefore, Gouchi has tail. MSU/CSE 260 Fall 2009 1 MSU/CSE
More information3. The Logic of Quantified Statements Summary. Aaron Tan August 2017
3. The Logic of Quantified Statements Summary Aaron Tan 28 31 August 2017 1 3. The Logic of Quantified Statements 3.1 Predicates and Quantified Statements I Predicate; domain; truth set Universal quantifier,
More informationSteinhardt School of Culture, Education, and Human Development Department of Teaching and Learning. Mathematical Proof and Proving (MPP)
Steinhardt School of Culture, Education, and Human Development Department of Teaching and Learning Terminology, Notations, Definitions, & Principles: Mathematical Proof and Proving (MPP) 1. A statement
More informationQuantifiers. Alice E. Fischer. CSCI 1166 Discrete Mathematics for Computing February, 2018
Quantifiers Alice E. Fischer CSCI 1166 Discrete Mathematics for Computing February, 2018 Alice E. Fischer Quantifiers... 1/34 1 Predicates and their Truth Sets Sets of Numbers 2 Universal Quantifiers Existential
More informationRecall that the expression x > 3 is not a proposition. Why?
Predicates and Quantifiers Predicates and Quantifiers 1 Recall that the expression x > 3 is not a proposition. Why? Notation: We will use the propositional function notation to denote the expression "
More informationMATH 215 Discrete Mathematics Worksheets. Which of these are propositions? What are the truth values of those that are propositions?
Which of these are propositions? What are the truth values of those that are propositions? 1. Would you like some coffee? 2. I would like coffee with cream and sugar. 3. Either Mom or Dad will pick me
More informationChapter 2: The Logic of Quantified Statements
Chapter 2: The Logic of Quantified Statements Topics include 2.1, 2.2 Predicates and Quantified Statements, 2.3 Statements with Multiple Quantifiers, and 2.4 Arguments with Quantified Statements. cs1231y
More informationConnectives Name Symbol OR Disjunction And Conjunction If then Implication/ conditional If and only if Bi-implication / biconditional
Class XI Mathematics Ch. 14 Mathematical Reasoning 1. Statement: A sentence which is either TRUE or FALSE but not both is known as a statement. eg. i) 2 + 2 = 4 ( it is a statement which is true) ii) 2
More informationDiscrete Mathematics and Its Applications
Discrete Mathematics and Its Applications Lecture 1: The Foundations: Logic and Proofs (1.3-1.5) MING GAO DASE @ ECNU (for course related communications) mgao@dase.ecnu.edu.cn Sep. 19, 2017 Outline 1 Logical
More informationPredicates, Quantifiers and Nested Quantifiers
Predicates, Quantifiers and Nested Quantifiers Predicates Recall the example of a non-proposition in our first presentation: 2x=1. Let us call this expression P(x). P(x) is not a proposition because x
More informationFoundations of Discrete Mathematics
Foundations of Discrete Mathematics Chapter 0 By Dr. Dalia M. Gil, Ph.D. Statement Statement is an ordinary English statement of fact. It has a subject, a verb, and a predicate. It can be assigned a true
More information1.1 Language and Logic
c Oksana Shatalov, Spring 2018 1 1.1 Language and Logic Mathematical Statements DEFINITION 1. A proposition is any declarative sentence (i.e. it has both a subject and a verb) that is either true or false,
More informationRecitation 4: Quantifiers and basic proofs
Math 299 Recitation 4: Quantifiers and basic proofs 1. Quantifiers in sentences are one of the linguistic constructs that are hard for computers to handle in general. Here is a nice pair of example dialogues:
More informationLogical Operators. Conjunction Disjunction Negation Exclusive Or Implication Biconditional
Logical Operators Conjunction Disjunction Negation Exclusive Or Implication Biconditional 1 Statement meaning p q p implies q if p, then q if p, q when p, q whenever p, q q if p q when p q whenever p p
More informationMath Project Group 2 Part 1. Vincent Duarte, Eduardo Trejo, & Darrick Gowens. Math 170. T/Th 10:00am 11:50am. Professor Stanica
Math Project Group 2 Part 1 Vincent Duarte, Eduardo Trejo, & Darrick Gowens Math 170 T/Th 10:00am 11:50am Professor Stanica October 1, 2014 Summary: A predicate is a sentence that contains a finite number
More informationSection 1.3. Let I be a set. When I is used in the following context,
Section 1.3. Let I be a set. When I is used in the following context, {B i } i I, we call I the index set. The set {B i } i I is the family of sets of the form B i where i I. One could also use set builder
More informationWUCT121. Discrete Mathematics. Logic. Tutorial Exercises
WUCT11 Discrete Mathematics Logic Tutorial Exercises 1 Logic Predicate Logic 3 Proofs 4 Set Theory 5 Relations and Functions WUCT11 Logic Tutorial Exercises 1 Section 1: Logic Question1 For each of the
More informationSome Review Problems for Exam 1: Solutions
Math 3355 Fall 2018 Some Review Problems for Exam 1: Solutions Here is my quick review of proof techniques. I will focus exclusively on propositions of the form p q, or more properly, x P (x) Q(x) or x
More information2-4: The Use of Quantifiers
2-4: The Use of Quantifiers The number x + 2 is an even integer is not a statement. When x is replaced by 1, 3 or 5 the resulting statement is false. However, when x is replaced by 2, 4 or 6 the resulting
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics. Introductory Notes in Discrete Mathematics Solution Guide
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics Introductory Notes in Discrete Mathematics Solution Guide Marcel B. Finan c All Rights Reserved 2015 Edition Contents
More informationFirst order Logic ( Predicate Logic) and Methods of Proof
First order Logic ( Predicate Logic) and Methods of Proof 1 Outline Introduction Terminology: Propositional functions; arguments; arity; universe of discourse Quantifiers Definition; using, mixing, negating
More informationCS 220: Discrete Structures and their Applications. Predicate Logic Section in zybooks
CS 220: Discrete Structures and their Applications Predicate Logic Section 1.6-1.10 in zybooks From propositional to predicate logic Let s consider the statement x is an odd number Its truth value depends
More informationBasic Logic and Proof Techniques
Chapter 3 Basic Logic and Proof Techniques Now that we have introduced a number of mathematical objects to study and have a few proof techniques at our disposal, we pause to look a little more closely
More informationDiscrete Structures for Computer Science
Discrete Structures for Computer Science William Garrison bill@cs.pitt.edu 6311 Sennott Square Lecture #4: Predicates and Quantifiers Based on materials developed by Dr. Adam Lee Topics n Predicates n
More informationFor all For every For each For any There exists at least one There exists There is Some
Section 1.3 Predicates and Quantifiers Assume universe of discourse is all the people who are participating in this course. Also let us assume that we know each person in the course. Consider the following
More informationBefore you get started, make sure you ve read Chapter 1, which sets the tone for the work we will begin doing here.
Chapter 2 Mathematics and Logic Before you get started, make sure you ve read Chapter 1, which sets the tone for the work we will begin doing here. 2.1 A Taste of Number Theory In this section, we will
More informationCSI30. Chapter 1. The Foundations: Logic and Proofs Nested Quantifiers
Chapter 1. The Foundations: Logic and Proofs 1.9-1.10 Nested Quantifiers 1 Two quantifiers are nested if one is within the scope of the other. Recall one of the examples from the previous class: x ( P(x)
More informationSolutions to Exercises (Sections )
s to Exercises (Sections 1.1-1.10) Section 1.1 Exercise 1.1.1: Identifying propositions (a) Have a nice day. : Command, not a proposition. (b) The soup is cold. : Proposition. Negation: The soup is not
More information3.6. Disproving Quantified Statements Disproving Existential Statements
36 Dproving Quantified Statements 361 Dproving Extential Statements A statement of the form x D, P( if P ( false for all x D false if and only To dprove th kind of statement, we need to show the for all
More informationSection Summary. Predicate logic Quantifiers. Negating Quantifiers. Translating English to Logic. Universal Quantifier Existential Quantifier
Section 1.4 Section Summary Predicate logic Quantifiers Universal Quantifier Existential Quantifier Negating Quantifiers De Morgan s Laws for Quantifiers Translating English to Logic Propositional Logic
More informationMATH 215 DISCRETE MATHEMATICS INSTRUCTOR: P. WENG
MATH 215 DISCRETE MATHEMATICS INSTRUCTOR: P. WENG Suggested Problems for Logic and Proof The following problems are from Discrete Mathematics and Its Applications by Kenneth H. Rosen. 1. Which of these
More informationTHE LOGIC OF QUANTIFIED STATEMENTS. Statements with Multiple Quantifiers. Statements with Multiple Quantifiers CHAPTER 3 SECTION 3.
CHAPTER 3 THE LOGIC OF QUANTIFIED STATEMENTS SECTION 3.3 Statements with Multiple Quantifiers Copyright Cengage Learning. All rights reserved. Copyright Cengage Learning. All rights reserved. When a statement
More information1.5 MATHEMATICAL LANGUAGE
1.5 MATHEMATICAL LANGUAGE Contemporary Calculus The calculus concepts we will explore in this book are simple and powerful, but sometimes subtle. To succeed in calculus you will have to master some techniques,
More informationThe Process of Mathematical Proof
1 The Process of Mathematical Proof Introduction. Mathematical proofs use the rules of logical deduction that grew out of the work of Aristotle around 350 BC. In previous courses, there was probably an
More informationFull file at
1 Logic and Proofs 1.1 Propositions and Connectives 1. (a) true (b) false (c) true (d) false (e) false (f) false (g) false (h) false 2. (a) Not a proposition (b) False proposition (c) Not a proposition.
More informationLogic and Propositional Calculus
CHAPTER 4 Logic and Propositional Calculus 4.1 INTRODUCTION Many algorithms and proofs use logical expressions such as: IF p THEN q or If p 1 AND p 2, THEN q 1 OR q 2 Therefore it is necessary to know
More informationPacket #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics
CSC 224/226 Notes Packet #2: Set Theory & Predicate Calculus Barnes Packet #2: Set Theory & Predicate Calculus Applied Discrete Mathematics Table of Contents Full Adder Information Page 1 Predicate Calculus
More informationTools for reasoning: Logic. Ch. 1: Introduction to Propositional Logic Truth values, truth tables Boolean logic: Implications:
Tools for reasoning: Logic Ch. 1: Introduction to Propositional Logic Truth values, truth tables Boolean logic: Implications: 1 Why study propositional logic? A formal mathematical language for precise
More informationSection 2.3: Statements Containing Multiple Quantifiers
Section 2.3: Statements Containing Multiple Quantifiers In this section, we consider statements such as there is a person in this company who is in charge of all the paperwork where more than one quantifier
More informationPropositional Logic Not Enough
Section 1.4 Propositional Logic Not Enough If we have: All men are mortal. Socrates is a man. Does it follow that Socrates is mortal? Can t be represented in propositional logic. Need a language that talks
More information1.1 Language and Logic
c Oksana Shatalov, Fall 2017 1 1.1 Language and Logic Mathematical Statements DEFINITION 1. A proposition is any declarative sentence (i.e. it has both a subject and a verb) that is either true or false,
More informationUnit 2: Geometric Reasoning Section 1: Inductive Reasoning
Unit 2: Geometric Reasoning Section 1: Inductive Reasoning Ex #1: Find the next item in the pattern. January, March, May,... Ex #2: Find the next item in the pattern. 7, 14, 21, 28, Ex #3: Find the next
More informationComputer Science Section 1.6
Computer Science 180 Solutions for Recommended Exercises Section 1.6. Let m and n be any two even integers (possibly the same). Then, there exist integers k and l such that m = k and n = l. Consequently,
More informationExercise Set 1 Solutions Math 2020 Due: January 30, Find the truth tables of each of the following compound statements.
1. Find the truth tables of each of the following compound statements. (a) ( (p q)) (p q), p q p q (p q) q p q ( (p q)) (p q) 0 0 0 1 1 1 1 0 1 0 1 0 0 0 1 0 0 1 1 1 1 1 1 1 0 0 1 0 (b) [p ( p q)] [( (p
More informationSection Summary. Predicate logic Quantifiers. Negating Quantifiers. Translating English to Logic. Universal Quantifier Existential Quantifier
Section 1.4 Section Summary Predicate logic Quantifiers Universal Quantifier Existential Quantifier Negating Quantifiers De Morgan s Laws for Quantifiers Translating English to Logic Propositional Logic
More informationSection 3.1: Direct Proof and Counterexample 1
Section 3.1: Direct Proof and Counterexample 1 In this chapter, we introduce the notion of proof in mathematics. A mathematical proof is valid logical argument in mathematics which shows that a given conclusion
More informationPredicate logic. G. Carl Evans. Summer University of Illinois. Propositional Logic Review Predicate logic Predicate Logic Examples
G. Carl Evans University of Illinois Summer 2013 Propositional logic Propositional Logic Review AND, OR, T/F, implies, etc Equivalence and truth tables Manipulating propositions Implication Propositional
More information1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : 5 points
Introduction to Discrete Mathematics 3450:208 Test 1 1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : The inverse of E : The
More informationMathematical Reasoning (Part I) 1
c Oksana Shatalov, Spring 2017 1 Mathematical Reasoning (art I) 1 Statements DEFINITION 1. A statement is any declarative sentence 2 that is either true or false, but not both. A statement cannot be neither
More informationHOMEWORK 1: SOLUTIONS - MATH 215 INSTRUCTOR: George Voutsadakis
HOMEWORK 1: SOLUTIONS - MATH 215 INSTRUCTOR: George Voutsadakis Problem 1 Make truth tables for the propositional forms (P Q) (P R) and (P Q) (R S). Solution: P Q R P Q P R (P Q) (P R) F F F F F F F F
More informationDiscrete Mathematics & Mathematical Reasoning Predicates, Quantifiers and Proof Techniques
Discrete Mathematics & Mathematical Reasoning Predicates, Quantifiers and Proof Techniques Colin Stirling Informatics Some slides based on ones by Myrto Arapinis Colin Stirling (Informatics) Discrete Mathematics
More informationMATH 271 Summer 2016 Practice problem solutions Week 1
Part I MATH 271 Summer 2016 Practice problem solutions Week 1 For each of the following statements, determine whether the statement is true or false. Prove the true statements. For the false statement,
More informationProof techniques (section 2.1)
CHAPTER 1 Proof techniques (section 2.1) What we have seen so far: 1.1. Theorems and Informal proofs Argument: P 1 P n Q Syntax: how it's written Semantic: meaning in a given interpretation Valid argument:
More informationCS100: DISCRETE STRUCTURES. Lecture 5: Logic (Ch1)
CS100: DISCREE SRUCURES Lecture 5: Logic (Ch1) Lecture Overview 2 Statement Logical Connectives Conjunction Disjunction Propositions Conditional Bio-conditional Converse Inverse Contrapositive Laws of
More informationIntroduction to Sets and Logic (MATH 1190)
Introduction to Sets Logic () Instructor: Email: shenlili@yorku.ca Department of Mathematics Statistics York University Sept 18, 2014 Outline 1 2 Tautologies Definition A tautology is a compound proposition
More informationICS141: Discrete Mathematics for Computer Science I
ICS141: Discrete Mathematics for Computer Science I Dept. Information & Computer Sci., Originals slides by Dr. Baek and Dr. Still, adapted by J. Stelovsky Based on slides Dr. M. P. Frank and Dr. J.L. Gross
More informationLogic Overview, I. and T T T T F F F T F F F F
Logic Overview, I DEFINITIONS A statement (proposition) is a declarative sentence that can be assigned a truth value T or F, but not both. Statements are denoted by letters p, q, r, s,... The 5 basic logical
More informationPredicates and Quantifiers. CS 231 Dianna Xu
Predicates and Quantifiers CS 231 Dianna Xu 1 Predicates Consider P(x) = x < 5 P(x) has no truth values (x is not given a value) P(1) is true 1< 5 is true P(10) is false 10 < 5 is false Thus, P(x) will
More informationChapter 1 Elementary Logic
2017-2018 Chapter 1 Elementary Logic The study of logic is the study of the principles and methods used in distinguishing valid arguments from those that are not valid. The aim of this chapter is to help
More informationDiscrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 1
EECS 70 Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 1 Getting Started In order to be fluent in mathematical statements, you need to understand the basic framework of the language
More informationSTRATEGIES OF PROBLEM SOLVING
STRATEGIES OF PROBLEM SOLVING Second Edition Maria Nogin Department of Mathematics College of Science and Mathematics California State University, Fresno 2014 2 Chapter 1 Introduction Solving mathematical
More informationProofs. Chapter 2 P P Q Q
Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,
More informationCSE 20 Discrete Math. Winter, January 24 (Day 5) Number Theory. Instructor: Neil Rhodes. Proving Quantified Statements
CSE 20 Discrete Math Proving Quantified Statements Prove universal statement: x D, P(x)Q(x) Exhaustive enumeration Generalizing from the generic particular Winter, 2006 Suppose x is in D and P(x) Therefore
More informationPredicate Logic. CSE 191, Class Note 02: Predicate Logic Computer Sci & Eng Dept SUNY Buffalo
Predicate Logic CSE 191, Class Note 02: Predicate Logic Computer Sci & Eng Dept SUNY Buffalo c Xin He (University at Buffalo) CSE 191 Discrete Structures 1 / 22 Outline 1 From Proposition to Predicate
More informationImplications, Quantifiers, and Venn Diagrams. Implications Logical Quantifiers Venn Diagrams. Different Ways of Stating Implications
E6 PPENDIX E Introduction to Logic E.2 Implications, Quantifiers, and Venn Diagrams Implications Logical Quantifiers Venn Diagrams Implications statement of the form If p, then q is called an implication
More informationWe have seen that the symbols,,, and can guide the logical
CHAPTER 7 Quantified Statements We have seen that the symbols,,, and can guide the logical flow of algorithms. We have learned how to use them to deconstruct many English sentences into a symbolic form.
More informationQuantifiers Here is a (true) statement about real numbers: Every real number is either rational or irrational.
Quantifiers 1-17-2008 Here is a (true) statement about real numbers: Every real number is either rational or irrational. I could try to translate the statement as follows: Let P = x is a real number Q
More information2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional Logic
CS 103 Discrete Structures Chapter 1 Propositional Logic Chapter 1.1 Propositional Logic 1 1.1 Propositional Logic Definition: A proposition :is a declarative sentence (that is, a sentence that declares
More informationMath 38: Graph Theory Spring 2004 Dartmouth College. On Writing Proofs. 1 Introduction. 2 Finding A Solution
Math 38: Graph Theory Spring 2004 Dartmouth College 1 Introduction On Writing Proofs What constitutes a well-written proof? A simple but rather vague answer is that a well-written proof is both clear and
More informationLecture 3 : Predicates and Sets DRAFT
CS/Math 240: Introduction to Discrete Mathematics 1/25/2010 Lecture 3 : Predicates and Sets Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last time we discussed propositions, which are
More informationDiscrete Mathematical Structures: Theory and Applications
Chapter 1: Foundations: Sets, Logic, and Algorithms Discrete Mathematical Structures: Theory and Applications Learning Objectives Learn about sets Explore various operations on sets Become familiar with
More informationCMPSCI 250: Introduction to Computation. Lecture 11: Proof Techniques David Mix Barrington 5 March 2013
CMPSCI 250: Introduction to Computation Lecture 11: Proof Techniques David Mix Barrington 5 March 2013 Proof Techniques Review: The General Setting for Proofs Types of Proof: Direct, Contraposition, Contradiction
More informationMathematics 220 Midterm Practice problems from old exams Page 1 of 8
Mathematics 220 Midterm Practice problems from old exams Page 1 of 8 1. (a) Write the converse, contrapositive and negation of the following statement: For every integer n, if n is divisible by 3 then
More informationFoundation of proofs. Jim Hefferon.
Foundation of proofs Jim Hefferon http://joshua.smcvt.edu/proofs The need to prove In Mathematics we prove things To a person with a mathematical turn of mind, the base angles of an isoceles triangle are
More informationChapter 1: The Logic of Compound Statements. January 7, 2008
Chapter 1: The Logic of Compound Statements January 7, 2008 Outline 1 1.1 Logical Form and Logical Equivalence 2 1.2 Conditional Statements 3 1.3 Valid and Invalid Arguments Central notion of deductive
More informationProof by Contradiction
Proof by Contradiction MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Proof by Contradiction Fall 2014 1 / 12 Outline 1 Proving Statements with Contradiction 2 Proving
More informationDISCRETE MATH: FINAL REVIEW
DISCRETE MATH: FINAL REVIEW DR. DANIEL FREEMAN 1) a. Does 3 = {3}? b. Is 3 {3}? c. Is 3 {3}? c. Is {3} {3}? c. Is {3} {3}? d. Does {3} = {3, 3, 3, 3}? e. Is {x Z x > 0} {x R x > 0}? 1. Chapter 1 review
More informationPredicate Calculus. Lila Kari. University of Waterloo. Predicate Calculus CS245, Logic and Computation 1 / 59
Predicate Calculus Lila Kari University of Waterloo Predicate Calculus CS245, Logic and Computation 1 / 59 Predicate Calculus Alternative names: predicate logic, first order logic, elementary logic, restricted
More informationDiscrete Mathematical Structures. Chapter 1 The Foundation: Logic
Discrete Mathematical Structures Chapter 1 he oundation: Logic 1 Lecture Overview 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Quantifiers l l l l l Statement Logical Connectives Conjunction
More informationConjunction: p q is true if both p, q are true, and false if at least one of p, q is false. The truth table for conjunction is as follows.
Chapter 1 Logic 1.1 Introduction and Definitions Definitions. A sentence (statement, proposition) is an utterance (that is, a string of characters) which is either true (T) or false (F). A predicate is
More informationThinking of Nested Quantification
Section 1.5 Section Summary Nested Quantifiers Order of Quantifiers Translating from Nested Quantifiers into English Translating Mathematical Statements into Statements involving Nested Quantifiers. Translating
More informationMath 3336: Discrete Mathematics Practice Problems for Exam I
Math 3336: Discrete Mathematics Practice Problems for Exam I The upcoming exam on Tuesday, February 26, will cover the material in Chapter 1 and Chapter 2*. You will be provided with a sheet containing
More informationCOMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University
COMP 182 Algorithmic Thinking Proofs Luay Nakhleh Computer Science Rice University 1 Reading Material Chapter 1, Section 3, 6, 7, 8 Propositional Equivalences The compound propositions p and q are called
More informationECOM Discrete Mathematics
ECOM 2311- Discrete Mathematics Chapter # 1 : The Foundations: Logic and Proofs Fall, 2013/2014 ECOM 2311- Discrete Mathematics - Ch.1 Dr. Musbah Shaat 1 / 85 Outline 1 Propositional Logic 2 Propositional
More information1 Predicates and Quantifiers
1 Predicates and Quantifiers We have seen how to represent properties of objects. For example, B(x) may represent that x is a student at Bryn Mawr College. Here B stands for is a student at Bryn Mawr College
More informationDiscrete Structures Lecture 5
Introduction EXAMPLE 1 Express xx yy(xx + yy = 0) without the existential quantifier. Solution: xx yy(xx + yy = 0) is the same as xxxx(xx) where QQ(xx) is yyyy(xx, yy) and PP(xx, yy) = xx + yy = 0 EXAMPLE
More informationDiscrete Mathematics Exam File Spring Exam #1
Discrete Mathematics Exam File Spring 2008 Exam #1 1.) Consider the sequence a n = 2n + 3. a.) Write out the first five terms of the sequence. b.) Determine a recursive formula for the sequence. 2.) Consider
More informationSection Summary. Proof by Cases Existence Proofs
Section 1.8 1 Section Summary Proof by Cases Existence Proofs Constructive Nonconstructive Disproof by Counterexample Uniqueness Proofs Proving Universally Quantified Assertions Proof Strategies sum up
More informationDirect Proof and Proof by Contrapositive
Dr. Nahid Sultana October 14, 2012 Consider an implication: p q. Then p q p q T T T T F F F T T F F T Consider an implication: p q. Then p q p q T T T T F F F T T F F T Consider x D, p(x) q(x). It can
More informationSection A (not in the text) Which of the following are statements? Explain. 3. The President of the United States in 2089 will be a woman.
Math 299 Homework Assignment, Chapter 2 Section 2.1 2.A (not in the text) Which of the following are statements? Explain. 1. Let x be a positive integer. Then x is rational. 2. Mathematics is fun. 3. The
More information