Announcements. Exam 1 Review

Similar documents
Chapter 1, Logic and Proofs (3) 1.6. Rules of Inference

Packet #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics

Full file at Chapter 1

Readings: Conjecture. Theorem. Rosen Section 1.5

x P(x) x P(x) CSE 311: Foundations of Computing announcements last time: quantifiers, review: logical Inference Fall 2013 Lecture 7: Proofs

Proofs: A General How To II. Rules of Inference. Rules of Inference Modus Ponens. Rules of Inference Addition. Rules of Inference Conjunction

Methods of Proof. 1.6 Rules of Inference. Argument and inference 12/8/2015. CSE2023 Discrete Computational Structures

CSE 20. Final Review. CSE 20: Final Review

The Logic of Compound Statements cont.

2. The Logic of Compound Statements Summary. Aaron Tan August 2017

COMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University

CSCE 222 Discrete Structures for Computing. Review for Exam 1. Dr. Hyunyoung Lee !!!

Math 3336: Discrete Mathematics Practice Problems for Exam I

Inference and Proofs (1.6 & 1.7)

Proofs. Introduction II. Notes. Notes. Notes. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Fall 2007

Rules of Inference. Arguments and Validity

Boolean Algebra and Proof. Notes. Proving Propositions. Propositional Equivalences. Notes. Notes. Notes. Notes. March 5, 2012

Predicate Logic. Andreas Klappenecker

Reexam in Discrete Mathematics

Review. Propositions, propositional operators, truth tables. Logical Equivalences. Tautologies & contradictions

1. 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

CS 2336 Discrete Mathematics

CSC 125 :: Final Exam May 3 & 5, 2010

CSE 20 DISCRETE MATH. Fall

Review 1. Andreas Klappenecker

Argument. whenever all the assumptions are true, then the conclusion is true. If today is Wednesday, then yesterday is Tuesday. Today is Wednesday.

KS MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) RULES OF INFERENCE. Discrete Math Team

Logic, Sets, and Proofs

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics. Introductory Notes in Discrete Mathematics Solution Guide

Logic Overview, I. and T T T T F F F T F F F F

Do not start until you are given the green signal

CSE 20 DISCRETE MATH. Winter

WUCT121. Discrete Mathematics. Logic. Tutorial Exercises

Discrete Mathematical Structures: Theory and Applications

CSCI-2200 FOUNDATIONS OF COMPUTER SCIENCE

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.

Chapter 4, Logic using Propositional Calculus Handout

CSE 20 DISCRETE MATH WINTER

CSE 20 DISCRETE MATH SPRING

CS100: DISCRETE STRUCTURES. Lecture 5: Logic (Ch1)

Analyzing Arguments with Truth Tables

Intro to Logic and Proofs

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

n 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

MACM 101 Discrete Mathematics I. Exercises on Propositional Logic. Due: Tuesday, September 29th (at the beginning of the class)

Chapter 1 Elementary Logic

Logic and Proof. Aiichiro Nakano

MAT 243 Test 1 SOLUTIONS, FORM A

Proofs. Example of an axiom in this system: Given two distinct points, there is exactly one line that contains them.

Chapter 1: The Logic of Compound Statements. January 7, 2008

CSE 1400 Applied Discrete Mathematics Proofs

cse 311: foundations of computing Fall 2015 Lecture 6: Predicate Logic, Logical Inference

1 The Foundation: Logic and Proofs

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

Announcements. Read Section 2.1 (Sets), 2.2 (Set Operations) and 5.1 (Mathematical Induction) Existence Proofs. Non-constructive

PHI Propositional Logic Lecture 2. Truth Tables

The Process of Mathematical Proof

Lecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)

Math.3336: Discrete Mathematics. Nested Quantifiers/Rules of Inference

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

Predicate Logic & Quantification

Manual of Logical Style

1 The Foundation: Logic and Proofs

A Quick Lesson on Negation

Outline. Rules of Inferences Discrete Mathematics I MATH/COSC 1056E. Example: Existence of Superman. Outline

Steinhardt School of Culture, Education, and Human Development Department of Teaching and Learning. Mathematical Proof and Proving (MPP)

Logical Form 5 Famous Valid Forms. Today s Lecture 1/26/10

UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc (MATHEMATICS) I Semester Core Course. FOUNDATIONS OF MATHEMATICS (MODULE I & ii) QUESTION BANK

Discrete Structures for Computer Science

Proposition logic and argument. CISC2100, Spring 2017 X.Zhang

Where are my glasses?

Packet #1: Logic & Proofs. Applied Discrete Mathematics

Class Notes in Computer Science (First Edition)

Propositional Logic. Argument Forms. Ioan Despi. University of New England. July 19, 2013

CPSC 121: Models of Computation. Module 6: Rewriting predicate logic statements

Discrete Structures of Computer Science Propositional Logic III Rules of Inference

PROPOSITIONAL CALCULUS

Mat 243 Exam 1 Review

MATH CSE20 Homework 5 Due Monday November 4

CSE 240 Logic and Discrete Mathematics

Proofs. Chapter 2 P P Q Q

Discrete Mathematics Exam File Spring Exam #1

DISCRETE MATH: FINAL REVIEW

Contradiction MATH Contradiction. Benjamin V.C. Collins, James A. Swenson MATH 2730

Announcement. Homework 1

Today s Lecture 2/25/10. Truth Tables Continued Introduction to Proofs (the implicational rules of inference)

Discrete Mathematics Logics and Proofs. Liangfeng Zhang School of Information Science and Technology ShanghaiTech University

software design & management Gachon University Chulyun Kim

Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014

TEST BANK Questions for Chapter 1

HW1 graded review form? HW2 released CSE 20 DISCRETE MATH. Fall

LECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel

CS173 Lecture B, September 10, 2015

A. Propositional Logic

At least one of us is a knave. What are A and B?

Rules Build Arguments Rules Building Arguments

Solutions to Homework Set 1

Conjunction: p q is true if both p, q are true, and false if at least one of p, q is false. The truth table for conjunction is as follows.

A Guide to Proof-Writing

STUDY PROBLEMS FOR EXAM I CMSC 203 DISCRETE STRUCTURES. n (n +1)(2n +1), 6. j 2 = 1(1+1)(2 1+1) 6. k (k +1)(2k +1) 6

Transcription:

Announcements Quiz today Exam Monday! You are allowed one 8.5 x 11 in cheat sheet of handwritten notes for the exam (front and back of 8.5 x 11 in paper) Handwritten means you must write them by hand, you may not print them out Any attempt to use typed or printed notes will be considered cheating No class next Wednesday Feb 21 st I will be attending a conference I ll post a video lecture of the course material for you to watch Extensible Networking Platform 1 1 - CSE 240 Logic and Discrete Mathematics Exam 1 Review Exam 1 covers all of Chapter 1, Sets in Chapter 2 (2.1 and 2.2) Holding off on Induction until Exam 2 (No Chapter 5 material on Exam 1) Questions will be a mix of short answer, multiple choice (maybe) Be prepared to prove propositions using Direct Proofs Contradictions Contrapositions Each step in a proof needs to clearly follow from the previous Modus Tollens Modus Ponens definition of an odd Simple algebra Be prepared to prove properties of sets using Set Tables Equivalence relations Extensible Networking Platform 2 2 - CSE 240 Logic and Discrete Mathematics

Exam 1 Review Additional terms to be familiar with Natural Numbers {0, 1, 2, 3 } Integers {,-2,-1,0,1,2, } Rational Numbers {p/q where p and q are integers and q!= 0} Real Numbers Non imaginary numbers Prime Numbers Integers > 1 with no positive divisors besides 1 and itself {2,3,5,7, 11, and many more} Composite Numbers Positive integers > 1 that are not prime Proof Fallacies Affirming the conclusion If you do every problem in this book, then you will learn Discrete Mathematics You learned Discrete Mathematics Therefore you did every problem in the book Denying the hypothesis p q, p, therefore q Extensible Networking Platform 3 3 - CSE 240 Logic and Discrete Mathematics Practice Problems Extensible Networking Platform 4 4 - CSE 240 Logic and Discrete Mathematics

Example (#1) Break up into groups of 3 or 4 Determine whether this argument is valid: Lynn works part time or full time. If Lynn does not play on the team, then she does not work part time. If Lynn plays on the team, she is busy. Lynn does not work full time. Therefore, Lynn is busy. Extensible Networking Platform 5 5 - CSE 240 Logic and Discrete Mathematics Examples (#1 Solution) p: Lynn works part time f: Lynn works full time t: Lynn plays on the team b: Lynn is busy, -Lynn works part time or full time. -If Lynn does not play on the team, then she does not work part time. -If Lynn plays on the team, she is busy. -Lynn does not work full time. Therefore, Lynn is busy. 1) p v f premise premise premise 2) t p 3) t b 4) f premise 5) p Disjunctive syllogism 1 and 4 6) p t Contrapositive of 2 7) t Modus ponens on 5 and 6 8) b Modus ponens on 7 and 3 Extensible Networking Platform 6 6 - CSE 240 Logic and Discrete Mathematics

More Examples (#2) Prove or disprove that the square of every even integer ends in 0, 4, or 6. Extensible Networking Platform 7 7 - CSE 240 Logic and Discrete Mathematics More Examples (#2 solutions) Prove or disprove that the square of every even integer ends in 0, 4, or 6. Every even integer n can be written as n = 10k + r where r = 0, 2, 4, 6, 8. (For example, 34 = 10 * 3 + 4 and 6 = 6 * 0 + 6.) Examine each of these five cases separately: n = 10k + 0: n 2 = 100k 2, which ends in 0 (it is a multiple of 10) n = 10k + 2: n 2 = 100k 2 + 40k + 4 = 10(10k 2 + 4k) + 4 and hence ends in 4 n = 10k + 4: n 2 = 100k 2 + 80k + 16 = 10(10k 2 + 8k + 1) + 6 and hence ends in 6 n = 10k + 6: n 2 = 100k 2 + 120k + 36 = 10(10k 2 + 12k + 3) + 6 and hence ends in 6 n = 10k + 8: n 2 = 100k 2 + 160k + 64 = 10(10k 2 + 16k + 6) + 4 and hence ends in 4. Extensible Networking Platform 8 8 - CSE 240 Logic and Discrete Mathematics

More Examples (#3,#4, and #5) In the questions below suppose the variable x represents students and y represents courses, and: F(x): x is a freshman A(x): x is a part-time student T(x,y): x is taking y Write the statement in good English without using variables in your answers. 3. F(Mikko). 4. $y T(Joe,y). 5. $x(a(x) Ù F(x)). Extensible Networking Platform 9 9 - CSE 240 Logic and Discrete Mathematics More Examples (#3,#4, and #5 Solutions) In the questions below suppose the variable x represents students and y represents courses, and: F(x): x is a freshman A(x): x is a part-time student T(x,y): x is taking y Write the statement in good English without using variables in your answers. 3. F(Mikko).Miko is a freshman 4. $y T(Joe,y). Joe is not taking any course 5. $x(a(x) Ù F(x)). Some part-time students are not freshman Extensible Networking Platform 10 10 - CSE 240 Logic and Discrete Mathematics

More Examples (#6 & #7) 6) Determine whether p (q r) and p (q Ù r) are equivalent 7) Prove that ( p Ù (p v q)) q is a tautology using propositional equivalence and the laws of logic Extensible Networking Platform 11 11 - CSE 240 Logic and Discrete Mathematics More Examples (#6 solutions) 6) Determine whether p (q r) and p (q Ù r) are equivalent. Ans: Not equivalent. Let q be false and p and r be true. Extensible Networking Platform 12 12 - CSE 240 Logic and Discrete Mathematics

More Examples (#7 solutions) Prove that ( p Ù (p v q)) q is a tautology using propositional equivalence and the laws of logic Ans: ( p Ù (p v q)) q º(( p Ù p) v ( p Ù q)) q (Distributivity) ºº (F v ( p Ù q)) q (Uniquness) º( p Ù q) q (Domination) º ( p Ù q) v q (Defn ) º( p v q) v q (De Morgan s) º(p v q) v q ºp v ( q v q) (Associativity) ºp v (T) ºT Extensible Networking Platform 13 13 - CSE 240 Logic and Discrete Mathematics More Examples (#8 & #9) 8) Find a proposition with three variables p, q, and r that is true when exactly one of the three variables is true, and false otherwise 9) Find a proposition with three variables p, q, and r that is never true Extensible Networking Platform 14 14 - CSE 240 Logic and Discrete Mathematics

More Examples (#8 & #9 solutions) 8) Find a proposition with three variables p, q, and r that is true when exactly one of the three variables is true, and false otherwise Ans: (p Ù q Ù r) v ( p Ù q Ù r) v ( p Ù q Ù r) 9) Find a proposition with three variables p, q, and r that is never true Ans: (p Ù p) v (q Ù q) v (r Ù r) Extensible Networking Platform 15 15 - CSE 240 Logic and Discrete Mathematics More Examples (#10 - #13) In the questions below suppose A = {x,y} and B = {x,{x}}. Mark the statement TRUE or FALSE, explain your answer 10) x Í B 11) { } Î P(B). 12) {x} Í A - B. 13) P(A) = 4. Extensible Networking Platform 16 16 - CSE 240 Logic and Discrete Mathematics

More Examples (#10 - #13 solutions) In the questions below suppose A = {x,y} and B = {x,{x}}. Mark the statement TRUE or FALSE 10) x Í B Ans: False x Î B 11) { } Î P(B). Ans: True The empty set is an element of every power set 12) {x} Í A - B. Ans: False A B = {y} 13) P(A) = 4. Ans: True The cardinality of a power set A is 2 s where s is the cardinality of the set A Extensible Networking Platform 17 17 - CSE 240 Logic and Discrete Mathematics Quiz Extensible Networking Platform 18 18 - CSE 240 Logic and Discrete Mathematics