Chapter 2: The Logic of Quantified Statements
|
|
- Noel Jordan
- 5 years ago
- Views:
Transcription
1 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 only 1
2 Introduction Chapter 1 deals with propositional calculus. compound statements symbolically. It analyzes ordinary Chapter 2 deals with predicate calculus. It analyzes quantified statements symbolically. cs1231y only 2
3 Predicates A predicate is a sentence that contains a finite number of variables and becomes a statement when the variables are specialized (given specific values). The domain of a predicate variable is the set of (all) values that may be substituted in place of the variable. cs1231y only 3
4 Notation and Terminology for Sets (Digression) A set is a collection of known objects. The objects of a set are called elements or members of a set. The notation x A means object x is a member of the set A. notation x A means object x is not a member of the set A. The One way to describe a set is to lists its elements (or members) within a pair of braces. For example, the set of decimal digits D can be written as D = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9} cs1231y only 4
5 Important Sets (Digression) R is the set of (all) real numbers. Q is the set of (all) rational numbers. Z is the set of (all) integers, Z + is the set of (all) positive integers, Z is the set of (all) non-zero integers. Sometimes the ellipsis... is used to represent elements that are understood. For example, the set of (all) integers can be written as Z = {..., 2, 1, 0, 1, 2,...} cs1231y only 5
6 Example: Finding the Truth Value of a Predicate Let P (x) = x 2 > x be a predicate with domain the set R of (all) real numbers. x P (x) Statement Truth Value 2 P (2) 4 > 2 T 0.5 P (0.5) 0.25 > 0.5 F 1 2 P ( 1 2 ) 0.25 > 0.5 T cs1231y only 6
7 The Truth Set of a Predicate Let P (x) be a predicate with domain D. The truth set of P (x) is the set of all elements x of D such that P (x) is true. The truth set of P (x) can be written {x D P (x)} which means the set of all x in D such that P (x). cs1231y only 7
8 Example: Finding The Truth Set of a Predicate What is the truth set of Q(x) = x 8 (meaning x divides 8)? If the domain is the set of positive integers, the truth set is {1, 2, 4, 8}. But if the domain is the set of integers, the truth set is { 1, 1, 2, 2, 4, 4, 8, 8}. cs1231y only 8
9 The Universal Quantifier and Universal Statements A universal statement is a statement of the form x D, P (x) where P (x) is a predicate with domain D. The universal statement is true if and only if P (x) is true for all (or for every, for arbitrary, for any, for each, given any) x in D. It is false if and only if P (x) is false for at least one x in D. An x for which P (x) is false is called a counter example to the universal statement. The symbol is called the universal quantifier. cs1231y only 9
10 Example: Truth and Falsity of Universal Statements 1 Since the statement is true , 2 2 2, 3 2 3, 4 2 4, 5 2 5, x {1, 2, 3, 4, 5}, x 2 x cs1231y only 10
11 Example: Truth and Falsity of Universal Statements 2 Since the statement is false = 0.25 < 0.5, For all real number x, x 2 x Note that the phrase For all real number x is just another way of saying x R where R is the set of (all) real numbers. cs1231y only 11
12 The Existential Quantifier and Existential Statements An existential statement is a statement of the form x D such that P (x) where P (x) is a predicate with domain D. The existential statement is true if and only if there exists (or there is a, there is at least one, for some, for at least one, we can find a) x in D such that P (x) is true. It is false if and only if P (x) is false for all x in D. The symbol is called the existential quantifier. cs1231y only 12
13 Example: Truth and Falsity of Existential Statements The statement is true because x Z such that x 2 = x 0 2 = 0, 1 2 = 1. The statement x { 1, 2, 3} such that x 2 = x is false because there is no such x in the domain: ( 1) 2 = 1 1, 2 2 = 4 2, 3 2 = 9 3, cs1231y only 13
14 Universal Conditional Statements A universal conditional statement is a statement of the form x D, if P (x) then Q(x) where P (x), Q(x) are predicates with domain D. The universal conditional statement is true if and only if for all x in D the conditional P (x) Q(x) is true. It is false if and only if P (x) Q(x) is false for some x in D. cs1231y only 14
15 Equivalent Forms of Universal Statements Observe that x D, P (x) Q(x) x T (P ), Q(x) where T (P ) is the truth set of P (x): T (P ) = {x D P (x)}. To facilitate the following discussion, we define the false set of P : F (P ) = {x D P (x)}. cs1231y only 15
16 Establishing Equivalence The possible truth value combinations of two statement forms P and Q are: P Q P Q? T T OK T F NO F T NO F F OK Thus one way to show that two statement forms P and Q are logically equivalent is to show that P Q is true and Q P is true. cs1231y only 16
17 Explanation: Equivalent Forms of Universal Statements We need to show that the truth of A = x D, P (x) Q(x) implies the truth of and conversely. B = x T (P ), Q(x) cs1231y only 17
18 Explanation: A B We write A B to mean the statement A B is true. For any x T (P ), P (x) is true by definition, together with A, we know Q(x) is true. Thus A B. cs1231y only 18
19 Explanation: B A Recall that we write B A to mean the statement B A is true. For any x D, there are two cases: x T (P ) or x F (P ). If x T (P ), P (x) is true by definition and Q(x) is true by B. Thus the if in A is true. If x F (P ), P (x) is false by definition and the if in A is true by default. In either case, the if in A is true. Thus, B A. cs1231y only 19
20 Equivalent Forms of Existential Statements Observe that the statement x D, such that P (x) Q(x) can be rewritten into x {y D P (y)}, such that Q(x) or x {y D Q(y)}, such that P (x) cs1231y only 20
21 Negation of Universal Statements The negation of the universal statement x in D, P (x) is x in D, such that P (x) Symbolically, ( x D, P (x)) x D, such that P (x) cs1231y only 21
22 Example: Negation of Universal Statements For example, the negation of for all primes p, p is odd is there is a prime p, such that p is not odd Note that the negation is not for all primes p, p is not odd cs1231y only 22
23 Negation of Existential Statements The negation of the existential statement x in D, such that P (x) is x in D, P (x) Symbolically, ( x D such that P (x)) x D, P (x) cs1231y only 23
24 Example: Negation of Existential Statements The negation of There exists a triangle such that the sum of its angles is 200. is the statement For all triangles T, the sum of the angles of T is not 200. cs1231y only 24
25 Negation of Universal Conditional Statements As discussed previously, we have ( x, P (x) Q(x)) x such that (P (x) Q(x)) But Thus we have (P (x) Q(x)) P (x) Q(x) ( x, P (x) Q(x)) x such that (P (x) Q(x)) cs1231y only 25
26 Universal Statments are Like Conjunction Statements The universal statement x {x 1,..., x n }, P (x) is logically equivalent to P (x 1 )... P (x n ) cs1231y only 26
27 Existential Statments are Like Disjunction Statements The existential statement x {x 1,..., x n }, such that P (x) is logically equivalent to P (x 1 )... P (x n ) cs1231y only 27
28 Vacuous Truth of Universal Statements The universal statement x D, P (x) Q(x) is vacuously true, or true by default, if and only if P (x) is false for every x in D. In other words, the truth set of P (x) is empty. That is {x D P (x)} = {} or {x D P (x)} = D cs1231y only 28
29 Example: Vacuous Truth of Universal Statements Let B be a set of colored balls and no balls are placed in a bowl. Let B be the domain, and P (x) = x is in the bowl, Q(x) = x is blue. Is the following universal statement true? x B, P (x) Q(x) The answer is yes. It is vacuously true, or true by default, because P (x) is false for all x B. cs1231y only 29
30 Alternative Vacuous Truth Justification Let T (P ) = {} for the statement R = x B, P (x) Q(x). The negation of R is x B, such that P (x) Q(x) But this existential statement is plainly false: there is no x B such that P (x), never mind what the truth value of Q(x) is. Since the negation is false, so the given universal statement has to be true! cs1231y only 30
31 Variants of Universal Conditional Statements The contrapositive, converse, and inverse of the universal conditional statement x D, P (x) Q(x) are respectively x D, Q(x) P (x) x D, Q(x) P (x) x D, P (x) Q(x) cs1231y only 31
32 Variants of Universal Conditional Statements and Logical Equivalence We have x D, P (x) Q(x) x D, Q(x) P (x) but x D, P (x) Q(x) x D, Q(x) P (x) x D, P (x) Q(x) x D, P (x) Q(x) cs1231y only 32
33 Sufficiency, Necessity, If and Only If for Universal Conditional Statements x D, P (x) is a sufficient condition for Q(x) x D, P (x) Q(x) x D, Q(x) is a necessary condition for P (x) x D, P (x) Q(x) x D, P (x) only if Q(x) x D, Q(x) P (x) x D, P (x) Q(x) cs1231y only 33
34 Double Quantifiers: For All, There Exists The statement x D, y E such that P (x, y) means for any x D, we can find a y E, such that P (x, y). The element y is usually but not necessarily always dependent on x. cs1231y only 34
35 Examples: For All, There Exists 1. For any even number x, there is an integer y such that 2y = x. For x = 10, choose y = 5. For x = 0, choose y = 0. For x = 8, choose y = For any person x, there is a person y such that y is the father of x. 3. For any real number x, there is an integer y, such that x < y. In fact, for any x R, there are infinitely many y Z such that x < y. cs1231y only 35
36 Double Quantifiers: There Exists, For All The statement x D such that y E, P (x, y) means an x D can be found, such that for any y E, we have P (x, y). cs1231y only 36
37 Examples: There Exists, For All 1. There is a positive integer x such that for all positive integer y, x y. x = 1 is the only such positive integer. 2. There is an integer x such that for all non-negative integer y, x y. We can take any negative integer x. cs1231y only 37
38 Example: There Exists, For All and Variants Food in Station Uta Tim Yuen green salad fruit salad spaghetti fish pie cake milk soda coffee cs1231y only 38
39 Example: Quantified Statements What is the truth value of the following quantified statements? 1. There is an item I such that for all students S, S chose I. 2. There is a student S such that for all items I, S chose I. 3. There is a student S such that for all stations Z, there is an item I in Z such that S chose I. 4. For all students S and for all stations Z, there is an item I in Z such that S chose I. cs1231y only 39
40 Triple Qunatifiers: The Definition of Limit Let be a sequence. We have if and only if a 1, a 2,... lim n a n = L ɛ > 0, integer N such that integers n, if n > N then a n L < ɛ cs1231y only 40
41 An Illustration We have 0. 9 = That is, = In other words, the sequence a 1 = 0.9, a 2 = 0.99, a 3 = 0.999, a 4 = , approaches the number 1. For any ɛ > 0, pick N such that 0.1 N < ɛ, when n > N, we have 0 < 1 a n = 0.1 n < 0.1 N < ɛ cs1231y only 41
42 Negation of Multiply-Quantified Statements: ( 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) cs1231y only 42
43 Negation of Multiply-Quantified Statements: ( x D, such that y E, P (x, y)) x D, ( y E, P (x, y)) x D, y E such that P (x, y) cs1231y only 43
44 Order of Qunatifiers If a statement contains two different quantifiers, reversing the order of the quantifiers can change the truth value of the statement to its opposite. For example, everyone loves someone : people x, a person y such that x loves y is not the same as there is someone loved by everyone : a person y such that people x, x loves y However, two adjacent quantifiers of the same type can be stated in any order. cs1231y only 44
45 Formal Logical Notation Universal statements can be written symbolically as x D, P (x) x(x D P (x)) Existential statements can be written symbolically x D such that P (x) x(x D P (x)) cs1231y only 45
46 Negating Formal Logical Notation Using (p q) p q, we have ( x(x D P (x))) x(x D P (x)) Using De Morgan s law, we have ( x(x D P (x))) x(x D P (x)) cs1231y only 46
47 The Rule of Universal Instantiation If some property is true of every member in a domain, then it is true of any particular member in the domain. We have been using this rule all along, perhaps without knowing that the rule has such a glorified name. For example, we substitute values into formulas to obtain results even in primary school days. cs1231y only 47
48 Universal Instantiation and Universal Modus Ponens x D, P (x) Q(x) a D, P (a) Q(a) cs1231y only 48
49 Universal Instantiation and Universal Modus Tollens x D, P (x) Q(x) a D, Q(a) P (a) cs1231y only 49
50 Valid Arguments with Quantified Statements An argument form with quantified statements is valid if and only if no matter what particular predicates are substituted for the predicate symbols in its premises, if the resulting premise statements are all true, then the conclusion is also true. An argument is valid if and only if its form is valid. cs1231y only 50
51 Subsets (Diagression) If every member of a set A is a member of a set B, then A is a subset of B and we express this relationship with A B For example, They can be combined as Z Q, Q R Z Q R cs1231y only 51
52 Universal Statements and Subsets The universal statement x D, P (x) Q(x) amounts to truth set of P truth set of Q D cs1231y only 52
53 Universal Statements and Subsets D (all living things?) Q (mortal living things) P (human beings) cs1231y only 53
54 Example: Contrapositive All human beings are mortal. Zeus is not mortal. Zeus is not a human being. (An element not in the truth set of Q cannot be in the truth set of P.) cs1231y only 54
55 Example: Converse Error All human beings are mortal. Felix is mortal. Felix is a human being. (Wrong!) (An element in the truth set of Q may or may not be in the truth set of P. This is known as converse error.) cs1231y only 55
56 Example: Inverse Error All human beings are mortal. Felix is not a human being. Felix is immortal. (Wrong!) (An element not in the truth set of P may or may not be in the truth set of Q. This is known as inverse error.) cs1231y only 56
57 Summary: Variants of Universal Conditional Statements and Subset Relations If A B C, the following statement ( ) is true: x C, (x A) (x B) The contrapositive of ( ) is true: x C, (x B) (x A) The converse of ( ) is false if A B: x C, (x B) (x A) cs1231y only 57
58 but an instance of the converse can be either true or false; and a related existential statement is true: x C, (x B) (x A) The inverse of ( ) is false if A B: x C, (x A) (x B) but an instance of the inverse can be either true or false; and a related existential statement is true if B C: x C, (x A) (x B) cs1231y only 58
DISCRETE MATH: LECTURE Chapter 3.3 Statements with Multiple Quantifiers If you want to establish the truth of a statement of the form
DISCRETE MATH: LECTURE 5 DR. DANIEL FREEMAN 1. Chapter 3.3 Statements with Multiple Quantifiers If you want to establish the truth of a statement of the form x D, y E such that P (x, y) your challenge
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 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 informationTHE 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 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 informationTutorial 2 Logic of Quantified Statements
Tutorial 2 Logic of Quantified Statements 1. Let V be the set of all visitors to Universal Studios Singapore on a certain day, T (v) be v took the Transformers ride, G(v) be v took the Battlestar Galactica
More informationTHE LOGIC OF QUANTIFIED STATEMENTS
CHAPTER 3 THE LOGIC OF QUANTIFIED STATEMENTS Copyright Cengage Learning. All rights reserved. SECTION 3.3 Statements with Multiple Quantifiers Copyright Cengage Learning. All rights reserved. Statements
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 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 informationPredicate Logic. Andreas Klappenecker
Predicate Logic Andreas Klappenecker Predicates A function P from a set D to the set Prop of propositions is called a predicate. The set D is called the domain of P. Example Let D=Z be the set of integers.
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 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 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 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 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 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 informationChapter 2: The Logic of Quantified Statements. January 22, 2010
Chapter 2: The Logic of Quantified Statements January 22, 2010 Outline 1 2.1- Introduction to Predicates and Quantified Statements I 2 2.2 - Introduction to Predicates and Quantified Statements II 3 2.3
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 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 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 information3/29/2017. Logic. Propositions and logical operations. Main concepts: propositions truth values propositional variables logical operations
Logic Propositions and logical operations Main concepts: propositions truth values propositional variables logical operations 1 Propositions and logical operations A proposition is the most basic element
More informationLogic, Sets, and Proofs
Logic, Sets, and Proofs David A. Cox and Catherine C. McGeoch Amherst College 1 Logic Logical Operators. A logical statement is a mathematical statement that can be assigned a value either true or false.
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 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 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 information2. The Logic of Compound Statements Summary. Aaron Tan August 2017
2. The Logic of Compound Statements Summary Aaron Tan 21 25 August 2017 1 2. The Logic of Compound Statements 2.1 Logical Form and Logical Equivalence Statements; Compound Statements; Statement Form (Propositional
More informationCSCE 222 Discrete Structures for Computing. Predicate Logic. Dr. Hyunyoung Lee. !!!!! Based on slides by Andreas Klappenecker
CSCE 222 Discrete Structures for Computing Predicate Logic Dr. Hyunyoung Lee Based on slides by Andreas Klappenecker 1 Predicates A function P from a set D to the set Prop of propositions is called a predicate.
More informationLogic and Proofs. (A brief summary)
Logic and Proofs (A brief summary) Why Study Logic: To learn to prove claims/statements rigorously To be able to judge better the soundness and consistency of (others ) arguments To gain the foundations
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 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 informationBoolean Algebra and Proof. Notes. Proving Propositions. Propositional Equivalences. Notes. Notes. Notes. Notes. March 5, 2012
March 5, 2012 Webwork Homework. The handout on Logic is Chapter 4 from Mary Attenborough s book Mathematics for Electrical Engineering and Computing. Proving Propositions We combine basic propositions
More informationProofs. Example of an axiom in this system: Given two distinct points, there is exactly one line that contains them.
Proofs A mathematical system consists of axioms, definitions and undefined terms. An axiom is assumed true. Definitions are used to create new concepts in terms of existing ones. Undefined terms are only
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 informationTest 1 Solutions(COT3100) (1) Prove that the following Absorption Law is correct. I.e, prove this is a tautology:
Test 1 Solutions(COT3100) Sitharam (1) Prove that the following Absorption Law is correct. I.e, prove this is a tautology: ( q (p q) (r p)) r Solution. This is Modus Tollens applied twice, with transitivity
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 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 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 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 informationHANDOUT AND SET THEORY. Ariyadi Wijaya
HANDOUT LOGIC AND SET THEORY Ariyadi Wijaya Mathematics Education Department Faculty of Mathematics and Natural Science Yogyakarta State University 2009 1 Mathematics Education Department Faculty of Mathematics
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 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 informationReview. Propositions, propositional operators, truth tables. Logical Equivalences. Tautologies & contradictions
Review Propositions, propositional operators, truth tables Logical Equivalences. Tautologies & contradictions Some common logical equivalences Predicates & quantifiers Some logical equivalences involving
More informationLecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)
Lecture 2 Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits Reading (Epp s textbook) 2.1-2.4 1 Logic Logic is a system based on statements. A statement (or
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 information2. Use quantifiers to express the associative law for multiplication of real numbers.
1. Define statement function of one variable. When it will become a statement? Statement function is an expression containing symbols and an individual variable. It becomes a statement when the variable
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 informationHandout on Logic, Axiomatic Methods, and Proofs MATH Spring David C. Royster UNC Charlotte
Handout on Logic, Axiomatic Methods, and Proofs MATH 3181 001 Spring 1999 David C. Royster UNC Charlotte January 18, 1999 Chapter 1 Logic and the Axiomatic Method 1.1 Introduction Mathematicians use a
More informationMAT 243 Test 1 SOLUTIONS, FORM A
t MAT 243 Test 1 SOLUTIONS, FORM A 1. [10 points] Rewrite the statement below in positive form (i.e., so that all negation symbols immediately precede a predicate). ( x IR)( y IR)((T (x, y) Q(x, y)) R(x,
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 informationWhat is the decimal (base 10) representation of the binary number ? Show your work and place your final answer in the box.
Question 1. [10 marks] Part (a) [2 marks] What is the decimal (base 10) representation of the binary number 110101? Show your work and place your final answer in the box. 2 0 + 2 2 + 2 4 + 2 5 = 1 + 4
More informationLogic and Proofs. (A brief summary)
Logic and Proofs (A brief summary) Why Study Logic: To learn to prove claims/statements rigorously To be able to judge better the soundness and consistency of (others ) arguments To gain the foundations
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 informationSection 1.1 Propositions
Set Theory & Logic Section 1.1 Propositions Fall, 2009 Section 1.1 Propositions In Chapter 1, our main goals are to prove sentences about numbers, equations or functions and to write the proofs. Definition.
More informationIntro to Logic and Proofs
Intro to Logic and Proofs Propositions A proposition is a declarative sentence (that is, a sentence that declares a fact) that is either true or false, but not both. Examples: It is raining today. Washington
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 informationProofs: A General How To II. Rules of Inference. Rules of Inference Modus Ponens. Rules of Inference Addition. Rules of Inference Conjunction
Introduction I Proofs Computer Science & Engineering 235 Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu A proof is a proof. What kind of a proof? It s a proof. A proof is a proof. And when
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 informationA. Propositional Logic
CmSc 175 Discrete Mathematics A. Propositional Logic 1. Statements (Propositions ): Statements are sentences that claim certain things. Can be either true or false, but not both. Propositional logic deals
More informationProofs. Introduction II. Notes. Notes. Notes. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Fall 2007
Proofs Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Fall 2007 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 1.5, 1.6, and 1.7 of Rosen cse235@cse.unl.edu
More informationProof. Theorems. Theorems. Example. Example. Example. Part 4. The Big Bang Theory
Proof Theorems Part 4 The Big Bang Theory Theorems A theorem is a statement we intend to prove using existing known facts (called axioms or lemmas) Used extensively in all mathematical proofs which should
More informationChapter 4, Logic using Propositional Calculus Handout
ECS 20 Chapter 4, Logic using Propositional Calculus Handout 0. Introduction to Discrete Mathematics. 0.1. Discrete = Individually separate and distinct as opposed to continuous and capable of infinitesimal
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 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 informationProofs. Joe Patten August 10, 2018
Proofs Joe Patten August 10, 2018 1 Statements and Open Sentences 1.1 Statements A statement is a declarative sentence or assertion that is either true or false. They are often labelled with a capital
More informationLECTURE 1. Logic and Proofs
LECTURE 1 Logic and Proofs The primary purpose of this course is to introduce you, most of whom are mathematics majors, to the most fundamental skills of a mathematician; the ability to read, write, and
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 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 informationExercise Set 2.1. Notes: is equivalent to AND ; both statements must be true for the statement to be true.
Exercise Set 2.1 10) Let p be the statement DATAENDFLAG is off, q the statement ERROR equals 0, and r the statement SUM is less than 1,000. Express the following sentences in symbolic notation. Notes:
More informationPacket #1: Logic & Proofs. Applied Discrete Mathematics
Packet #1: Logic & Proofs Applied Discrete Mathematics Table of Contents Course Objectives Page 2 Propositional Calculus Information Pages 3-13 Course Objectives At the conclusion of this course, you should
More informationLogic and Proof. Aiichiro Nakano
Logic and Proof Aiichiro Nakano Collaboratory for Advanced Computing & Simulations Department of Computer Science Department of Physics & Astronomy Department of Chemical Engineering & Materials Science
More informationReadings: Conjecture. Theorem. Rosen Section 1.5
Readings: Conjecture Theorem Lemma Lemma Step 1 Step 2 Step 3 : Step n-1 Step n a rule of inference an axiom a rule of inference Rosen Section 1.5 Provide justification of the steps used to show that a
More informationMACM 101 Discrete Mathematics I. Exercises on Predicates and Quantifiers. Due: Tuesday, October 13th (at the beginning of the class)
MACM 101 Discrete Mathematics I Exercises on Predicates and Quantifiers. Due: Tuesday, October 13th (at the beginning of the class) Reminder: the work you submit must be your own. Any collaboration and
More informationFoundations of Mathematics MATH 220 FALL 2017 Lecture Notes
Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements
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 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 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 informationPropositional and First-Order Logic
Propositional and irst-order Logic 1 Propositional Logic 2 Propositional logic Proposition : A proposition is classified as a declarative sentence which is either true or false. eg: 1) It rained yesterday.
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 informationCSCE 222 Discrete Structures for Computing. Review for Exam 1. Dr. Hyunyoung Lee !!!
CSCE 222 Discrete Structures for Computing Review for Exam 1 Dr. Hyunyoung Lee 1 Topics Propositional Logic (Sections 1.1, 1.2 and 1.3) Predicate Logic (Sections 1.4 and 1.5) Rules of Inferences and Proofs
More informationLECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel
LECTURE NOTES on DISCRETE MATHEMATICS Eusebius Doedel 1 LOGIC Introduction. First we introduce some basic concepts needed in our discussion of logic. These will be covered in more detail later. A set is
More informationComputer Science 280 Spring 2002 Homework 2 Solutions by Omar Nayeem
Computer Science 280 Spring 2002 Homework 2 Solutions by Omar Nayeem Part A 1. (a) Some dog does not have his day. (b) Some action has no equal and opposite reaction. (c) Some golfer will never be eated
More information1.1 Statements and Compound Statements
Chapter 1 Propositional Logic 1.1 Statements and Compound Statements A statement or proposition is an assertion which is either true or false, though you may not know which. That is, a statement is something
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 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 informationCPSC 121: Models of Computation. Module 6: Rewriting predicate logic statements
CPSC 121: Models of Computation Pre-class quiz #7 is due Wednesday October 16th at 17:00. Assigned reading for the quiz: Epp, 4th edition: 4.1, 4.6, Theorem 4.4.1 Epp, 3rd edition: 3.1, 3.6, Theorem 3.4.1.
More informationDiscrete Mathematics Logics and Proofs. Liangfeng Zhang School of Information Science and Technology ShanghaiTech University
Discrete Mathematics Logics and Proofs Liangfeng Zhang School of Information Science and Technology ShanghaiTech University Resolution Theorem: p q p r (q r) p q p r q r p q r p q p p r q r T T T T F T
More informationPredicate Logic & Quantification
Predicate Logic & Quantification Things you should do Homework 1 due today at 3pm Via gradescope. Directions posted on the website. Group homework 1 posted, due Tuesday. Groups of 1-3. We suggest 3. In
More information1 The Foundation: Logic and Proofs
1 The Foundation: Logic and Proofs 1.1 Propositional Logic Propositions( 명제 ) a declarative sentence that is either true or false, but not both nor neither letters denoting propositions p, q, r, s, T:
More informationLecture : Set Theory and Logic
Lecture : Dr. Department of Mathematics Lovely Professional University Punjab, India October 18, 2014 Outline Contrapositive and Converse 1 Contrapositive and Converse 2 3 4 5 Contrapositive and Converse
More informationsoftware design & management Gachon University Chulyun Kim
Gachon University Chulyun Kim 2 Outline Propositional Logic Propositional Equivalences Predicates and Quantifiers Nested Quantifiers Rules of Inference Introduction to Proofs 3 1.1 Propositional Logic
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 informationSample Problems for all sections of CMSC250, Midterm 1 Fall 2014
Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014 1. Translate each of the following English sentences into formal statements using the logical operators (,,,,, and ). You may also use mathematical
More informationCSE Discrete Structures
CSE 2315 - Discrete Structures Homework 2- Fall 2010 Due Date: Oct. 7 2010, 3:30 pm Proofs using Predicate Logic For all your predicate logic proofs you can use only the rules given in the following tables.
More informationLogic. Def. A Proposition is a statement that is either true or false.
Logic Logic 1 Def. A Proposition is a statement that is either true or false. Examples: Which of the following are propositions? Statement Proposition (yes or no) If yes, then determine if it is true or
More informationManual of Logical Style
Manual of Logical Style Dr. Holmes January 9, 2015 Contents 1 Introduction 2 2 Conjunction 3 2.1 Proving a conjunction...................... 3 2.2 Using a conjunction........................ 3 3 Implication
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 informationRules Build Arguments Rules Building Arguments
Section 1.6 1 Section Summary Valid Arguments Inference Rules for Propositional Logic Using Rules of Inference to Build Arguments Rules of Inference for Quantified Statements Building Arguments for Quantified
More informationMTH 299 In Class and Recitation Problems SUMMER 2016
MTH 299 In Class and Recitation Problems SUMMER 2016 Last updated on: May 13, 2016 MTH299 - Examples CONTENTS Contents 1 Week 1 3 1.1 In Class Problems.......................................... 3 1.2 Recitation
More informationThe Logic of Compound Statements cont.
The Logic of Compound Statements cont. CSE 215, Computer Science 1, Fall 2011 Stony Brook University http://www.cs.stonybrook.edu/~cse215 Refresh from last time: Logical Equivalences Commutativity of :
More information1 The Foundation: Logic and Proofs
1 The Foundation: Logic and Proofs 1.1 Propositional Logic Propositions( ) a declarative sentence that is either true or false, but not both nor neither letters denoting propostions p, q, r, s, T: true
More information