Write the negation of each of the following propositions without using any form of the word “not”: Today is Thursday Today is Monday or Tuesday or Wednesday.

Slides:



Advertisements
Similar presentations
Discrete Mathematics Math 6A
Advertisements

CSE115/ENGR160 Discrete Mathematics 01/26/12 Ming-Hsuan Yang UC Merced 1.
CS128 – Discrete Mathematics for Computer Science
Logic Chapter 2. Proposition "Proposition" can be defined as a declarative statement having a specific truth-value, true or false. Examples: 2 is a odd.
CMSC 250 Discrete Structures Exam #1 Review. 21 June 2007Exam #1 Review2 Symbols & Definitions for Compound Statements pq p  qp  qp  qp  qp  q 11.
Discrete Mathematics Math 6A Instructor: M. Welling.
EE1J2 – Discrete Maths Lecture 5 Analysis of arguments (continued) More example proofs Formalisation of arguments in natural language Proof by contradiction.
CSE115/ENGR160 Discrete Mathematics 01/20/11 Ming-Hsuan Yang UC Merced 1.
Adapted from Discrete Math
Section 1.5 Implications. Implication Statements If Cara has a piano lesson, then it is Friday. If it is raining, then I need to remember my umbrella.
CS 173, Lecture B September 1, 2015 Tandy Warnow.
MATH 224 – Discrete Mathematics
Review I Rosen , 3.1 Know your definitions!
Chapter 5 – Logic CSNB 143 Discrete Mathematical Structures.
CSNB143 – Discrete Structure LOGIC. Learning Outcomes Student should be able to know what is it means by statement. Students should be able to identify.
Fundamentals of Logic 1. What is a valid argument or proof? 2. Study system of logic 3. In proving theorems or solving problems, creativity and insight.
Predicates and Quantified Statements
Methods of Proof Dr. Yasir Ali. Proof A (logical) proof of a statement is a finite sequence of statements (called the steps of the proof) leading from.
4.1 Proofs and Counterexamples. Even Odd Numbers Find a property that describes each of the following sets E={…, -4, -2, 0, 2, 4, 6, …} O={…, -3, -1,
Chapter 2 Logic 2.1 Statements 2.2 The Negation of a Statement 2.3 The Disjunction and Conjunction of Statements 2.4 The Implication 2.5 More on Implications.
CSS342: Quantifiers1 Professor: Munehiro Fukuda. CSS342: Quantifiers2 Review of Propositions Proposition: a statement that is either true or false, but.
Chapter 2 Symbolic Logic. Section 2-1 Truth, Equivalence and Implication.
CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.
Predicates and Quantifiers Dr. Yasir Ali. 1.Predicates 2.Quantifiers a.Universal Quantifiers b.Existential Quantifiers 3.Negation of Quantifiers 4.Universal.
Chapter 2 Fundamentals of Logic 1. What is a valid argument or proof?
Fall 2008/2009 I. Arwa Linjawi & I. Asma’a Ashenkity 11 The Foundations: Logic and Proofs Rules of inference.
CS104:Discrete Structures Chapter 2: Proof Techniques.
Learning Objectives  To define a proposition  To form a compound proposition using connectives  To determine the truth values of compound propositions.
Discrete Mathematics Lecture # 4. Conditional Statements or Implication  If p and q are statement variables, the conditional of q by p is “If p then.
Discrete Mathematical Structures: Theory and Applications 1 Logic: Learning Objectives  Learn about statements (propositions)  Learn how to use logical.
Discrete Math by R.S. Chang, Dept. CSIE, NDHU1 Fundamentals of Logic 1. What is a valid argument or proof? 2. Study system of logic 3. In proving theorems.
Uniqueness Quantifier ROI for Quantified Statement.
Chapter 1 Logic and proofs
Logic Hubert Chan [O1 Abstract Concepts] [O2 Proof Techniques]
Discrete Mathematical
Argument An argument is a sequence of statements.
CSE15 Discrete Mathematics 01/23/17
DISCRETE MATHEMATICS CHAPTER I.
CSNB 143 Discrete Mathematical Structures
CSE15 Discrete Mathematics 01/30/17
Discrete Mathematics Logic.
Niu Kun Discrete Mathematics Chapter 1 The Foundations: Logic and Proof, Sets, and Functions Niu Kun 离散数学.
6/20/2018 Arab Open University Faculty of Computer Studies M131 - Discrete Mathematics 6/20/2018.
Logic.
Chapter 1 Logic and Proofs.
(CSC 102) Discrete Structures Lecture 2.
CPCS222 Discrete Structures I
Logic Hubert Chan [O1 Abstract Concepts] [O2 Proof Techniques]
Proof Techniques.
Discrete Mathematics Lecture # 2.
CMSC Discrete Structures
2 Chapter Introduction to Logic and Sets
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett
CS100: Discrete structures
CHAPTER 1: LOGICS AND PROOF
CS201: Data Structures and Discrete Mathematics I
Methods of Proof. Methods of Proof Definitions A theorem is a valid logical assertion which can be proved using Axioms: statements which are given.
Applied Discrete Mathematics Week 1: Logic
Propositional Logic.
First Order Logic Rosen Lecture 3: Sept 11, 12.
Discrete Mathematics Dr.-Ing. Erwin Sitompul
CSS 342 Data Structures, Algorithms, and Discrete Mathematics I
Discrete Mathematics and Its Applications Kenneth H
Discrete Mathematics Logic.
Discrete Mathematics CMP-200 Propositional Equivalences, Predicates & Quantifiers, Negating Quantified Statements Abdul Hameed
Dr. Halimah Alshehri MATH 151 Dr. Halimah Alshehri Dr. Halimah Alshehri.
Foundations of Discrete Mathematics
Contact
CS201: Data Structures and Discrete Mathematics I
2011年 5月 2011年 6月 2011年 7月 2011年 8月 Sunday Monday Tuesday Wednesday
Presentation transcript:

Write the negation of each of the following propositions without using any form of the word “not”: Today is Thursday Today is Monday or Tuesday or Wednesday or Friday or Saturday or Sunday 2 + 1 = 3 2+1 < 3 or 2+1 > 3 There is no wind in Illinois Illinois is windy. The summer in Champaign is hot and muggy The summer in Champaign is cold or dry

Let p, q, and r, be the propositions: p: You get an A on the final exam. q: You do every exercise in this book. r: You get an A in this class. Write these propositions using p, q, and r, and logical connectives. You get an A in this class, but you do not do every exercise in this book. r  ~q You get an A on the final, you do every exercise in this book,and you get an A in this class. p  q  r

To get an A in this class, it is necessary for you to get an A on the final p  r You get an A on the final, but you don’t do every exercise in this book;nevertheless, you get an A in this class p  ~q  r Getting an A on the final and doing every exercise in this book is sufficient for getting an A in this class Nevertheless:Bununla birlikte (p  q)  r You will get an A in this class if and only if you either do every exercise in this book, or you get an A on the final (r  (p  q))  (r  (p  q))

If Joey studies hard then he will pass the discrete math. exam Restate each proposition in the form (if p then q) of a conditional proposition. Joey will pass the discrete mathematics exam if he studies hard If Joey studies hard then he will pass the discrete math. exam A sufficient condition for Katrina to take the algorithms course is that she pass discrete mathematics If Katrina passes discrete math. then she will to take the algorithms course Write the converse of first proposition If Joey passes the discrete math.exam then he studied hard Refer to the propositions p, q and r; p is true, q is false and r’s status is unknown at this time. Tell whether each proposition is true, is false or has unknown status at this time p V r TRUE (p  r)r TRUE q  r TRUE (q V r)r TRUE

Represent the given statement symbolically by letting if 4 < 2 then 7 < 10 pq 7<10 if and only if (4 < 2 and 6 is not less than 6) q(p~r) Formulate the symbolic expression in word using p: Today is Monday q: It is raining r: It is hot pq If today is Monday then it is raining ~(pVq)  r It is not the case that today is Monday or it is raining if and only if it is hot

a tautology: (~p  (p  q))  ~q Use a truth table to determine whether the following is a tautology: (~p  (p  q))  ~q It is not a tautology p q ~p pq ~p  (p q) ~q (~p  (p  q))  ~q T F

Find a counterexample, if possible, to these universally quantified statements, where the universe of discourse for all variables consists of all integers x y (x = 1/y) Let x = 0. There is no integer y for which 0 = 1/y x y (y2 – x < 100) Let x be an integer < -100 x y (x2  y3) Let (x,y) = (0,0) or (1,1)

Write the negation of each of the following: Only students eat pizza Someone who is not a student eats pizza All students eat pizza There is a student who doesn’t eat pizza Some students eat only pizza No student eats only pizza. All students don’t eat only pizza. All students eat something other than pizza

Prove that if n is a positive integer, then n is even if and only if 7n + 4 is even First assume that n is even, so that n=2k for some integer k. Then 7n+4 = 14k+4 = 2(7k+2) which is even. To prove the converse, suppose (indirectly) that n=2k+1 for some integer k. Then 7n+4 = 14k+7+4 = 14k+10+1 = 2(7k+5)+1 which is odd. Hence n is odd if and only if 7n+4 is odd

p: Sherlock Holmes is successful q: Professor Albert is apprehended If Sherlock Holmes is successful, the Professor Albert will be apprehended. If Dr. Watson doesn’t slip up, then Sherlock Holmes will locate the missing clue. If Sherlock Holmes locates the missing clue, then he is successful. Dr. Watson doesn’t slip up. Therefore Professor Albert will be apprehended p: Sherlock Holmes is successful q: Professor Albert is apprehended r: Dr. Watson slips up s: Sherlock Holmes locates the missing clue The hypotheses are: pq ~rs sp ~r  The conclusion is: q  Slip up : yanılmak

Determine the truth value of each statement Determine the truth value of each statement. The domain of discourse is the set of real number. For every x, x2>x False a counterexample is x=1/2 For some x, if x>1, then x2>x True For every x, for every y, x2<y+1 False a counterexample is x=2 y=0 For some x, for some y, x2<y+1 True x=0 y=0 For every x, for every y, x2+y2=9 False x=y=2 For some x, for some y, x2+y2=9 True x=1 y=8 For some x, for every y, x2+y2>=0 True x=0 for all y