Predicates and Quantifiers

Similar documents
Conditional Statements

Direct Proof Universal Statements

Negations of Quantifiers

Direct Proof Divisibility

Direct Proof Divisibility

Direct Proof Floor and Ceiling

Instantaneous Rate of Change

Composition of Functions

Nondeterministic Finite Automata

Direct Proof Division into Cases

Closure Properties of Regular Languages

Confidence Intervals for Proportions Sections 22.2, 22.3

The Pairwise-Comparison Method

Compound Interest. Lecture 34 Section 4.1. Robb T. Koether. Hampden-Sydney College. Tue, Mar 28, 2017

Vector Operations. Lecture 19. Robb T. Koether. Hampden-Sydney College. Wed, Oct 7, 2015

Direct Proof Rational Numbers

Elementary Logic and Proof

Maximums and Minimums

Paired Samples. Lecture 37 Sections 11.1, 11.2, Robb T. Koether. Hampden-Sydney College. Mon, Apr 2, 2012

Strong Mathematical Induction

Independent Samples: Comparing Means

The Interpretation of λ

ON1 Big Mock Test 4 October 2013 Answers This test counts 4% of assessment for the course. Time allowed: 10 minutes

1.1 Language and Logic

Introduction to Sets and Logic (MATH 1190)

ICS141: Discrete Mathematics for Computer Science I

Sampling Distribution of a Sample Proportion

3. The Logic of Quantified Statements Summary. Aaron Tan August 2017

2-4: The Use of Quantifiers

Sampling Distribution of a Sample Proportion

Conjunction: 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.

Logical Operators. Conjunction Disjunction Negation Exclusive Or Implication Biconditional

1.1 Language and Logic

Predicate Calculus lecture 1

Logic and Proof. On my first day of school my parents dropped me off at the wrong nursery. There I was...surrounded by trees and bushes!

Introduction to Decision Sciences Lecture 2

On my first day of school my parents dropped me off at the wrong nursery. There I was...surrounded by trees and bushes! 26-Aug-2011 MA

HOMEWORK 1: SOLUTIONS - MATH 215 INSTRUCTOR: George Voutsadakis

Mathematical Reasoning (Part I) 1

Steinhardt School of Culture, Education, and Human Development Department of Teaching and Learning. Mathematical Proof and Proving (MPP)

THE LOGIC OF QUANTIFIED STATEMENTS

Review. Propositional Logic. Propositions atomic and compound. Operators: negation, and, or, xor, implies, biconditional.

THE LOGIC OF QUANTIFIED STATEMENTS. Predicates and Quantified Statements I. Predicates and Quantified Statements I CHAPTER 3 SECTION 3.

The Cobb-Douglas Production Functions

software design & management Gachon University Chulyun Kim

Predicate Logic. Andreas Klappenecker

CHAPTER 1. MATHEMATICAL LOGIC 1.1 Fundamentals of Mathematical Logic

MAT 243 Test 1 SOLUTIONS, FORM A

Discrete Mathematics and Its Applications

5. Use a truth table to determine whether the two statements are equivalent. Let t be a tautology and c be a contradiction.

Review for Midterm 1. Andreas Klappenecker

CSC Discrete Math I, Spring Propositional Logic

Lecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)

1 The Foundation: Logic and Proofs

Announcement. Homework 1

Chapter 2: The Logic of Quantified Statements. January 22, 2010

Direct Proof and Proof by Contrapositive


Math Fundamentals of Higher Math

1 The Foundation: Logic and Proofs

Section 3.1: Direct Proof and Counterexample 1

Binary Search Trees. Lecture 29 Section Robb T. Koether. Hampden-Sydney College. Fri, Apr 8, 2016

CS100: DISCRETE STRUCTURES. Lecture 5: Logic (Ch1)

Solutions to Exercises (Sections )

SASD Curriculum Map Content Area: MATH Course: Math 7

MAT2345 Discrete Math

Propositional Equivalence

Discrete Mathematics & Mathematical Reasoning Predicates, Quantifiers and Proof Techniques

CSCI Homework Set 1 Due: September 11, 2018 at the beginning of class

For all For every For each For any There exists at least one There exists There is Some

Discrete Mathematical Structures. Chapter 1 The Foundation: Logic

Group 5. Jeremy Gutierrez. Jesus Ochoa Perez. Alvaro Gonzalez. MATH 170: Discrete Mathematics. Dr. Lipika Deka. March 14, 2014.

More examples of mathematical. Lecture 4 ICOM 4075

Example. Logic. Logical Statements. Outline of logic topics. Logical Connectives. Logical Connectives

WUCT121. Discrete Mathematics. Logic. Tutorial Exercises

Discrete Mathematics

Mat 243 Exam 1 Review

Exercise Set 1 Solutions Math 2020 Due: January 30, Find the truth tables of each of the following compound statements.

Topics in Logic and Proofs

13.7 ANOTHER TEST FOR TREND: KENDALL S TAU

School Year Calendar,

Math Project Group 2 Part 1. Vincent Duarte, Eduardo Trejo, & Darrick Gowens. Math 170. T/Th 10:00am 11:50am. Professor Stanica

Logic and Proofs. (A brief summary)

Logic and Propositional Calculus

August 2018 ALGEBRA 1

What is the decimal (base 10) representation of the binary number ? Show your work and place your final answer in the box.

Packet #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics

Section Summary. Section 1.5 9/9/2014

What is a proof? Proofing as a social process, a communication art.

Lecture 26 Section 8.4. Wed, Oct 14, 2009

Fibonacci Numbers. November 7, Fibonacci's Task: Figure out how many pairs of rabbits there will be at the end of one year, following rules.

Section 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.

2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional Logic

Discrete distribution. Fitting probability models to frequency data. Hypotheses for! 2 test. ! 2 Goodness-of-fit test

1) The set of the days of the week A) {Saturday, Sunday} B) {Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, Sunday}

Lecture 8 CORRELATION AND LINEAR REGRESSION

cse 311: foundations of computing Fall 2015 Lecture 6: Predicate Logic, Logical Inference

Part I: Propositional Calculus

Predicate Logic. CSE 191, Class Note 02: Predicate Logic Computer Sci & Eng Dept SUNY Buffalo

A statement is a sentence that is definitely either true or false but not both.

Transcription:

Predicates and Quantifiers Lecture 9 Section 3.1 Robb T. Koether Hampden-Sydney College Wed, Jan 29, 2014 Robb T. Koether (Hampden-Sydney College) Predicates and Quantifiers Wed, Jan 29, 2014 1 / 32

1 Predicates 2 The Universal Quantifier 3 The Existential Quantifier 4 Universal Conditional Statements 5 Assignment Robb T. Koether (Hampden-Sydney College) Predicates and Quantifiers Wed, Jan 29, 2014 2 / 32

Outline 1 Predicates 2 The Universal Quantifier 3 The Existential Quantifier 4 Universal Conditional Statements 5 Assignment Robb T. Koether (Hampden-Sydney College) Predicates and Quantifiers Wed, Jan 29, 2014 3 / 32

Predicates We can express statement such as 1 + 2 = 2 + 1 and 1 + 3 = 3 + 1 and 2 + 3 = 3 + 2 and so on, but how do we express the fact that the statement is true for any two numbers? We need a way to express the idea for all numbers in a single statement. Robb T. Koether (Hampden-Sydney College) Predicates and Quantifiers Wed, Jan 29, 2014 4 / 32

Predicates A predicate is a sentence that contains a finite number of variables, and becomes a statement (true or false) when values are substituted for the variables. If the predicate is In the month of x, there is a good chance of snow at HSC, then the predicate becomes true when x = December, January, February, or March and false when x = April,..., November. Predicates may have any number of variables: If the x is y, then my z will w. Robb T. Koether (Hampden-Sydney College) Predicates and Quantifiers Wed, Jan 29, 2014 5 / 32

Domains of Predicate Variables The domain D of a predicate variable x is the set of all values that x may take on. Let P(x) be the predicate. Then x is a free variable. The truth set of P(x) is the set of all values of x D for which P(x) is true. Robb T. Koether (Hampden-Sydney College) Predicates and Quantifiers Wed, Jan 29, 2014 6 / 32

Domains of Predicate Variables In the last example, the domain of x is D = {January, February, March, April, May, June, July, August, September, October, November, December} and the truth set of P(x) is {January, February, March, December}. Robb T. Koether (Hampden-Sydney College) Predicates and Quantifiers Wed, Jan 29, 2014 7 / 32

Outline 1 Predicates 2 The Universal Quantifier 3 The Existential Quantifier 4 Universal Conditional Statements 5 Assignment Robb T. Koether (Hampden-Sydney College) Predicates and Quantifiers Wed, Jan 29, 2014 8 / 32

The Universal Quantifier The symbol is the universal quantifier. The statement x S, P(x) means for all x in S, P(x), where S D. In this case, x is a bound variable, bound by the quantifier. The qualified statement x S, P(x) is either true or false. Robb T. Koether (Hampden-Sydney College) Predicates and Quantifiers Wed, Jan 29, 2014 9 / 32

The Universal Quantifier The statement x S, P(x) is true if P(x) is true for all x in S. The statement is false if P(x) is false for at least one x in S. Robb T. Koether (Hampden-Sydney College) Predicates and Quantifiers Wed, Jan 29, 2014 10 / 32

Examples The statement 7 is a prime number is true. The predicate x is a prime number is neither true nor false. The statement x {2, 3, 5, 7}, x is a prime number is true. The statement x {2, 3, 6, 7}, x is a prime number is false. Robb T. Koether (Hampden-Sydney College) Predicates and Quantifiers Wed, Jan 29, 2014 11 / 32

Examples of Universal Statements x {1, 2,..., 10}, x 2 > 0. x {1, 2,..., 10}, x 2 > 100. x R, x 3 x 0. x R, y R, x 2 + xy + y 2 0. x, x 2 > 100. Robb T. Koether (Hampden-Sydney College) Predicates and Quantifiers Wed, Jan 29, 2014 12 / 32

Algebraic Identities Algebraic identities are universal statements. When we write the algebraic identity (x + 1) 2 = x 2 + 2x + 1 what we mean is x R, (x + 1) 2 = x 2 + 2x + 1. Robb T. Koether (Hampden-Sydney College) Predicates and Quantifiers Wed, Jan 29, 2014 13 / 32

Outline 1 Predicates 2 The Universal Quantifier 3 The Existential Quantifier 4 Universal Conditional Statements 5 Assignment Robb T. Koether (Hampden-Sydney College) Predicates and Quantifiers Wed, Jan 29, 2014 14 / 32

The Existential Quantifier The symbol is the existential quantifier. The statement x S, P(x) means there exists x in S such that P(x), where S D. x is a bound variable, bound by the quantifier. The qualified statement x S, P(x) is either true or false. Robb T. Koether (Hampden-Sydney College) Predicates and Quantifiers Wed, Jan 29, 2014 15 / 32

The Existential Quantifier The statement x S, P(x) is true if P(x) is true for at least one x in S. The statement is false if P(x) is false for all x in S. Robb T. Koether (Hampden-Sydney College) Predicates and Quantifiers Wed, Jan 29, 2014 16 / 32

Examples of Existential Statements x {1, 2,..., 10}, x 2 > 0. x {1, 2,..., 10}, x 2 > 100. x R, x 3 x 0. x R, y R, x 2 + xy + y 2 0. x, x 2 > 100. Robb T. Koether (Hampden-Sydney College) Predicates and Quantifiers Wed, Jan 29, 2014 17 / 32

Algebraic Solutions An algebraic equation has a solution if there exists a value for x that makes it true. x R, (x + 1) 2 = x 2 + x + 2. Robb T. Koether (Hampden-Sydney College) Predicates and Quantifiers Wed, Jan 29, 2014 18 / 32

The Universal and Existential Quantifiers Is it true that x D, P(x) x D, P(x). Robb T. Koether (Hampden-Sydney College) Predicates and Quantifiers Wed, Jan 29, 2014 19 / 32

The Universal and Existential Quantifiers Is it true that x D, P(x) x D, P(x). How can we modify the statement to make it true? Robb T. Koether (Hampden-Sydney College) Predicates and Quantifiers Wed, Jan 29, 2014 19 / 32

Boolean Identities A boolean expression Is not a contradiction if there exist truth values for its variables that make it true. Is not a tautology if there exists truth values for its variables that make if false. The expression p q p q is neither a contradiction nor a tautology. Robb T. Koether (Hampden-Sydney College) Predicates and Quantifiers Wed, Jan 29, 2014 20 / 32

Outline 1 Predicates 2 The Universal Quantifier 3 The Existential Quantifier 4 Universal Conditional Statements 5 Assignment Robb T. Koether (Hampden-Sydney College) Predicates and Quantifiers Wed, Jan 29, 2014 21 / 32

Universal Conditional Statements The statement x S, P(x) Q(x) is a universal conditional statement. Example: x R, if x > 0, then x + 1 x 2. Example: n N, if n 15, then n 2 + 12n 16 > 32n 92. Robb T. Koether (Hampden-Sydney College) Predicates and Quantifiers Wed, Jan 29, 2014 22 / 32

Universal Conditional Statements Suppose that predicates P(x) and Q(x) have the same domain D. If P(x) Q(x) for all x in the truth set of P(x), then we write P(x) Q(x). Robb T. Koether (Hampden-Sydney College) Predicates and Quantifiers Wed, Jan 29, 2014 23 / 32

Examples Examples x > 0 x + 1 x 2. n is a multiple of 6 n is a multiple of 2 and n is a multiple of 3. n is a multiple of 8 n is a multiple of 2 and n is a multiple of 4. Are these statements true if we replace with? Robb T. Koether (Hampden-Sydney College) Predicates and Quantifiers Wed, Jan 29, 2014 24 / 32

Universal Biconditional Statements Suppose that predicates P(x) and Q(x) have the same domain D. If P(x) Q(x) for all x in the truth set of P(x), then we write P(x) Q(x). Robb T. Koether (Hampden-Sydney College) Predicates and Quantifiers Wed, Jan 29, 2014 25 / 32

Examples Which of the following are true? x > 0 x + 1 x 2. n is a multiple of 6 n is a multiple of 2 and n is a multiple of 3. n is a multiple of 8 n is a multiple of 2 and n is a multiple of 4. Robb T. Koether (Hampden-Sydney College) Predicates and Quantifiers Wed, Jan 29, 2014 26 / 32

Solving Algebraic Equations Steps in solving algebraic equations are equivalent to universal conditional statements. The step is justified by the statement x + 3 = 8 x = 5 x + 3 = 8 x = 5. Robb T. Koether (Hampden-Sydney College) Predicates and Quantifiers Wed, Jan 29, 2014 27 / 32

Solving Algebraic Equations An algebraic step from P(x) to Q(x) is reversible only if P(x) Q(x). Reversible steps Adding 1 to both sides. Taking logarithms. Not reversible steps Squaring both sides. Robb T. Koether (Hampden-Sydney College) Predicates and Quantifiers Wed, Jan 29, 2014 28 / 32

Solving Algebraic Equations Correct: The solution to x 1 = 3 is x = 4. The solution to 2 x = 100 is x = log 100 log 2. Incorrect: The solution to x + x = 6 is x = 4 or x = 9. Robb T. Koether (Hampden-Sydney College) Predicates and Quantifiers Wed, Jan 29, 2014 29 / 32

Algebra Puzzler Find the error(s) in the following solution. x x+2 3 x+2 x 1 3 1 + 2 x 1 3 2 x 2 3 1 x 1 3 x 3. Robb T. Koether (Hampden-Sydney College) Predicates and Quantifiers Wed, Jan 29, 2014 30 / 32

Outline 1 Predicates 2 The Universal Quantifier 3 The Existential Quantifier 4 Universal Conditional Statements 5 Assignment Robb T. Koether (Hampden-Sydney College) Predicates and Quantifiers Wed, Jan 29, 2014 31 / 32

Assignment Assignment Read Section 3.1, pages 96-105. Exercises 3, 4, 6, 11, 12, 14, 18, 19, 25, 29, 32, page 106. Robb T. Koether (Hampden-Sydney College) Predicates and Quantifiers Wed, Jan 29, 2014 32 / 32