DISCRETE MATH: LECTURE 6

Similar documents
DISCRETE MATH: FINAL REVIEW

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

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

DISCRETE MATH: LECTURE 3

Valid Reasoning. Alice E. Fischer. CSCI 1166 Discrete Mathematics for Computing February, Outline Truth and Validity Valid Reasoning

A. Propositional Logic

5. Use a truth table to determine whether the two statements are equivalent. Let t be a tautology and c be a contradiction.

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

CSE 20 DISCRETE MATH. Winter

3. The Logic of Quantified Statements Summary. Aaron Tan August 2017

Review The Conditional Logical symbols Argument forms. Logic 5: Material Implication and Argument Forms Jan. 28, 2014

Section 1.3: Valid and Invalid Arguments

PROPOSITIONAL CALCULUS

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

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

CSE 20 DISCRETE MATH. Fall

The Logic of Compound Statements cont.

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

DISCRETE MATH: LECTURE Chapter 3.3 Statements with Multiple Quantifiers If you want to establish the truth of a statement of the form

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

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

COMP Intro to Logic for Computer Scientists. Lecture 6

[Ch 3, 4] Logic and Proofs (2) 1. Valid and Invalid Arguments ( 2.3, 3.4) 400 lecture note #2. 1) Basics

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

Review. p q ~p v q Contrapositive: ~q ~p Inverse: ~p ~q Converse: q p

Introduction Logic Inference. Discrete Mathematics Andrei Bulatov

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

ANS: If you are in Kwangju then you are in South Korea but not in Seoul.

Discrete Mathematics Exam File Spring Exam #1

CSE 20 DISCRETE MATH WINTER

CSE 20 DISCRETE MATH SPRING

Proving Things. Why prove things? Proof by Substitution, within Logic. Rules of Inference: applying Logic. Using Assumptions.

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

Propositional Logic. Jason Filippou UMCP. ason Filippou UMCP) Propositional Logic / 38

THE LOGIC OF COMPOUND STATEMENTS

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

PSU MATH RELAYS LOGIC & SET THEORY 2017

A Quick Lesson on Negation

WUCT121. Discrete Mathematics. Logic. Tutorial Exercises

Chapter 3. The Logic of Quantified Statements

Logic and Proofs. (A brief summary)

What is the decimal (base 10) representation of the binary number ? Show your work and place your final answer in the box.

Propositional Logic: Part II - Syntax & Proofs 0-0

6. Conditional derivations

Discrete Structures of Computer Science Propositional Logic III Rules of Inference

Deductive and Inductive Logic

Section 1.2: Propositional Logic

6. Conditional derivations

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.

PHI Propositional Logic Lecture 2. Truth Tables

Math Final Exam December 14, 2009 Page 1 of 5

Outline. Logical Agents. Logical Reasoning. Knowledge Representation. Logical reasoning Propositional Logic Wumpus World Inference

The proposition p is called the hypothesis or antecedent. The proposition q is called the conclusion or consequence.

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

3/29/2017. Logic. Propositions and logical operations. Main concepts: propositions truth values propositional variables logical operations

Warm-Up Problem. Write a Resolution Proof for. Res 1/32

8.8 Statement Forms and Material Equivalence

How to determine if a statement is true or false. Fuzzy logic deal with statements that are somewhat vague, such as: this paint is grey.

Chapter 2: The Logic of Quantified Statements

Outline. Logical Agents. Logical Reasoning. Knowledge Representation. Logical reasoning Propositional Logic Wumpus World Inference

3 Rules of Inferential Logic

Tutorial 2 Logic of Quantified Statements

DISCRETE MATHEMATICS BA202

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

software design & management Gachon University Chulyun Kim

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

MATH 2001 MIDTERM EXAM 1 SOLUTION

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

Advanced Topics in LP and FP

CITS2211 Discrete Structures Proofs

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

Natural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic.

Section 1.2: Conditional Statements

Math 3336: Discrete Mathematics Practice Problems for Exam I

COMP219: Artificial Intelligence. Lecture 19: Logic for KR

Glossary of Logical Terms

Analyzing Arguments with Truth Tables

Chapter 1 Elementary Logic

Test Bank Questions. (a) Is there an integer n such that n has? (b) Does there exist such that if n is divided by 4 the remainder is 1 and if?

- a reversed conditional; if a conditional is p q, than its converse is q p

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

CSC 125 :: Final Exam December 14, 2011

Manual of Logical Style

Intermediate Logic. Natural Deduction for TFL

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

Where are my glasses?

n logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional)

Logic and Proof. On my first day of school my parents dropped me off at the wrong nursery. There I was...surrounded by trees and bushes!

Inference in Propositional Logic

Lecture 5 : Proofs DRAFT

Propositional Logic. Spring Propositional Logic Spring / 32

Logic and Proofs. (A brief summary)

On my first day of school my parents dropped me off at the wrong nursery. There I was...surrounded by trees and bushes! 26-Aug-2011 MA

DERIVATIONS AND TRUTH TABLES

CSC Discrete Math I, Spring Propositional Logic

1) Let h = John is healthy, w = John is wealthy and s = John is wise Write the following statement is symbolic form

CPSC 121 Midterm 1 Friday February 5th, 2016

Knowledge base (KB) = set of sentences in a formal language Declarative approach to building an agent (or other system):

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

Quiz 1. Directions: Show all of your work and justify all of your answers.

Transcription:

DISCRETE MATH: LECTURE 6 DR. DANIEL FREEMAN 1) a. Does 3 = {3}? b. 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 2) a. When does (a, b) = (c, d)? b. If A = {1, 2} and B = {x, y, c} then what is A B, B A, and A A? 3) Let A = {2, 3, 5} and B = {3, 4, 7}. Define a relation T from A to B by: If (x, y) A B then (x, y) T means that x y Z. a. Is 2 T 7? Is (2, 4) T? b. Is T : A B a function? why or why not? c. Write down T as a set of ordered pairs. d. Draw an arrow diagram for T. 1

2 DR. DANIEL FREEMAN 2. Chapter 2 review 1) Construct a truth table for (p q) ( p q). 2) Construct a truth table to show that (p q) is logically equivalent to p q. What is the name for this law? 3) Construct a truth table to show that p q is not logically equivalent to p q. 4) Use a truth table to determine if the following argument is logically valid. Write a sentence which justifies your conclusion. p q r q p r p r

DISCRETE MATH: LECTURE 6 3 You will be provided with the following information on the test. 2.1. Modus Ponens and Modus Tollens. The modus ponens argument form has the following form: If p then q. p q. Modus tollens has the following form: If p then q. q p. 2.2. Additional Valid Argument Forms: Rules of Inference. A rule of inference is a form of argument that is valid. Modus ponens and modus tollens are both rules of inference. Here are some more... Generalization p Elimination p q p q q Specialization p q p p Transitivity p q Proof by Division into Cases p q q r p r p r q r Conjunction p r q Contradiction Rule p c p q p

4 DR. DANIEL FREEMAN 5) Write a logical argument which determines what I ate for dinner. Number each step in your argument and cite which rule you use for each step. a. I did not have a coupon for hamburger buns. b. I had hamburgers or chicken for dinner. c. If I had hamburgers for dinner then I bought hamburger buns. d. If I did not have a coupon for hamburger buns then I did not buy hamburger buns.

DISCRETE MATH: LECTURE 6 5 6) Write a logical argument which determines how Blue Beard the pirate stashed his treasure. Number each step in your argument and cite which rule you use for each step. a. Blue Beard buried his treasure on land or Blue Beard sunk his treasure in the lagoon. b. The first mate helped Blue Beard stash the treasure or the cabin boy helped Blue Beard stash the treasure. c. If the first mate helped Blue Beard then they stashed the treasure with some rum. d. If the cabin boy helped Blue Beard then they used a treasure map. e. If they sank the treasure in the lagoon then they did not use a treasure map. f. If they did not stash the treasure with some rum then they did not burry the treasure. g. If they stashed the treasure with some rum then they did not sink the treasure in the lagoon.

6 DR. DANIEL FREEMAN 7) (Hard problem for fun) The prison warden gives three prisoners a chance to win their freedom. The warden puts a hat on each prisoners head and says that a prisoner will be allowed to go free if they can say what color hat they are wearing, but if they get it wrong then they will be executed. The first two prisoners can see, but the third prisoner is blind. Use the following information to determine what color hat each prisoner is wearing, assuming each prisoner is a perfect logician. a. The warden owns 3 red hats and 2 white hats. b. The warden asks the first prisoner what color hat he is wearing, but the first prisoner does not know. c. The warden then asks the second prisoner what color hat he is wearing, but the second prisoner does not know. d. The warden then asks the third prisoner what color hat he is wearing, and the third prisoner answers correctly.

DISCRETE MATH: LECTURE 6 7 3. Chapter 3 review 1) a. Give an example of a universal conditional statement. b. Write the contrapositive of the example. c. Write the negation of the example. 2) Write the following statements symbolically using,,,,. Then write their negation. a. If x, y R then x + y R. b. Every real number x has an additive inverse y. c. Being divisible by 8 is not a necessary condition for an integer to be divisible by 4. d. If I am tired and at home then I will go to sleep.

8 DR. DANIEL FREEMAN 2) Is it true or false that every real number bigger than 4 and less than 3 must be negative? Explain why. 3) Use diagrams to show whether the following arguments are logically valid or invalid. a. All people are mammals. All mammals are mortal. All people are mortal. a. Discrete math problems are fun. This problem is fun. This problem is discrete math.