Quantifiers and Statements

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

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

Quantifiers. P. Danziger

Recall that the expression x > 3 is not a proposition. Why?

THE LOGIC OF QUANTIFIED STATEMENTS

Section Summary. Section 1.5 9/9/2014

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

Section 2.3: Statements Containing Multiple Quantifiers

2-4: The Use of Quantifiers

Lecture 3. Logic Predicates and Quantified Statements Statements with Multiple Quantifiers. Introduction to Proofs. Reading (Epp s textbook)

Section 2.1: Introduction to the Logic of Quantified Statements

Rosen, Discrete Mathematics and Its Applications, 6th edition Extra Examples

Chapter 3. The Logic of Quantified Statements

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

THE LOGIC OF QUANTIFIED STATEMENTS

Section Summary. Predicate logic Quantifiers. Negating Quantifiers. Translating English to Logic. Universal Quantifier Existential Quantifier

Homework assignment 1: Solutions

Mat 243 Exam 1 Review

Statements and Quantifiers

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

Recitation 4: Quantifiers and basic proofs

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

Some Review Problems for Exam 1: Solutions

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

Logical Operators. Conjunction Disjunction Negation Exclusive Or Implication Biconditional

Discrete Mathematics. Instructor: Sourav Chakraborty. Lecture 4: Propositional Logic and Predicate Lo

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

Section 3.1: Direct Proof and Counterexample 1

CHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC

Quantifiers. Alice E. Fischer. CSCI 1166 Discrete Mathematics for Computing February, 2018

1.1 Language and Logic

Lecture Predicates and Quantifiers 1.5 Nested Quantifiers

THE LOGIC OF QUANTIFIED STATEMENTS. Statements with Multiple Quantifiers. Statements with Multiple Quantifiers CHAPTER 3 SECTION 3.

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.

3.6. Disproving Quantified Statements Disproving Existential Statements

Recitation Week 3. Taylor Spangler. January 23, 2012

1.1 Language and Logic

1 Predicates and Quantifiers

1) Let h = John is healthy, w = John is wealthy and s = John is wise Write the following statement is symbolic form

Propositional Logic Not Enough

Predicate in English. Predicates and Quantifiers. Predicate in Logic. Propositional Functions: Prelude. Propositional Function

CHAPTER 0. Introduction

STRATEGIES OF PROBLEM SOLVING

Math 3336: Discrete Mathematics Practice Problems for Exam I

Discrete Mathematics and Its Applications

4 Quantifiers and Quantified Arguments 4.1 Quantifiers

Discrete Structures Lecture Predicates and Quantifiers

The Arithmetic of Reasoning. Chessa Horomanski & Matt Corson

Math.3336: Discrete Mathematics. Nested Quantifiers

MACM 101 Discrete Mathematics I. Exercises on Predicates and Quantifiers. Due: Tuesday, October 13th (at the beginning of the class)

Basic Logic and Proof Techniques

n logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional)

Elementary Linear Algebra, Second Edition, by Spence, Insel, and Friedberg. ISBN Pearson Education, Inc., Upper Saddle River, NJ.

Math 2534 Solution Homework 2 Spring 2017

Reteach Simplifying Algebraic Expressions

Mathematical Reasoning (Part I) 1

Introduction to Decision Sciences Lecture 2

1. Propositions: Contrapositives and Converses

CS 220: Discrete Structures and their Applications. Predicate Logic Section in zybooks

CS Module 1. Ben Harsha Apr 12, 2017

MAT 243 Test 1 SOLUTIONS, FORM A

MATH CSE20 Homework 5 Due Monday November 4

cse541 LOGIC FOR COMPUTER SCIENCE

Foundations of Discrete Mathematics

Predicate Logic. Predicates. Math 173 February 9, 2010

2.2 Analyze Conditional

Chapter 2: Introduction to Propositional Logic

Computer Science 280 Spring 2002 Homework 2 Solutions by Omar Nayeem

Predicate Calculus - Syntax

MAT2345 Discrete Math

Predicates and Quantifiers. Nested Quantifiers Discrete Mathematic. Chapter 1: Logic and Proof

PROBLEM SET 3: PROOF TECHNIQUES

A Brief Introduction to Proofs

Notes from How to Prove it: A Structured Approach by Daniel J. Velleman

Solutions to Problem Set 1

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

Craig Interpolation Theorem for L!1! (or L!! )

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.

Logic and Propositional Calculus

1.3 Predicates and Quantifiers

Section 1.3. Let I be a set. When I is used in the following context,

Announcements CompSci 102 Discrete Math for Computer Science

Today s Lecture. ICS 6B Boolean Algebra & Logic. Predicates. Chapter 1: Section 1.3. Propositions. For Example. Socrates is Mortal

WUCT121. Discrete Mathematics. Logic. Tutorial Exercises

CSE 20 DISCRETE MATH. Fall

CS 173: Discrete Mathematical Structures, Spring 2008 Homework 1 Solutions

Math 10850, fall 2017, University of Notre Dame

The following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof

Discrete Structures for Computer Science

Discrete Mathematics & Mathematical Reasoning Predicates, Quantifiers and Proof Techniques

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

Propositional Logic, Predicates, and Equivalence

Predicate Calculus lecture 1

CSE 20 DISCRETE MATH. Winter

Math 31 Lesson Plan. Day 16: Review; Start Section 8. Elizabeth Gillaspy. October 18, Supplies needed: homework. Colored chalk. Quizzes!

Introducing Proof 1. hsn.uk.net. Contents

Chapter 2: The Logic of Quantified Statements

Tutorial 2 Logic of Quantified Statements

1.2 Inductive Reasoning

Proposi'onal Logic Not Enough

Transcription:

Daniel Aguilar, Jessica Mean, and Marcus Hughes Math 170 Project (Part 1) Quantifiers and Statements There is basic knowledge that you will need to know before you read the project. Such as: A statement is simply a sentence that can either be answered as true or as false. I play basketball is a statement because it can be answered as true or false. Do your homework is not a statement, because it can t be answered as true or false. A predicate is a statement that contains one or more variables ( x) Existential quantifiers indicates that for some value, there is a statement ( x) Universal quantifiers indicates that for all values, there is a statement Other needed knowledge will be provided at the beginning of each problem* Contributing Mathematicians: Charles Sanders Pierce was a philosopher, logician, and engineer who contributed the concept of qualifiers into symbolic logic. In addition, Gottlob Frege, a logician, contributed and introduced the concept of qualifiers as well. Word problems (state the question and other info that breaks down each question part by part) Section 3.1 18.) Let D be the set of all students at your house, and let M(s) be s is a math major, let C(s) be s is a computer science student, and let E(s) be s is an engineering student. Express each of the following statements using quantifiers, variables, and predicates M(s), C(s), and E(s). NOTE: To do these problems you must first read the statement, and try to point out which predicate are being used and which quantifier is being expressed. The domain is being referred to all the students in my house. A.) There is an engineering student who is a math major. There is meaning at least one, and this means that it is an Existential quantifier ( s). an engineering student predicate E(s). who is meaning also, and. a math major predicate M(s). ( s) D, E(s) M(s)

B.) Every computer science student is an engineering student. Every meaning all, and this means that it is a Universal quantifier ( s). is meaning therefore, and. an engineering student predicate E(s). ( s) D, C(s) E(s) C.) No computer science students are engineering students. No meaning none (not all), and this means that it is a Universal quantifier ( s). No negation ~ are meaning therefore, and. an engineering student predicate E(s). ( s) D, ~C(s) E(s) D.) Some computer science students are also math majors. Some meaning at least one, and this means that it is an Existential quantifier ( s). are also meaning therefore, and. math majors predicate M(s). ( s) D, C(s) M(s) E.) Some computer science students are engineering students and some are not. Some meaning at least one, and this means that it is an Existential quantifier ( s).

negation ~ are meaning therefore, and. engineering students predicate E(s). and some are not a new statement that is Existential s, it has a AND, and a [( s) D, C(s) E(s)] [( s) D, C(s) ~E(s)] 32.) Let R be the domain of the predicate variable x. Which of the following are true and which are false? Give counter examples for the statements that are false. NOTE: R, the domain, means that x can be all real numbers A.) x > 2 x > 1 is the sign used for implications and it means then or therefore If x is greater than 2, then x is greater than 1 True. Any number greater than 2 is also greater than 1 B.) x > 2 x 2 > 4 is the sign used for implications and it means then or therefore If x is greater than 2, then x squared is greater than 4 True. Any number that is greater than 2 and is squared is then greater than 4 C.) x 2 > 4 x > 2 is the sign used for implications and it means then or therefore If x squared is greater than 4, then x is greater than 2 This statement is False. Counterexample: Let x = 3; 3 2 is greater than 4, but 3 is not greater than 2 D.) x 2 > 4 x > 2 means if and only if

x is the distance that x is from 0 on a number line ex) 3 = 3 ; 3 = 3 x squared is greater than 4 if and only if the absolute value of x is greater than 2 True. Any number greater than 2 that is squared or any number less than 2 that is squared is greater than 4. 33.) Let R be the domain of the predicate variables a, b, c and d. Which of the following are true and which are false? Give counterexamples for statements that are false. NOTE: To do these problems, you must first read the statements and decide whether the predicate satisfy the statement. Also, R, the domain, means that x can be all real numbers. A.) a > 0 and b > 0 ab > 0 a is greater than 0 and b is greater than 0. Then, a times b is greater than 0. True. a is a positive integer and b is a positive integer. So a positive integer multiplied by another positive integer is positive which is greater than 0. B.) a < 0 and b < 0 ab < 0 < means less than a is less than 0 and b is less than 0. Then, a times b is less than 0. False. Since a and b are less than 0, they are negative integers. Two negative integers multiplied together is positive. Counterexample: Let a= 2 and b= 5. So ( 2) ( 5) < 0 is 10 < 0 which is a false statement. C.) ab=0 a=0 or b=0

= means equals a times b equals 0. Then, a equals 0 or b equals 0. True. Any number times by 0 is 0. Therefore, if a is 0 then the statement is 0. If b is 0 then the statement is 0. D.) a<b and c<d ac < bd < means less than a is less than b and c is less than d. Then a times c is less than b times d. False. Counterexample: Let a= 3, b= 3, c= 5, and d= 5. So ac= ( 3)( 5)=15. And bd=(3)(50=15. However, 15 is not less than 15. Section 3.3 11.) Let S be the set of students at your school, let M be the set of movies that have ever been released, and let V(s,m) be student s has seen movie m. Rewrite each of the following statements without using the symbol, the symbol, or variables. NOTE: To begin these problems you must identify key symbols and understand the limits of the domain(s). Domain S refers to all the students at CSUMB and the domain M refers to all movies that has ever been released A.) s S such that V(s, Casablanca). s S: There is at least one student at CSUMB V(s, Casablanca): some student has seen movie Casablanca. There is a student at CSUMB who have seen the movie Casablanca. B.) s S, V(s, Star Wars).

s S: All students at CSUMB V(s, Star Wars): some student has seen movie Star Wars. All students at CSUMB have seen the movie Star Wars. C.) s S, m M such that V(s, m). s S: All students at CSUMB m M: At least one movie All students at CSUMB have seen at least one movie. D.) m M such that s S, V(s, m). m M: At least one movie s S: All students at CSUMB There is some movie that all students at CSUMB have seen. E.) s S, t S m M such that s =/ t and V(s, m) V(t, m). s S: Some student at CSUMB t S: a different student at CSUMB m s =/ M: At least one movie t: the two students are not the same person : and V(t, m): a different student has seen some movie There are two different students at CSUMB that have seen the same movie.

F.) s S and t S such that s =/ t and m M, V(s, m) V(t, m). s S: Some student at CSUMB t S: a different student at CSUMB s =/ m t: the two students are not the same person M: At least one movie : therefore V(t, m): a different student has seen some movie There is a student at CSUMB which every movie that person seen was seen by a different student at CSUMB. **Disclaimer: All examples used in this projects were used from the textbook Discrete Mathematics with Applications (Fourth Edition) Works Cited: S. S. Epp. Discrete Mathematics with Applications (Fourth Edition). Brooks Cole, Boston, 2004.