Quantifiers are used to describe variables in statements.  The universal quantifier means for all.  The existential quantifier means there exists.


 Grace Norton
 2 years ago
 Views:
Transcription
1 11 Quantifiers are used to describe variables in statements.  The universal quantifier means for all.  The existential quantifier means there exists. The phrases, for all x in R if x is an arbitrary element of R for every x in R let x be in R can be translated symbolically into: x R. The phrases, there exists an x in R such that for some x in R there is an x in R such that can be translated symbolically into: x R. More than one quantifier. We may say ( x E)( k Z)x = 2k or to mean the same thing, we could use commas x E, k Z, x = 2k Once a variable is quantified it is fixed for the remainder of the statement. For example, ( x R)( y R)( z R)x 2 + y 2 = z 2. This is a true statement. Proof: Let z = x 2 + y 2. The order of the quantifiers counts. ( y R)( x R)x = y 2 ( x R)( y R)x = y 2 The first is false and the second is true.
2 12 The negation of quantifiers. ( x, Q) = x, Q ( x, Q) = x, Q Example 8. Q: Every good boy does fine. Symbolic translation: x G, x does fine. Negation: x G, x does not do fine. Rewrite the negation in words: There are some good boys that do not do fine. Q Q ( P ) Notice that Q and its negation satisfy: T F F T Example 9. P: There is a broken chair in this room. Symbolic translation: x C, x is broken. Where C is the set of chairs in this room. Negation: x C, x is not broken. Rewrite the negation in words: All chairs in this room are not broken. Or, we might say, No chair in this room is broken. P P ( P ) Notice that P and its negation satisfy: T F F T Negation of double quantifiers. [ n N, x A, nx < 1] n N, [ x A, nx < 1] n N, x A, [nx < 1] n N, x A, nx 1
3 13  Implication. P Q P Q T T T T F F F T T F F T Implication The phrases, P implies Q If P then Q Q if P Q is implied by P Q is true whenever P is true P only if Q can be translated symbolically into: P Q. In the implication P Q, P is the antecedent or hypothesis and Q is the consequence or conclusion. The Converse of P Q. is Q P. The Contrapositive of P Q. is ( Q) ( P ). Example 10. P: it is sunny Q: there is a ball game The implication. P implies Q: If it is sunny then there is a ball game. Its inverse: Q implies P: If there is a ball game then it is sunny. In this case, we could also say, There is a ball game only if it is sunny. Its contrapositive: not Q implies not P: If there is no ball game then it is not sunny. There is a ball game only if it is sunny.
4 14 The implication, P Q, and its contrapositive, Q P, have the same truth value. Lets look at the truth table. P Q P Q ( Q) ( P ) P Q T T F F T T T F F T F F F T T F T T F F T T T T Example 11. Show (P Q) has the same truth value as P ( Q). Example 12. P: If x < 0 then x = x. Negate P. Example 13. Q: f(x) = f(y) implies x = y. Negate Q.
5 P Q is said to be vacuously true when P is false. For example, If a snowball survives in hell, I will give everyone an A. Example 14. Use a truth table to prove that ((P Q) (Q R)) (P R) For the following two examples, let O be the odd integers and E be the even integers. Example 15. Determine if the following is true or false. xy O (x O y O) Example 16. Determine if the following is true or false. xy E (x E y E) If and only if statements.  If and only if. P Q P Q T T T T F F F T F F F T The phrases, P if and only if Q If P then Q and if Q then P P Q is the only if part Q P is the if part can be translated symbolically into: P Q. 15
6 16 Some word problems: Example 17. The following sentence appeared on a restaurant menu: Please note that every alternative may not be available at this time. Describe the unintended meaning. Rewrite the sentence to state the intended meaning clearly. Unintended meanings: Rewrite: Please note that some alternatives may not be available at this time. Not every option is available currently Please note that not every alternative may be available at this time. Every offered alternative will be available later. Please note that alternative items are subject to availability. Example 18. Give an example of an English sentence that has different meanings depending on inflection, pronunciation, or context. Everyone is wrong some of the time I lie here often. Example 19. From outside mathematics, give an example of statements A, B, C such that A and B together imply C, but such that neither A nor B alone implies C. A: I love you. B: You love me. C: We love each other. A: Dog is hungry. B: Food is put out. C: Dog is eating. A: Person x is a natural born US Citizen. B: Person x is 38 years old C: Person x can be president of the US A: It is below 32 degrees. B: there is precipitation. C: It will snow. A: She is a good teacher. B: She is a good mathematician. C: She is a good math teacher. Example 20. Negate the statement no slow learners attend this school is:
7 Example 21. A fraternity has a rule for new members: each must always tell the truth or always lie. They know who does which. If I meet three of them on the street and they make the statements below, which ones (if any) should I believe? A) Says: All three of us are liars. B) Says: Exactly two of us are liars C) Says: The other two are liars. 17
8 18 Examples from 1.4, 1.5, and Express each of the following statements as a conditional statement in ifthen form or as a universally quantified statement. Also write the negation. (1) Every odd number is prime. ( x odd integers ) x is prime. Negation: ( x odd integers ) x is not prime. (2) The sum of the angles of a triangle is 180 degrees. If x, y, z are the angles of a triangle, then their sum is 180 degrees. Negation: x, y, z are the angles of a triangle and their sum is not 180 degrees. (3) Passing the test requires solving all the problems. If you passed the test then you solved all the problems. Negation: You passed the test and you did not solve all the problems. (4) Being first in line guarantees getting a good seat. If you are first in line, then you will get a good seat. Negation: You are first in line and you do not get a good seat. (5) Lockers must be turned in by the last day of class. ( x lockers) x is turned in by last day of class. Negation: ( x lockers ) x is not turned in by the last day of class. (6) Haste makes waste. ( x haste) x makes waste Negation: ( x haste ) x does not make waste. (7) I get mad whenever you do that. If you do that then I get mad. Sometimes you do that and I do not get mad. (8) I won t say that unless I mean it. If I mean that then I will say that. Sometimes I won t say that and I mean that. 2. Which of these statements are believable? (1) All of my 5legged dogs can fly. true (2) I have no 5legged dog that cannot fly. true (3) Some of my 5legged dogs cannot fly. false (4) I have a 5legged dog that cannot fly. false 3. Prove that if x and y are distinct real numbers, then (x + 1) 2 = (y + 1) 2 if and only if x + y = 2.
9 Proof: We start with (x + 1) 2 = (y + 1) 2. Expanding both sides, we get x 2 + 2x + 1 = y 2 + 2y + 1. Canceling the 1 s and rearranging terms, we get x 2 y 2 = 2y 2x. We factor each side to get (x + y)(x y) = 2(y x) = 2(x y). As we are given x y, we can divide both sides by x y to get x + y = 2. As equations preserve equality and these steps are reversible, x + y = 2 implies (x + 1) 2 = (y + 1) 2, so the dependence holds both ways. 4. Given a real number x, let A be the statement 1/2 < x < 5/2, let B be the statement x Z, let C be the statement x 2 = 1, and let D be the statement x = 2. Which statements below are true for all x R. (1) A C. False. For a counterexample, let x = 2. (2) B C. False. For a counterexample, let x = 2. (3) (A B) C. False. For a counterexample, let x = 2. (4) (A B) (C D). True. If A and B are true, then x = 1 or x = 2. If x = 1 then C is true. If x = 2 then D is true. So in either case, either C or D is true. (5) C (A B). False. For a counterexample let x = 1. (6) D [A B ( C)]. True. If x = 2 then A is true, B is true, and x 2 1 so C is true. (7) (A C) B. True. A C means that x = 1, 2, or 1. So, B is true. 5. Let x, y be integers. Determine the truth value of each statement below. (1) xy is odd if and only if x and y are odd. TRUE. If x is odd and y is odd then x = 2a + 1 for some a and y = 2b + 1 for some b. Then xy = (2a + 1)(2b + 1) = 4ab + 2a + 2b + 1 = 2(2ab + a + b) + 1 which is odd. Suppose it is not true that both x and y are odd. Then at least one is even. Without loss of generality, suppose x is even. Then x = 2a for some a. xy = 2ay which is even. (2) xy is even if and only if x and y are even. FALSE. For a counterexample to the only if part, let x = 3 and y = 4. Then, xy = 12 which is even. 19
Objectives. 22 Conditional Statements
Geometry Warm Up Determine if each statement is true or false. 1. The measure of an obtuse angle is less than 90. F 2. All perfectsquare numbers are positive. 3. Every prime number is odd. F 4. Any three
More informationDISCRETE MATH: LECTURE 4
DISCRETE MATH: LECTURE 4 DR. DANIEL FREEMAN 1. Chapter 3.1 Predicates and Quantified Statements I A predicate is a sentence that contains a finite number of variables and becomes a statement when specific
More informationSection 1. Statements and Truth Tables. Definition 1.1: A mathematical statement is a declarative sentence that is true or false, but not both.
M3210 Supplemental Notes: Basic Logic Concepts In this course we will examine statements about mathematical concepts and relationships between these concepts (definitions, theorems). We will also consider
More information2.) 5000, 1000, 200, 40, 3.) 1, 12, 123, 1234, 4.) 1, 4, 9, 16, 25, Draw the next figure in the sequence. 5.)
Chapter 2 Geometry Notes 2.1/2.2 Patterns and Inductive Reasoning and Conditional Statements Inductive reasoning: looking at numbers and determining the next one Conjecture: sometimes thought of as an
More informationconditional statement conclusion Vocabulary Flash Cards Chapter 2 (p. 66) Chapter 2 (p. 69) Chapter 2 (p. 66) Chapter 2 (p. 76)
biconditional statement conclusion Chapter 2 (p. 69) conditional statement conjecture Chapter 2 (p. 76) contrapositive converse Chapter 2 (p. 67) Chapter 2 (p. 67) counterexample deductive reasoning Chapter
More informationMidterm Examination 1 with Solutions  Math 574, Frank Thorne Thursday, February 9, 2012
Midterm Examination 1 with Solutions  Math 574, Frank Thorne (thorne@math.sc.edu) Thursday, February 9, 2012 1. (3 points each) For each sentence below, say whether it is logically equivalent to the sentence
More informationLogic and Proof Solutions. Question 1
Logic and Proof Solutions Question 1 Which of the following are true, and which are false? For the ones which are true, give a proof. For the ones which are false, give a counterexample. (a) x is an odd
More informationEven Number: An integer n is said to be even if it has the form n = 2k for some integer k. That is, n is even if and only if n divisible by 2.
MATH 337 Proofs Dr. Neal, WKU This entire course requires you to write proper mathematical proofs. All proofs should be written elegantly in a formal mathematical style. Complete sentences of explanation
More informationThe Foundations: Logic and Proofs. Chapter 1, Part III: Proofs
The Foundations: Logic and Proofs Chapter 1, Part III: Proofs Rules of Inference Section 1.6 Section Summary Valid Arguments Inference Rules for Propositional Logic Using Rules of Inference to Build Arguments
More informationWeek 5: Quantifiers. Number Sets. Quantifier Symbols. Quantity has a quality all its own. attributed to Carl von Clausewitz
Week 5: Quantifiers Quantity has a quality all its own. attributed to Carl von Clausewitz Number Sets Many people would say that mathematics is the science of numbers. This is a common misconception among
More informationHandout #1: Mathematical Reasoning
Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or
More informationCHAPTER 2. Logic. 1. Logic Definitions. Notation: Variables are used to represent propositions. The most common variables used are p, q, and r.
CHAPTER 2 Logic 1. Logic Definitions 1.1. Propositions. Definition 1.1.1. A proposition is a declarative sentence that is either true (denoted either T or 1) or false (denoted either F or 0). Notation:
More informationINTRODUCTION TO PROOFS: HOMEWORK SOLUTIONS
INTRODUCTION TO PROOFS: HOMEWORK SOLUTIONS STEVEN HEILMAN Contents 1. Homework 1 1 2. Homework 2 6 3. Homework 3 10 4. Homework 4 16 5. Homework 5 19 6. Homework 6 21 7. Homework 7 25 8. Homework 8 28
More information31 is a prime number is a mathematical statement (which happens to be true).
Chapter 1 Mathematical Logic In its most basic form, Mathematics is the practice of assigning truth to welldefined statements. In this course, we will develop the skills to use known true statements to
More informationPropositional Logic. Definition: A proposition or statement is a sentence which is either true or false.
Propositional Logic Definition: A proposition or statement is a sentence which is either true or false. Definition:If a proposition is true, then we say its truth value is true, and if a proposition is
More informationGeometry: 2.12.3 Notes
Geometry: 2.12.3 Notes NAME 2.1 Be able to write all types of conditional statements. Date: Define Vocabulary: conditional statement ifthen form hypothesis conclusion negation converse inverse contrapositive
More informationChapter I Logic and Proofs
MATH 1130 1 Discrete Structures Chapter I Logic and Proofs Propositions A proposition is a statement that is either true (T) or false (F), but or both. s Propositions: 1. I am a man.. I am taller than
More informationPredicate Logic. Example: All men are mortal. Socrates is a man. Socrates is mortal.
Predicate Logic Example: All men are mortal. Socrates is a man. Socrates is mortal. Note: We need logic laws that work for statements involving quantities like some and all. In English, the predicate is
More informationCS 2336 Discrete Mathematics
CS 2336 Discrete Mathematics Lecture 2 Logic: Predicate Calculus 1 Outline Predicates Quantifiers Binding Applications Logical Equivalences 2 Predicates In mathematics arguments, we will often see sentences
More informationProof: A logical argument establishing the truth of the theorem given the truth of the axioms and any previously proven theorems.
Math 232  Discrete Math 2.1 Direct Proofs and Counterexamples Notes Axiom: Proposition that is assumed to be true. Proof: A logical argument establishing the truth of the theorem given the truth of the
More informationMATH 55: HOMEWORK #2 SOLUTIONS
MATH 55: HOMEWORK # SOLUTIONS ERIC PETERSON * 1. SECTION 1.5: NESTED QUANTIFIERS 1.1. Problem 1.5.8. Determine the truth value of each of these statements if the domain of each variable consists of all
More informationInference Rules and Proof Methods
Inference Rules and Proof Methods Winter 2010 Introduction Rules of Inference and Formal Proofs Proofs in mathematics are valid arguments that establish the truth of mathematical statements. An argument
More informationGeometry Topic 5: Conditional statements and converses page 1 Student Activity Sheet 5.1; use with Overview
Geometry Topic 5: Conditional statements and converses page 1 Student Activity Sheet 5.1; use with Overview 1. REVIEW Complete this geometric proof by writing a reason to justify each statement. Given:
More informationMath 3000 Running Glossary
Math 3000 Running Glossary Last Updated on: July 15, 2014 The definition of items marked with a must be known precisely. Chapter 1: 1. A set: A collection of objects called elements. 2. The empty set (
More informationDISCRETE MATHEMATICS W W L CHEN
DISCRETE MATHEMATICS W W L CHEN c W W L Chen, 1982, 2008. This chapter originates from material used by the author at Imperial College, University of London, between 1981 and 1990. It is available free
More informationWUCT121. Discrete Mathematics. Logic
WUCT121 Discrete Mathematics Logic 1. Logic 2. Predicate Logic 3. Proofs 4. Set Theory 5. Relations and Functions WUCT121 Logic 1 Section 1. Logic 1.1. Introduction. In developing a mathematical theory,
More information3.3. INFERENCE 105. Table 3.5: Another look at implication. p q p q T T T T F F F T T F F T
3.3. INFERENCE 105 3.3 Inference Direct Inference (Modus Ponens) and Proofs We concluded our last section with a proof that the sum of two even numbers is even. That proof contained several crucial ingredients.
More informationChapter 3. Proof. 3.1 The Nature of Proof
Chapter 3 Proof 3.1 The Nature of Proof We begin with a philosophical discussion on the nature of proof. When a person is arrested for a crime and brought to trial, it is assumed that the prosecution has
More information2. Methods of Proof Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try.
2. METHODS OF PROOF 69 2. Methods of Proof 2.1. Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try. Trivial Proof: If we know q is true then
More information3. Logical Reasoning in Mathematics
3. Logical Reasoning in Mathematics Many state standards emphasize the importance of reasoning. We agree disciplined mathematical reasoning is crucial to understanding and to properly using mathematics.
More informationGeometric Structures
Geometric Structure Activity: TEKS: Overview: Materials: Mad as a Hatter (G.1) Geometric structure. The student understands the structure of, and relationships within, an axiomatic system. The student
More informationLogic, Sets, and Proofs
Logic, Sets, and Proofs David A. Cox and Catherine C. McGeoch Amherst College 1 Logic Logical Statements. A logical statement is a mathematical statement that is either true or false. Here we denote logical
More informationSolutions to Homework 6 Mathematics 503 Foundations of Mathematics Spring 2014
Solutions to Homework 6 Mathematics 503 Foundations of Mathematics Spring 2014 3.4: 1. If m is any integer, then m(m + 1) = m 2 + m is the product of m and its successor. That it to say, m 2 + m is the
More information1.3 Induction and Other Proof Techniques
4CHAPTER 1. INTRODUCTORY MATERIAL: SETS, FUNCTIONS AND MATHEMATICAL INDU 1.3 Induction and Other Proof Techniques The purpose of this section is to study the proof technique known as mathematical induction.
More informationAll programs that passed test 1 were written in Java.
. Consider the following statements: (S) Programs that passed test also passed test. (S) Programs passed test unless they failed test. (S) Programs passed test only if they passed test. (a) Rewrite statements
More informationp 2 1 (mod 6) Adding 2 to both sides gives p (mod 6)
.9. Problems P10 Try small prime numbers first. p p + 6 3 11 5 7 7 51 11 13 Among the primes in this table, only the prime 3 has the property that (p + ) is also a prime. We try to prove that no other
More informationMATHEMATICS SAMPLE. 1.1 Writing Conditional, Converse, and Inverse Statements and Determining the Truth Value of these Statements
MATHEMATICS SAMPLE Copyright 2011 by North Farm Enterprises, LLC, 2405 North Hillfield Rd. Layton, Utah 84041 Chapter 1 1.1 Writing Conditional, Converse, and Inverse Statements and Determining the Truth
More information3.3 Proofs Involving Quantifiers
3.3 Proofs Involving Quantifiers 1. In exercise 6 of Section 2.2 you use logical equivalences to show that x(p (x) Q(x)) is equivalent to xp (x) xq(x). Now use the methods of this section to prove that
More informationCHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs
CHAPTER 3 Methods of Proofs 1. Logical Arguments and Formal Proofs 1.1. Basic Terminology. An axiom is a statement that is given to be true. A rule of inference is a logical rule that is used to deduce
More informationWhat is logic? Propositional Logic. Negation. Propositions. This is a contentious question! We will play it safe, and stick to:
Propositional Logic This lecture marks the start of a new section of the course. In the last few lectures, we have had to reason formally about concepts. This lecture introduces the mathematical language
More informationMath 317 HW #5 Solutions
Math 317 HW #5 Solutions 1. Exercise 2.4.2. (a) Prove that the sequence defined by x 1 = 3 and converges. x n+1 = 1 4 x n Proof. I intend to use the Monotone Convergence Theorem, so my goal is to show
More information1. Use the following truth table to answer the questions.
Topic 3: Logic 3.3 Introduction to Symbolic Logic Negation and Conjunction Disjunction and Exclusive Disjunction 3.4 Implication and Equivalence Disjunction and Exclusive Disjunction Truth Tables 3.5 Inverse,
More informationPredicate Logic. Lucia Moura. Winter Predicates and Quantifiers Nested Quantifiers Using Predicate Calculus
Predicate Logic Winter 2010 Predicates A Predicate is a declarative sentence whose true/false value depends on one or more variables. The statement x is greater than 3 has two parts: the subject: x is
More informationPage : 17, 19, 21, 31, 33. Conditional/Biconditional/Inverse/Converse/Contrapositive Page 109: odd, odd, 47, 48
Geometry UNIT 2 Reasoning and Proof Day 1 Day 2 Day 3 Day 4 Day 5 Day 6 Day 7 Day 8 Day 9 Day 11 Inductive Reasoning and Conjecture Page 9395: 1525 odds, 3134, 36, 38, 47a Logic Page 101102: 17, 19,
More informationWe now explore a third method of proof: proof by contradiction.
CHAPTER 6 Proof by Contradiction We now explore a third method of proof: proof by contradiction. This method is not limited to proving just conditional statements it can be used to prove any kind of statement
More informationMATHEMATICAL REASONING
Chapter 14 MATHEMATICAL REASONING 14.1 Overview If an object is either black or white, and if it is not black, then logic leads us to the conclusion that it must be white. Observe that logical reasoning
More informationDiscrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2
CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us
More informationWHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?
WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly
More informationCourse Notes for Math 320: Fundamentals of Mathematics Chapter 3: Induction.
Course Notes for Math 320: Fundamentals of Mathematics Chapter 3: Induction. February 21, 2006 1 Proof by Induction Definition 1.1. A subset S of the natural numbers is said to be inductive if n S we have
More information22C:19 Discrete Math. So. What is it? Why discrete math? Fall 2009 Hantao Zhang
22C:19 Discrete Math Fall 2009 Hantao Zhang So. What is it? Discrete mathematics is the study of mathematical structures that are fundamentally discrete, in the sense of not supporting or requiring the
More informationMath 3000 Section 003 Intro to Abstract Math Homework 2
Math 3000 Section 003 Intro to Abstract Math Homework 2 Department of Mathematical and Statistical Sciences University of Colorado Denver, Spring 2012 Solutions (February 13, 2012) Please note that these
More informationIntroduction to Proofs
Chapter 1 Introduction to Proofs 1.1 Preview of Proof This section previews many of the key ideas of proof and cites [in brackets] the sections where they are discussed thoroughly. All of these ideas are
More informationMathematical Induction
MCS236: Graph Theory Handout #A5 San Skulrattanakulchai Gustavus Adolphus College Sep 15, 2010 Mathematical Induction The following three principles governing N are equivalent. Ordinary Induction Principle.
More informationIn the examples above, you used a process called inductive reasoning to continue the pattern. Inductive reasoning is.
Lesson 7 Inductive ing 1. I CAN understand what inductive reasoning is and its importance in geometry 3. I CAN show that a conditional statement is false by finding a counterexample Can you find the next
More information1.3 Polynomials and Factoring
1.3 Polynomials and Factoring Polynomials Constant: a number, such as 5 or 27 Variable: a letter or symbol that represents a value. Term: a constant, variable, or the product or a constant and variable.
More informationIntroduction to Relations
CHAPTER 7 Introduction to Relations 1. Relations and Their Properties 1.1. Definition of a Relation. Definition: A binary relation from a set A to a set B is a subset R A B. If (a, b) R we say a is related
More informationCS250: Discrete Math for Computer Science. L1: Course Overview & Intro to Language of Math
CS250: Discrete Math for Computer Science L1: Course Overview & Intro to Language of Math What is this course about? Rigorous introduction to discrete mathematics and language of math. Structures and concepts
More informationOh Yeah? Well, Prove It.
Oh Yeah? Well, Prove It. MT 43A  Abstract Algebra Fall 009 A large part of mathematics consists of building up a theoretical framework that allows us to solve problems. This theoretical framework is built
More informationIf n is odd, then 3n + 7 is even.
Proof: Proof: We suppose... that 3n + 7 is even. that 3n + 7 is even. Since n is odd, there exists an integer k so that n = 2k + 1. that 3n + 7 is even. Since n is odd, there exists an integer k so that
More informationSection 3.3 Equivalence Relations
1 Section 3.3 Purpose of Section To introduce the concept of an equivalence relation and show how it subdivides or partitions a set into distinct categories. Introduction Classifying objects and placing
More informationIt is time to prove some theorems. There are various strategies for doing
CHAPTER 4 Direct Proof It is time to prove some theorems. There are various strategies for doing this; we now examine the most straightforward approach, a technique called direct proof. As we begin, it
More information3. Predicates and Quantifiers
3. PREDICATES AND QUANTIFIERS 45 3. Predicates and Quantifiers 3.1. Predicates and Quantifiers. Definition 3.1.1. A predicate or propositional function is a description of the property (or properties)
More informationMATH 289 PROBLEM SET 1: INDUCTION. 1. The induction Principle The following property of the natural numbers is intuitively clear:
MATH 89 PROBLEM SET : INDUCTION The induction Principle The following property of the natural numbers is intuitively clear: Axiom Every nonempty subset of the set of nonnegative integers Z 0 = {0,,, 3,
More information1.4/1.5 Predicates and Quantifiers
1.4/1.5 Predicates and Quantifiers Can we express the following statement in propositional logic? Every computer has a CPU No Outline: Predicates Quantifiers Domain of Predicate Translation: Natural Languauge
More information14 add 3 to preceding number 35 add 2, then 4, then 6,...
Geometry Definitions, Postulates, and Theorems hapter 2: Reasoning and Proof Section 2.1: Use Inductive Reasoning Standards: 1.0 Students demonstrate understanding by identifying and giving examples of
More informationCHAPTER 6: RATIONAL NUMBERS AND ORDERED FIELDS
CHAPTER 6: RATIONAL NUMBERS AND ORDERED FIELDS LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN 1. Introduction In this chapter we construct the set of rational numbers Q using equivalence
More information3(vi) B. Answer: False. 3(vii) B. Answer: True
Mathematics 0N1 Solutions 1 1. Write the following sets in list form. 1(i) The set of letters in the word banana. {a, b, n}. 1(ii) {x : x 2 + 3x 10 = 0}. 3(iv) C A. True 3(v) B = {e, e, f, c}. True 3(vi)
More informationCSI 2101 / Rules of Inference ( 1.5)
CSI 2101 / Rules of Inference ( 1.5) Introduction what is a proof? Valid arguments in Propositional Logic equivalence of quantified expressions Rules of Inference in Propositional Logic the rules using
More informationDiscrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 1
CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 1 Course Outline CS70 is a course on Discrete Mathematics and Probability for EECS Students. The purpose of the course
More informationHomework Set 2 (Due in class on Thursday, Sept. 25) (late papers accepted until 1:00 Friday)
Math 202 Homework Set 2 (Due in class on Thursday, Sept. 25) (late papers accepted until 1:00 Friday) Jerry L. Kazdan The problem numbers refer to the D Angelo  West text. 1. [# 1.8] In the morning section
More informationMathematical Induction
Mathematical S 0 S 1 S 2 S 3 S 4 S 5 S 6 S 7 S 8 S 9 S 10 Like dominoes! Mathematical S 0 S 1 S 2 S 3 S4 S 5 S 6 S 7 S 8 S 9 S 10 Like dominoes! S 4 Mathematical S 0 S 1 S 2 S 3 S5 S 6 S 7 S 8 S 9 S 10
More informationSection 1.3: Predicate Logic
1 Section 1.3: Purpose of Section: To introduce predicate logic (or firstorder logic) which the language of mathematics. We see how predicate logic extends the language of sentential calculus studied
More information1.3. Properties of Real Numbers Properties by the Pound. My Notes ACTIVITY
Properties of Real Numbers SUGGESTED LEARNING STRATEGIES: Create Representations, Activating Prior Knowledge, Think/Pair/Share, Interactive Word Wall The local girls track team is strength training by
More informationChapter Three. Functions. In this section, we study what is undoubtedly the most fundamental type of relation used in mathematics.
Chapter Three Functions 3.1 INTRODUCTION In this section, we study what is undoubtedly the most fundamental type of relation used in mathematics. Definition 3.1: Given sets X and Y, a function from X to
More informationCS 441 Discrete Mathematics for CS Lecture 5. Predicate logic. CS 441 Discrete mathematics for CS. Negation of quantifiers
CS 441 Discrete Mathematics for CS Lecture 5 Predicate logic Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Negation of quantifiers English statement: Nothing is perfect. Translation: x Perfect(x)
More informationDefinition of Statement: A group words or symbols that can be classified as true or false.
Logic Math 116 Section 3.1 Logic and Statements Statements Definition of Statement: A group words or symbols that can be classified as true or false. Examples of statements Violets are blue Five is a natural
More informationDiscrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof. Harper Langston New York University
Discrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof Harper Langston New York University Proof and Counterexample Discovery and proof Even and odd numbers number n from Z is called
More informationMathematical Induction
Mathematical Induction Victor Adamchik Fall of 2005 Lecture 2 (out of three) Plan 1. Strong Induction 2. Faulty Inductions 3. Induction and the Least Element Principal Strong Induction Fibonacci Numbers
More informationCK12 Geometry Conditional Statements
CK12 Geometry Conditional Statements Learning Objectives Identify the hypothesis and conclusion of an ifthen or conditional statement. Write the converse, inverse, and contrapositive of an ifthen statement.
More informationGeometry Chapter 2: Geometric Reasoning Lesson 1: Using Inductive Reasoning to Make Conjectures Inductive Reasoning:
Geometry Chapter 2: Geometric Reasoning Lesson 1: Using Inductive Reasoning to Make Conjectures Inductive Reasoning: Conjecture: Advantages: can draw conclusions from limited information helps us to organize
More informationLogic is a systematic way of thinking that allows us to deduce new information
CHAPTER 2 Logic Logic is a systematic way of thinking that allows us to deduce new information from old information and to parse the meanings of sentences. You use logic informally in everyday life and
More informationElementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.
Elementary Number Theory and Methods of Proof CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 1 Number theory Properties: 2 Properties of integers (whole
More informationGeometry  Chapter 2 Review
Name: Class: Date: Geometry  Chapter 2 Review Multiple Choice Identify the choice that best completes the statement or answers the question. 1. Determine if the conjecture is valid by the Law of Syllogism.
More informationChapter 3. Cartesian Products and Relations. 3.1 Cartesian Products
Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing
More information2.1 Use Inductive Reasoning
2.1 Use Inductive Reasoning Obj.: Describe patterns and use inductive reasoning. Key Vocabulary Conjecture  A conjecture is an unproven statement that is based on observations. Inductive reasoning  You
More informationLogic will get you from A to B. Imagination will take you everywhere.
Chapter 3 Predicate Logic Logic will get you from A to B. Imagination will take you everywhere. A. Einstein In the previous chapter, we studied propositional logic. This chapter is dedicated to another
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics. Introductory Notes in Discrete Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics Introductory Notes in Discrete Mathematics Marcel B. Finan c All Rights Reserved Last Updated April 6, 2016 Preface
More informationEquivalence relations
Equivalence relations A motivating example for equivalence relations is the problem of constructing the rational numbers. A rational number is the same thing as a fraction a/b, a, b Z and b 0, and hence
More informationLecture Notes in Discrete Mathematics. Marcel B. Finan Arkansas Tech University c All Rights Reserved
Lecture Notes in Discrete Mathematics Marcel B. Finan Arkansas Tech University c All Rights Reserved 2 Preface This book is designed for a one semester course in discrete mathematics for sophomore or junior
More informationMAT2400 Analysis I. A brief introduction to proofs, sets, and functions
MAT2400 Analysis I A brief introduction to proofs, sets, and functions In Analysis I there is a lot of manipulations with sets and functions. It is probably also the first course where you have to take
More informationAn Interesting Way to Combine Numbers
An Interesting Way to Combine Numbers Joshua Zucker and Tom Davis November 28, 2007 Abstract This exercise can be used for middle school students and older. The original problem seems almost impossibly
More informationGeometry Unit 1. Basics of Geometry
Geometry Unit 1 Basics of Geometry Using inductive reasoning  Looking for patterns and making conjectures is part of a process called inductive reasoning Conjecture an unproven statement that is based
More informationCSE 191, Class Note 01 Propositional Logic Computer Sci & Eng Dept SUNY Buffalo
Propositional Logic CSE 191, Class Note 01 Propositional Logic Computer Sci & Eng Dept SUNY Buffalo c Xin He (University at Buffalo) CSE 191 Discrete Structures 1 / 37 Discrete Mathematics What is Discrete
More informationWorksheet on induction Calculus I Fall 2006 First, let us explain the use of for summation. The notation
Worksheet on induction MA113 Calculus I Fall 2006 First, let us explain the use of for summation. The notation f(k) means to evaluate the function f(k) at k = 1, 2,..., n and add up the results. In other
More informationEx 1: For points A, B, and C, AB = 10, BC = 8, and AC = 5. Make a conjecture and draw a figure to illustrate your conjecture.
Geometry 21 Inductive Reasoning and Conjecturing A. Definitions 1. A conjecture is an guess. 2. Looking at several specific situations to arrive at a is called inductive reasoning. Ex 1: For points A,
More informationProblems on Discrete Mathematics 1
Problems on Discrete Mathematics 1 ChungChih Li 2 Kishan Mehrotra 3 L A TEX at July 18, 2007 1 No part of this book can be reproduced without permission from the authors 2 Illinois State University, Normal,
More informationReview Name Rule of Inference
CS311H: Discrete Mathematics Review Name Rule of Inference Modus ponens φ 2 φ 2 Modus tollens φ 2 φ 2 Inference Rules for Quantifiers Işıl Dillig Hypothetical syllogism Or introduction Or elimination And
More informationdef: An axiom is a statement that is assumed to be true, or in the case of a mathematical system, is used to specify the system.
Section 1.5 Methods of Proof 1.5.1 1.5 METHODS OF PROOF Some forms of argument ( valid ) never lead from correct statements to an incorrect. Some other forms of argument ( fallacies ) can lead from true
More informationWelcome to Analysis 1
Welcome to Analysis 1 Each week you will get one workbook with assignments to complete. Typically you will be able to get most of it done in class and will finish it off by yourselves. In week one there
More informationReview for Final Exam
Review for Final Exam Note: Warning, this is probably not exhaustive and probably does contain typos (which I d like to hear about), but represents a review of most of the material covered in Chapters
More information