Discrete Mathematics. Sec
|
|
- Claud Gibbs
- 6 years ago
- Views:
Transcription
1 Islamic University of Gaza Faculty of Engineering Department of Computer Engineering Fall 2011 ECOM 2311: Discrete Mathematics Eng. Ahmed Abumarasa Discrete Mathematics Sec The Foundations: Logic and Proof, Sets, and Functions
2 Chapter 1: The Foundations: Logic and Proof, Sets, and Functions 1.1: Logic Propositions must have clearly defined truth values (True or False), so a proposition must be a declarative sentence with no free variables. Not: the negative of the propositions. E.g. the negative of propositions p is (ꜚp called not p) Conjunction: the conjunction between two proposition is the AND connector. (pᶺq) is true only when both p and q are true. Disjunction: the disjunction between two proposition is the OR connector. (pᵛq) is false only when both p and q are false. Exclusive OR:
3 Conditional Statements: p q o CONVERSE: q p o CONTRAPOSITIVE: ꜚq ꜚp o INVERSE: ꜚp ꜚq Biconditional: (p q)p if and only if q. consistent System: System is consistent if all its propositions are true. Logic and Bit Operations:
4 Exercises: 1) 1.1.2: Which of these are propositions? What are the truth values of those that are propositions? Do not pass go. Not a proposition What time is it? Not a proposition There are no black flies in Maine a proposition 4+ X = 5 Not a proposition x + 1 = 5 if x = 1. Not a proposition x + y = y + z if x = z. a proposition 2) 1.1.4: Let p and q be the propositions p: I bought a lottery ticket this week. q: I won the million dollar jackpot on Friday. Express each of these propositions as an English sentence. a b c d e f g h I did not buy a lottery ticket this week. Either I bought a lottery ticket this week or I won the million dollar jackpot on Friday. [in the inclusive sense] If I bought a lottery ticket this week, then I won the million dollar jackpot on Friday. I bought a lottery ticket this week and I won the million dollar jackpot on Friday. I bought a lottery ticket this week if and only if I won the million dollar jackpot on Friday. If I did not buy a lottery ticket this week, then I did not win the million dollar jackpot on Friday. I did not buy a lottery ticket this week, and I did not win the million dollar jackpot on Friday. Either I did not buy a lottery ticket this week, or else I did buy one and won the million dollar jackpot on Friday.
5 3) 1.1.9: Let p and q be the propositions p : You drive over 65 miles per hour. q : You get a speeding ticket. Write these propositions using p and q and logical connectives. a) You do not drive over 65 miles per hour. b) You drive over 65 miles per hour, but you do not get a speeding ticket. c) You will get a speeding ticket if you drive over 65 miles per hour. d) If you do not drive over 65 miles per hour, then you will not get a speeding ticket. e) Driving over 65 miles per hour is sufficient for getting a speeding ticket. f) You get a speeding ticket, but you do not drive over 65 miles per hour. g) Whenever you get a speeding ticket, you are driving over 65 miles per hour. a b c d e f g Not p pᶺ (not p) p q not p not q p q qᶺ (not p) q p 4) 1.1.9: Construct a truth table for each of these compound propositions. A p not p output T F F F T F C E P q not q P v not q Output T T F T T T F T T F F T F F T F F T T F P q not p not q p q not q not p Output T T F F T T T T F F T F F T F T T F T T T F F T T T T T
6 1.2: Propositional Equivalences Tautology: A compound proposition that is always true. Contradiction: A compound proposition that is always false. Contingency: neither a tautology nor contradiction. Logical Equivalences: The compound propositions p and q are called logically equivalent if p q is a tautology. The notation p q denotes that p and q are logically equivalent.
7 Exercises: 1) 1.2.4: Use truth tables to verify the associative laws: a) A p q R p v q (p v q) v r T T T T T T T F T T T F T T T T F F T T F T T T T F T F T T F F T F T F F F F F p q R q v r p v (q v r) T T T T T T T F T T T F T T T T F F F T F T T T T F T F T T F F T T T F F F F F 2) : Determine whether is a tautology. لمعرفة هل هو tautology أم ال, يمكنا محاولة إثبات العكس أي يعني بحالة وجود إحتمال للمتغيرات تجعل ال الجملة.False في هذه الحالة يجب جعل الطرف األيمن F و األيسر T. يعني q يجب ان تكون T. و لجعل الطرف األيسر T يجب انا يكون P. = f باإلضافة ل p q يجب ان تكون, T و هذا يتوفر بحالة كانت, q =t P = f. إذا وجدنا حالة يكون الناتج false لذا الجملة ليست.tautology مالحظة: يمكن حل السؤال ب.truth table 3) : Show that and are equivalent. p q p q pᴧq Not p ᴧ not q T T T T F T T F F F F F F T F F F F F F t f t T 4) : Show that is a tautology. Make it in truth table or follow this: To make it false The right side must be false, so (p = T, r = F).
8 To make the lift side true, so p q must be true since (p=t) so (q =t) and q r must be true, since (r=f) so (q = f). So we cannot make it false so it is a tautology. 5) Find a compound proposition involving the propositions p, q, and r that is true when p and q are true and r is false, but is false otherwise. Solution: p ᴧ q ᴧ (not r) Need discussion with student. في هذا السؤال يطلب عمل compound proposition تجعل النات النهائي true فقط في حالة كان (f= p) (t=, q) (t= and r) من الروابط التي تجعل الجواب conjunction حالة وحدة فقط هي ال trueفي و تكون بحالة T ᴧ T ᴧ T == T ᴧ T ᴧ (not) F == p ᴧq ᴧ (not) r
9 1.3 Predicates and Quantifiers The statement P(x) is said to be the value of the propositional function P at x. Once a value has been assigned to the variable x, the statement P(x) becomes a proposition and has a truth value. E.g. if p(x) is x>3 then P (2): 2>3 proposition with false value. P (5): 5>3 proposition with true value. QUANTIFIERS: THE UNIVERSAL QUANTIFIER x P(x): for any x in the universe of discourse p(x) is true. E.g. p(x): x^2 >= 0, where the universe of discourse consists of all real numbers. x P(x) is true. THE EXISTENTIAL QUANTIFIER x p(x): there exist at least x where p(x) is true. E.g. p(x): x^2 =< 0, where the universe of discourse consists of all real numbers. x P(x) is true when x = 0. True False x p(x) When P(x) is true for every x. When there is an x for which P(x) is false. x p(x) When there is an x for which P(x) is true. When P{x) is false for every x. BINDING VARIABLES: NEGATIONS: When a quantifier is used on the variable x or when we assign a value to this variable, we say that this occurrence of the variable is bound. Variable that is not bound by a quantifier or set equal to a particular value is said to be free. E.g.: x y p(x, y): both x and y are pound. x p(x, y): x is pound, but y is free.
10 Exercises: 1) Let P(x) denote the statement "x < 4." What are the truth values? a) P (0). b) P (4). c) P (6). a b C true false False A B C D 2) Let P(x) be the statement "x spends more than five hours every weekday in class," where the universe of discourse for x consists of all students. Express each of these quantifications in English. a) x p(x) b) x p(x) c) x ꜚp(x) d) x ꜚp(x) There is a student who spends more than five hours every weekday in class. All students spend more than five hours every weekday in class. There is a student who does not spend more than five hours every weekday in class. All students don t spend more than five hours every weekday in class. 3) Translate these statements into English, where C(x) is "x is a comedian" and F(x) is "x is funny" and the universe of discourse consists of all people. a) x (C(x) F(x)). b) x (C(x) ᴧ F(x)). c) x (C(x) F(x)). d) x (C(x) ᴧ F(x)). a b c d For every one if he/she is a comedian then he/she a funny. (Every comedian is funny). Every one is a comedian and funny. There exists person if he/she is comedian then he/she funny. There exists comedian and funny. e f 4) Let P (x) be the statement "x = x^2." If the universe of discourse consists of the integers, what are the truth values? e) x p(x) f) x p(x) True, If x =1 then 1 =1^2 =1 so there exist x where x=x^2 False, sense if x=2 so 2!=2^2, there exist x where p(x) false so x p(x) false.
11 5) Translate in two ways each of these statements into logical expressions using predicates, quantifiers, and logical connectives. First, let the universe of discourse consist of the students in your class and second, let it consist of all people. a) Everyone in your class has a cellular phone. b) Somebody in your class has seen a foreign movie. c) There is a person in your class who cannot swim. To make the two ways we suppose that C(x) be the propositional function x is in your class. So a) Let P(x) is x has a cellular phone." B Let P(x) is x has seen a foreign movie. C Let P(x) is x can swim. x p(x) x (c(x) p(x)) x P(x) x (C(x) ᴧ P(x)). x ꜚP(x) x (C(x) ᴧ ꜚP(x)). 6) Express the negation of these propositions using quantifiers, and then express the negation in English. a) Some drivers do not obey the speed limit. b) All Swedish movies are serious. c) No one can keep a secret. d) There is someone in this class who does not have a good attitude. A B C d All drivers obey the speed limit. Some of Swedish movies are not serious. Someone can keep a secret. Everyone in this class has a good attitude.
12 1.4 Nested Quantifiers x y p(x, y): for all x and y p(x, y) true. x y p(x, y): for all x there is some y p(x, y) true. x y p(x, y): there is x p(x, y) true for all y x y p(x, y): for some x and some y p(x, y) true. e.g. we can see that: Every real number has additive inverse. x y (x and y are real numbers) (x+ y =0). Distribute a multiply over an add operations. x y z (x* (y + z) = x*y +x*z)) Statements involving nested quantifiers can be negated by successively applying the rules for negating statements involving a single quantifier. ꜚ x y f(x, y) xꜚ y f(x, y) x y ꜚf(x, y). It is important to note that the order of the quantifiers is important, unless all the quantifiers are universal quantifiers or all are existential quantifiers.
13 Exercises: Translate these statements into English, where the universe of discourse for each variable consists of all real numbers. a. x y (x< y) b. x y ( ( (x>=0) ᴧ (y>=0) ) (xy >=0)): c. x y z (xy=z). a For every real number x there exist another real number less than x. b For any two non-negative real numbers the multiplication of them is a non-negative real number c For any two real numbers the multiplication of them is real number Let Q(x, y) be the statement "student x has been a contestant on quiz show y." Express each of these sentences in terms of Q(x, y), quantifiers, and logical connectives, where the universe of discourse for x consists of all students at your school and for y consists of all quiz shows on television. a. There is a student at your school who has been a contestant on a television quiz show. b. No student at your school has ever been a contestant on a television quiz show. c. There is a student at your school who has been a contestant on Jeopardy and on Wheel of Fortune. d. Every television quiz show has had a student from your school as a contestant. e. At least two students from your school have been contestants on Jeopardy. a x y Q(x, y) b ꜚ x y Q(x, y) c x (Q(x, Jeopardy) ᴧ Q(x, Wheel of Fortune)) d y x Q(x, y) e x1 x2 (Q(x1, Jeopardy) ᴧ Q(x2, Jeopardy) ᴧ (x1 x2)) Use predicates, quantifiers, logical connectives, and mathematical operators to express the statement that every positive integer is the sum of the squares of four integers. Solution: x a b c ((x x = a 2 + b 2 + c 2 + d 2 ) where the universe of discourse consists of all integers.
14 Let Q(x, y) be the statement "x + y = x - y." If the universe of discourse for both variables consists of all integers, what are the truth values? a False, b True, 2 + 0=2-0. c False, 1 + y 1-y. d False, x+2 x-2 e True, 2 + 0=2-0. f True, x + 0=x-0. g True, x + 0=x-0. h False, x+2 x-2 i False, Rewrite each of these statements so that negations appear only within predicates (that is, so that no negation is outside a quantifier or an expression involving logical connectives). a. ꜚ x y p(x, y) b. ꜚ x y p(x, y) c. ꜚ y (Q(y) ᴧ x ꜚR(x, y)) d. ꜚ y ( x R(x, y) x S(x, y)) e. ꜚ y ( x z T(x, y, z) x z U(x, y, z)) a x y ꜚp(x, y) b x y ꜚ p(x, y) c y (ꜚQ(y) x R(x, y)) d y ( x ꜚR(x, y) ᴧ x ꜚS(x, y)) e y ( x z ꜚT(x, y, z) ᴧ x z ꜚU(x, y, z))
15 Sec 1.5: Rules of Inference Rules of Inference for Quantified Statements:
16 Exercises: What rule of inference is used in each of these arguments? a) Alice is a mathematics major. Therefore, Alice is either a mathematics major or a computer science major. b) Jerry is a mathematics major and a computer science major. Therefore, Jerry is a mathematics major. c) If it is rainy, then the pool will be closed. It is rainy. Therefore, the pool is closed. d) If it snows today, the university will close. The university is not closed today. Therefore, it did not snow today. e) If I go swimming, then I will stay in the sun too long. If I stay in the sun too long, then I will sunburn. Therefore, if I go swimming, then I will sunburn. Solution: a Addition rule. b Simplification rule. c Modus ponens. d Modus tollens. E Hypothetical syllogism Use rules of inference to show that the hypotheses "If it does not rain or if it is not foggy, then the sailing race will be held and the lifesaving demonstration will go on," "If the sailing race is held, then the trophy will be awarded," and "The trophy was not awarded" imply the conclusion "It rained." Solution: Let the following propositions: r: "It rains," f: "It is foggy," s: "The sailing race will be held," l: "The life saving demonstration will go on," T: "The trophy will be awarded."
17 1. Not t. Hypothesis 2. s t Hypothesis 3. not s Modus tollens using Steps 1 and 2 4. Hypothesis 5. contrapositive of Step 4 6. De Morgan's law and double negative 7. Addition, using Step 3 8. r ᴧ f Modus ponens using Steps 6 and 7 9. r Simplification using Step for each of these arguments, explain which rules of inference are used for each step. a) "Linda, a student in this class, owns a red convertible. Everyone who owns a red convertible has gotten at least one speeding ticket. Therefore, someone in this class has gotten a speeding ticket." Solution: c(x): x is in this class," r(x): x owns a red convertible," t(x): x has gotten a speeding ticket." 1. Hypothesis 2. Universal instantiation using Step 1 3. r(linda) Hypothesis 4. t(linda) Modus ponens using Steps 2 and 3 5. c(linda) Hypothesis 6. c(linda) ᴧ t(linda) Conjunction using Steps 4 and 5 7. x (c(x) ᴧ t(x)) Existential generalization using Step 6
18 Sec 1.6: Introduction to Proofs Methods of Proving Theorems: Direct Prove: A direct proof of a conditional statement p q is constructed when the first step is the assumption that p is true; subsequent steps are constructed using rules of inference, with the final step showing that q must also be true. Proof by Contraposition: Proofs by contraposition make use of the fact that the conditional statement p q is equivalent to its contrapositive,. Proofs by Contradiction: Because the statement is a contradiction whenever r is a proposition, we can prove that p is true if we can show that VACUOUS PROOFS: is true when we know that p is false. TRIVIAL PROOFS: is true when we know that q is true. PROOFS OF EQUIVALENCE:
19 Exercise: Use a direct proof to show that the product of two rational numbers is rational. Solution: First number x = a/b, b 0 Second number y =c/d, d 0 X*y = a*c/b*d sense b 0 and d 0 then b*d 0. Let a*c = l and b*d = m so x = l/m so x is rational number Prove or disprove that the product of two irrational numbers is irrational. Solution: To disprove it we need only one case doesn`t match the law. Now let X = 2, irrational number. X*X = 2 is rational number. (Product of two irrational numbers is not an irrational number) Prove that if m and n are integers and m n is even, then m is even or n is even. Solution: Let p: m*n is event. H: m is event. L: n is event. e have to prove P (m ᴠ n) Using prove by Contraposition, not(m ᴠ n) not p So: m is odd and n is odd m= 2k +1 n= 2l +1 m*n = (2k +1)*(2l+1) = 4kl + 2k + 2l + 1 = 2(2kl +k + l) +1, let (2kl +k + l) = v so m*n = 2v +1 so m*n is odd by Contraposition if m*n is even, then m is even or n is even.
20 Prove that if n is a positive integer, then n is odd if and only if 5n + 6 is odd. We must prove two implications. First, we assume that n is odd and show that 5n + 6 is odd. By assumption, n = 2k + 1 so 2n +6 = 5(2k +1) =6 = 10k + 11 = 10k = 2(5k +5) +1 = 5V +1 where v = (5k +5), so 5n +6 is odd. Second, we have to show that if 5n + 6 is odd then n is odd. Using indirect proves: Let n is event so n = 2k 5n +6 = 10k +6 = 2(5k +3) so it is event so by contraposition if 5n + 6 is odd then n is odd. From the two cases we found that n is odd if and only if 5n + 6 is odd. External question: Prove that if x and y are real numbers, then max(x, y) + min(x, y) = x + y. Solution: Like this question we cane analysis it to its cases. Max(x, y) has two cases if x is the max or y is max Min(x, y) has two cases if y is the min or x is min Case 1: Let x is the max so y is the min so max(x, y) + min(x, y) = x +y. Case 2: Let y is the max so x is the min so max(x, y) + min(x, y) = y +x = x +y. So in all cases max(x, y) + min(x, y) = x +y. End Of the chapter One.
THE ISLAMIC UNIVERSITY OF GAZA ENGINEERING FACULTY DEPARTMENT OF COMPUTER ENGINEERING DISCRETE MATHMATICS DISCUSSION ECOM Eng. Huda M.
THE ISLAMIC UNIVERSITY OF GAZA ENGINEERING FACULTY DEPARTMENT OF COMPUTER ENGINEERING DISCRETE MATHMATICS DISCUSSION ECOM 2011 Eng. Huda M. Dawoud September, 2015 Section 1: Propositional Logic 2. Which
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 informationCS100: DISCRETE STRUCTURES. Lecture 5: Logic (Ch1)
CS100: DISCREE SRUCURES Lecture 5: Logic (Ch1) Lecture Overview 2 Statement Logical Connectives Conjunction Disjunction Propositions Conditional Bio-conditional Converse Inverse Contrapositive Laws of
More informationKS MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) RULES OF INFERENCE. Discrete Math Team
KS091201 MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) RULES OF INFERENCE Discrete Math Team 2 -- KS091201 MD W-04 Outline Valid Arguments Modus Ponens Modus Tollens Addition and Simplification More Rules
More informationDISCRETE MATHEMATICS BA202
TOPIC 1 BASIC LOGIC This topic deals with propositional logic, logical connectives and truth tables and validity. Predicate logic, universal and existential quantification are discussed 1.1 PROPOSITION
More informationCS0441 Discrete Structures Recitation 3. Xiang Xiao
CS0441 Discrete Structures Recitation 3 Xiang Xiao Section 1.5 Q10 Let F(x, y) be the statement x can fool y, where the domain consists of all people in the world. Use quantifiers to express each of these
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 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 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 informationPROPOSITIONAL CALCULUS
PROPOSITIONAL CALCULUS A proposition is a complete declarative sentence that is either TRUE (truth value T or 1) or FALSE (truth value F or 0), but not both. These are not propositions! Connectives and
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 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 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 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 informationECOM Discrete Mathematics
ECOM 2311- Discrete Mathematics Chapter # 1 : The Foundations: Logic and Proofs Fall, 2013/2014 ECOM 2311- Discrete Mathematics - Ch.1 Dr. Musbah Shaat 1 / 85 Outline 1 Propositional Logic 2 Propositional
More 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 informationDiscrete Mathematics Recitation Course 張玟翔
Discrete Mathematics Recitation Course 1 2013.03.07 張玟翔 Acknowledge 鄭安哲 TA 2012 About Myself English Name : Zak Chinese Name : 張玟翔 Mail:o0000032@yahoo.com.tw Lab: ED612 1-1 Propositional Logic 1-1 Ex.2
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 informationCHAPTER 1 - LOGIC OF COMPOUND STATEMENTS
CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS 1.1 - Logical Form and Logical Equivalence Definition. A statement or proposition is a sentence that is either true or false, but not both. ex. 1 + 2 = 3 IS a statement
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 informationSolutions to Exercises (Sections )
s to Exercises (Sections 1.11-1.12) Section 1.11 Exercise 1.11.1 (a) p q q r r p 1. q r Hypothesis 2. p q Hypothesis 3. p r Hypothetical syllogism, 1, 2 4. r Hypothesis 5. p Modus tollens, 3, 4. (b) p
More informationCSCI Homework Set 1 Due: September 11, 2018 at the beginning of class
CSCI 3310 - Homework Set 1 Due: September 11, 2018 at the beginning of class ANSWERS Please write your name and student ID number clearly at the top of your homework. If you have multiple pages, please
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 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 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 informationReview: Potential stumbling blocks
Review: Potential stumbling blocks Whether the negation sign is on the inside or the outside of a quantified statement makes a big difference! Example: Let T(x) x is tall. Consider the following: x T(x)
More information10/5/2012. Logic? What is logic? Propositional Logic. Propositional Logic (Rosen, Chapter ) Logic is a truth-preserving system of inference
Logic? Propositional Logic (Rosen, Chapter 1.1 1.3) TOPICS Propositional Logic Truth Tables Implication Logical Proofs 10/1/12 CS160 Fall Semester 2012 2 What is logic? Logic is a truth-preserving system
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 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 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 informationCSC Discrete Math I, Spring Propositional Logic
CSC 125 - Discrete Math I, Spring 2017 Propositional Logic Propositions A proposition is a declarative sentence that is either true or false Propositional Variables A propositional variable (p, q, r, s,...)
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 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 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 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 informationLogic. Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another.
Math 0413 Appendix A.0 Logic Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another. This type of logic is called propositional.
More informationSolutions to Exercises (Sections )
s to Exercises (Sections 1.1-1.10) Section 1.1 Exercise 1.1.1: Identifying propositions (a) Have a nice day. : Command, not a proposition. (b) The soup is cold. : Proposition. Negation: The soup is not
More informationUnit I LOGIC AND PROOFS. B. Thilaka Applied Mathematics
Unit I LOGIC AND PROOFS B. Thilaka Applied Mathematics UNIT I LOGIC AND PROOFS Propositional Logic Propositional equivalences Predicates and Quantifiers Nested Quantifiers Rules of inference Introduction
More informationn logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional)
Discrete Math Review Discrete Math Review (Rosen, Chapter 1.1 1.6) TOPICS Propositional Logic Logical Operators Truth Tables Implication Logical Equivalence Inference Rules What you should know about propositional
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 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 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 informationMATH 215 DISCRETE MATHEMATICS INSTRUCTOR: P. WENG
MATH 215 DISCRETE MATHEMATICS INSTRUCTOR: P. WENG Suggested Problems for Logic and Proof The following problems are from Discrete Mathematics and Its Applications by Kenneth H. Rosen. 1. Which of these
More informationDiscrete Mathematical Structures. Chapter 1 The Foundation: Logic
Discrete Mathematical Structures Chapter 1 he oundation: Logic 1 Lecture Overview 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Quantifiers l l l l l Statement Logical Connectives Conjunction
More 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 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 informationEECS 1028 M: Discrete Mathematics for Engineers
EECS 1028 M: Discrete Mathematics for Engineers Suprakash Datta Office: LAS 3043 Course page: http://www.eecs.yorku.ca/course/1028 Also on Moodle S. Datta (York Univ.) EECS 1028 W 18 1 / 12 Using the laws
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 information2/18/14. What is logic? Proposi0onal Logic. Logic? Propositional Logic, Truth Tables, and Predicate Logic (Rosen, Sections 1.1, 1.2, 1.
Logic? Propositional Logic, Truth Tables, and Predicate Logic (Rosen, Sections 1.1, 1.2, 1.3) TOPICS Propositional Logic Logical Operations Equivalences Predicate Logic CS160 - Spring Semester 2014 2 What
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 informationAt least one of us is a knave. What are A and B?
1. This is a puzzle about an island in which everyone is either a knight or a knave. Knights always tell the truth and knaves always lie. This problem is about two people A and B, each of whom is either
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 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 informationWhat is Logic? Introduction to Logic. Simple Statements. Which one is statement?
What is Logic? Introduction to Logic Peter Lo Logic is the study of reasoning It is specifically concerned with whether reasoning is correct Logic is also known as Propositional Calculus CS218 Peter Lo
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 informationWhy Learning Logic? Logic. Propositional Logic. Compound Propositions
Logic Objectives Propositions and compound propositions Negation, conjunction, disjunction, and exclusive or Implication and biconditional Logic equivalence and satisfiability Application of propositional
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 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 information2/13/2012. Logic: Truth Tables. CS160 Rosen Chapter 1. Logic?
Logic: Truth Tables CS160 Rosen Chapter 1 Logic? 1 What is logic? Logic is a truth-preserving system of inference Truth-preserving: If the initial statements are true, the inferred statements will be true
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 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 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 informationMAT2345 Discrete Math
Fall 2013 General Syllabus Schedule (note exam dates) Homework, Worksheets, Quizzes, and possibly Programs & Reports Academic Integrity Do Your Own Work Course Web Site: www.eiu.edu/~mathcs Course Overview
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 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 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 informationEECS 1028 M: Discrete Mathematics for Engineers
EECS 1028 M: Discrete Mathematics for Engineers Suprakash Datta Office: LAS 3043 Course page: http://www.eecs.yorku.ca/course/1028 Also on Moodle S. Datta (York Univ.) EECS 1028 W 18 1 / 26 Why Study Logic?
More informationOverview. 1. Introduction to Propositional Logic. 2. Operations on Propositions. 3. Truth Tables. 4. Translating Sentences into Logical Expressions
Note 01 Propositional Logic 1 / 10-1 Overview 1. Introduction to Propositional Logic 2. Operations on Propositions 3. Truth Tables 4. Translating Sentences into Logical Expressions 5. Preview: Propositional
More informationn Empty Set:, or { }, subset of all sets n Cardinality: V = {a, e, i, o, u}, so V = 5 n Subset: A B, all elements in A are in B
Discrete Math Review Discrete Math Review (Rosen, Chapter 1.1 1.7, 5.5) TOPICS Sets and Functions Propositional and Predicate Logic Logical Operators and Truth Tables Logical Equivalences and Inference
More informationDiscrete Structures Homework 1
Discrete Structures Homework 1 Due: June 15. Section 1.1 16 Determine whether these biconditionals are true or false. a) 2 + 2 = 4 if and only if 1 + 1 = 2 b) 1 + 1 = 2 if and only if 2 + 3 = 4 c) 1 +
More informationThe Foundations: Logic and Proofs. Chapter 1, Part III: Proofs
The Foundations: Logic and Proofs Chapter 1, Part III: Proofs Summary Valid Arguments and Rules of Inference Proof Methods Proof Strategies Rules of Inference Section 1.6 Section Summary Valid Arguments
More informationFull file at Chapter 1
Chapter 1 Use the following to answer questions 1-5: In the questions below determine whether the proposition is TRUE or FALSE 1. 1 + 1 = 3 if and only if 2 + 2 = 3. 2. If it is raining, then it is raining.
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 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 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 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 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 informationCompound Propositions
Discrete Structures Compound Propositions Producing new propositions from existing propositions. Logical Operators or Connectives 1. Not 2. And 3. Or 4. Exclusive or 5. Implication 6. Biconditional Truth
More informationMath.3336: Discrete Mathematics. Nested Quantifiers/Rules of Inference
Math.3336: Discrete Mathematics Nested Quantifiers/Rules of Inference Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu
More informationCS1021. Why logic? Logic about inference or argument. Start from assumptions or axioms. Make deductions according to rules of reasoning.
3: Logic Why logic? Logic about inference or argument Start from assumptions or axioms Make deductions according to rules of reasoning Logic 3-1 Why logic? (continued) If I don t buy a lottery ticket on
More informationDiscrete Structures for Computer Science
Discrete Structures for Computer Science William Garrison bill@cs.pitt.edu 6311 Sennott Square Lecture #6: Rules of Inference Based on materials developed by Dr. Adam Lee Today s topics n Rules of inference
More informationDiscrete Mathematics for CS Spring 2006 Forbes HW 1 Solutions
CompSci 102 Discrete Mathematics for CS Spring 2006 Forbes HW 1 Solutions 1. (2 pts.) Basics Thanks for your responses 2. (13 pts.) Book problems - Warmup for Recitation (a) 1.2 Exercise 36: The statement
More informationLogic. Logic is a discipline that studies the principles and methods used in correct reasoning. It includes:
Logic Logic is a discipline that studies the principles and methods used in correct reasoning It includes: A formal language for expressing statements. An inference mechanism (a collection of rules) to
More informationRules of Inference. Arguments and Validity
Arguments and Validity A formal argument in propositional logic is a sequence of propositions, starting with a premise or set of premises, and ending in a conclusion. We say that an argument is valid if
More informationUNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc (MATHEMATICS) I Semester Core Course. FOUNDATIONS OF MATHEMATICS (MODULE I & ii) QUESTION BANK
UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc (MATHEMATICS) (2011 Admission Onwards) I Semester Core Course FOUNDATIONS OF MATHEMATICS (MODULE I & ii) QUESTION BANK 1) If A and B are two sets
More informationSTRATEGIES OF PROBLEM SOLVING
STRATEGIES OF PROBLEM SOLVING Second Edition Maria Nogin Department of Mathematics College of Science and Mathematics California State University, Fresno 2014 2 Chapter 1 Introduction Solving mathematical
More 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 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 informationInference and Proofs (1.6 & 1.7)
EECS 203 Spring 2016 Lecture 4 Page 1 of 9 Introductory problem: Inference and Proofs (1.6 & 1.7) As is commonly the case in mathematics, it is often best to start with some definitions. An argument for
More informationReview. Propositional Logic. Propositions atomic and compound. Operators: negation, and, or, xor, implies, biconditional.
Review Propositional Logic Propositions atomic and compound Operators: negation, and, or, xor, implies, biconditional Truth tables A closer look at implies Translating from/ to English Converse, inverse,
More informationDiscrete Structures CRN Test 3 Version 1 CMSC 2123 Autumn 2013
. Print your name on your scantron in the space labeled NAME. 2. Print CMSC 223 in the space labeled SUBJECT. 3. Print the date 2-2-203, in the space labeled DATE. 4. Print your CRN, 786, in the space
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 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 informationThe following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof
Ch. 1.6 Introduction to Proofs The following techniques for methods of proofs are discussed in our text - Vacuous proof - Trivial proof - Direct proof - Indirect proof (our book calls this by contraposition)
More informationPredicate Calculus lecture 1
Predicate Calculus lecture 1 Section 1.3 Limitation of Propositional Logic Consider the following reasoning All cats have tails Gouchi is a cat Therefore, Gouchi has tail. MSU/CSE 260 Fall 2009 1 MSU/CSE
More 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 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 informationSec$on Summary. Valid Arguments Inference Rules for Propositional Logic. Inference Rules for Quantified Statements. Building Arguments
Section 1.6 Sec$on Summary Valid Arguments Inference Rules for Propositional Logic Building Arguments Inference Rules for Quantified Statements Building Arguments 2 Revisi$ng the Socrates Example We have
More information