EECS-1019c: Assignment #1

Similar documents
EECS 1028 M: Discrete Mathematics for Engineers

Exercises DEFINITION 7 EXAMPLE 12 EXAMPLE 13. TABLE 9 Table for the Bit Operators OR, AND, and XOR.

Chapter Summary. Propositional Logic. Predicate Logic. Proofs. The Language of Propositions (1.1) Applications (1.2) Logical Equivalences (1.

Chapter 1, Part I: Propositional Logic. With Question/Answer Animations

CSE 20: Discrete Mathematics

PROPOSITIONAL CALCULUS

DISCRETE MATHEMATICS BA202

University of Illinois at Chicago Department of Computer Science. Final Examination. CS 151 Mathematical Foundations of Computer Science Fall 2012

Math 55 Homework 2 solutions

MAT2345 Discrete Math

MATH 2001 MIDTERM EXAM 1 SOLUTION

1.1 Language and Logic

HOMEWORK 1: SOLUTIONS - MATH 215 INSTRUCTOR: George Voutsadakis

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

Announcements CompSci 102 Discrete Math for Computer Science

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

Chapter 1: Formal Logic

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

Propositional Logic 1

1.1 Language and Logic

MAT 101 Exam 2 Logic (Part I) Fall Circle the correct answer on the following multiple-choice questions.

CSC Discrete Math I, Spring Propositional Logic

Chapter 1, Part I: Propositional Logic. With Question/Answer Animations

1.3 Propositional Equivalences

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

Logical Operators. Conjunction Disjunction Negation Exclusive Or Implication Biconditional

ECOM Discrete Mathematics

Section 1.3. Let I be a set. When I is used in the following context,

Artificial Intelligence: Knowledge Representation and Reasoning Week 2 Assessment 1 - Answers

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

Chapter 1, Section 1.1 Propositional Logic

Indian Institute of Information Technology Design and Manufacturing, Kancheepuram Chennai , India. Assignment 1 - Propositional Logic

Math.3336: Discrete Mathematics. Applications of Propositional Logic

CHAPTER 1 The Foundations: Logic and Proofs

Unit 1. Propositional Logic Reading do all quick-checks Propositional Logic: Ch. 2.intro, 2.2, 2.3, 2.4. Review 2.9

10/5/2012. Logic? What is logic? Propositional Logic. Propositional Logic (Rosen, Chapter ) Logic is a truth-preserving system of inference

COM S 330 Homework 02 Solutions. Type your answers to the following questions and submit a PDF file to Blackboard. One page per problem.

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

Inference and Proofs (1.6 & 1.7)

Discrete Structures & Algorithms. Propositional Logic EECE 320 // UBC

Tautologies, Contradictions, and Contingencies

MATH 215 DISCRETE MATHEMATICS INSTRUCTOR: P. WENG

The Foundations: Logic and Proofs. Part I

Discrete Mathematics

Logic. Propositional Logic: Syntax

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

Propositional Logic. Fall () Propositional Logic Fall / 30

Why Learning Logic? Logic. Propositional Logic. Compound Propositions

MATH 13 SAMPLE FINAL EXAM SOLUTIONS

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

Mathematical Reasoning (Part I) 1

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

Discrete Mathematics Recitation Course 張玟翔

Section 1.1 Propositional Logic. proposition : true = T (or 1) or false = F (or 0) (binary logic) the moon is made of green cheese

Logic and Proofs. Jan COT3100: Applications of Discrete Structures Jan 2007

Formal Logic. Critical Thinking

Predicate Logic. Andreas Klappenecker

Examples: P: it is not the case that P. P Q: P or Q P Q: P implies Q (if P then Q) Typical formula:

Logic, Sets, and Proofs

The statement calculus and logic

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

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

Supplementary exercises in propositional logic

2/13/2012. Logic: Truth Tables. CS160 Rosen Chapter 1. Logic?

Logic. Propositional Logic: Syntax. Wffs

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

Readings: Conjecture. Theorem. Rosen Section 1.5

Ella failed to drop the class. Ella dropped the class.

A statement is a sentence that is definitely either true or false but not both.

Recitation Week 3. Taylor Spangler. January 23, 2012

CSCI Homework Set 1 Due: September 11, 2018 at the beginning of class

Packet #1: Logic & Proofs. Applied Discrete Mathematics

PSU MATH RELAYS LOGIC & SET THEORY 2017

CPSC 121 Midterm 1 Tuesday, October 11th, 2011

Definition 2. Conjunction of p and q

LOGIC CONNECTIVES. Students who have an ACT score of at least 30 OR a GPA of at least 3.5 can receive a college scholarship.

Discrete Structures of Computer Science Propositional Logic I

Compound Propositions

Section 1.1 Propositions

Predicate Logic & Quantification

COMP219: Artificial Intelligence. Lecture 19: Logic for KR

KOÇ UNIVERSITY EQUR 121 FIRST EXAM March 3, 2014

Propositional Logic. Spring Propositional Logic Spring / 32

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

Logic as a Tool Chapter 1: Understanding Propositional Logic 1.1 Propositions and logical connectives. Truth tables and tautologies

Chapter 4, Logic using Propositional Calculus Handout

HANDOUT AND SET THEORY. Ariyadi Wijaya

Mathematical Logic Prof. Arindama Singh Department of Mathematics Indian Institute of Technology, Madras. Lecture - 15 Propositional Calculus (PC)

2.2: Logical Equivalence: The Laws of Logic

III. Elementary Logic

2. Find all combinations of truth values for p, q and r for which the statement p (q (p r)) is true.

COMP 2600: Formal Methods for Software Engineeing

Logical Reasoning. Chapter Statements and Logical Operators

Department of Computer Science & Software Engineering Comp232 Mathematics for Computer Science

Mathematics for Computer Science Exercises from Chapter 3

software design & management Gachon University Chulyun Kim

1.1 Statements and Compound Statements

Discrete Mathematics and Its Applications

LOGIC. Name: Teacher: Pd: Page 1

Midterm: Sample 3. ECS20 (Fall 2017) 1) Using truth tables, establish for each of the two propositions below if it is a tautology, a contradiction

Transcription:

Fall 2015 EECS-1019c: Assignment #1 w/ answers 1 of 7 Out of N points. EECS-1019c: Assignment #1 Section 1.1 [20pt] (Choose 10 of 20) 2. [10pt] Which of these are propositions? What are the truth values of those that are propositions? a. [2pt] Do not pass go. Not a proposition. (It is an imperative.) b. [2pt] What time is it? Not a proposition. (It is a question.) c. [2pt] There are no black flies in Maine. Is a proposition. False, according to the textbook. And it is factually false too. d. [2pt] 4 + x = 5. Not a proposition. x is a variable. e. [2pt] The moon is made of green cheese. Is a proposition. False. f. [2pt] 2 n 100. Not a proposition. n is a variable.

Fall 2015 EECS-1019c: Assignment #1 w/ answers 2 of 7 12. [10pt] Let p, q, and r be the propositions. p: You have the flu. q: You miss the final examination. r: You pass the course. a. [2pt] p q If you have the flu, then you miss the final exam. b. [2pt] q r You pass the course if and only if you do not miss the final exam. c. [2pt] q r If you miss the final exam, then you do not pass the course. d. [2pt] p q r You have the flu, miss the final exam, or pass the course. e. [2pt] (p r) (q r) If you have the flu or miss the final exam, then you do not pass the course. f. [2pt] (p q) ( q r) You have the flu and miss the final exam, or you do not miss the final exam and pass the course.

Fall 2015 EECS-1019c: Assignment #1 w/ answers 3 of 7 24. [10pt] Write each of these statements in the form if p, then q in English. [Hint: Refer to the list of common ways to express conditional statements provided in this section.] a. [2pt] I will remember to send you the address only if you send me an e-mail message. If you send me an e-mail message, then I will remember to send you the address. b. [2pt] To be a citizen of this country, it is sufficient that you were born in the United States. If you were born in the United States, then you can be a citizen of the United States. c. [2pt] If you keep your textbook, it will be a useful reference in your future courses. If you keep your textbook, then it will be a useful reference in your future courses. d. [2pt] The Red Wings will win the Stanley Cup if their goalie plays well. If the Red Wings s goalie plays well, they will win the Stanley Cup. e. [2pt] That you get the job implies that you had the best credentials. If you get the job, then you had the best credentials. f. [2pt] The beach erodes whenever there is a storm. If there is a storm, then beach erodes. g. [2pt] It is necessary to have a valid password to log on to the server. If you can log on to the server, then you must have a valid password. h. [2pt] You will reach the summit unless you begin your climb too late. If you begin your climb too late, then you will not reach the summit.

Fall 2015 EECS-1019c: Assignment #1 w/ answers 4 of 7 Section 1.2 [10pt] 10. [5pt] Are these system specifications consistent? Whenever the system software is being upgraded, users cannot access the file system. If users can access the file system, then they can save new files. If users cannot save new files, then the system software is not being upgraded. u: Software is being upgraded. a: Users can access the file system. f: Users can save files. The three specifications then are 1. u a 2. a f 3. f u The specifications are odd, but they are consistent. To see this, consider u is true (the system is being upgraded), a is false (users cannot access the file system), and f is true (users cannot access the file system). Specification (1) is true as u and a are true. Specification (2) is true as a is false. Specification (3) is true as f is false. This seems odd as we might think, How can the user save files if he or she cannot access the file system@? But nothing in the specifications states this. 16. [5pt] An explorer is captured by a group of cannibals. There are two types of cannibals those who always tell the truth and those who always lie. The cannibals will barbecue the explorer unless he can determine whether a particular cannibal always lies or always tells the truth. He is allowed to ask the cannibal exactly one question. a. Explain why the question Are you a liar? does not work. If he is a liar (that is, always lies), he will answer, Yes. If he is honest (that is, always tells the truth), he will answer, Yes. Thus, his answer does not help the explorer to know whether he is honest or is a liar. b. Find a question that the explorer can use to determine whether the cannibal always lies or always tells the truth. If I cannot determine whether you are honest or are a liar, will you barbecue me? If the cannibal is a liar, he must say, No. Otherwise, he would be telling the truth, which he cannot do. If the cannibal is honest, he must say, Yes. Otherwise, he would be lying, which he cannot do.

Fall 2015 EECS-1019c: Assignment #1 w/ answers 5 of 7 Section 1.3 [20pt] (Choose 10 of 13) 6. [2pt] Use a truth table to verify the first De Morgan law (p q) p q. p q (p q) p q T T F F T F F F F T F F F F T T 8. [8pt] Use De Morgans laws to find the negation of each of the following statements. a. [2pt] Kwame will take a job in industry or go to graduate school. Kwame will not take a job in industry, nor will he go to graduate school. b. [2pt] Yoshiko knows Java and calculus. Yoshiko does not know Java or she does not know calculus. c. [2pt] James is young and strong. James is not young or he is not strong. d. [2pt] Rita will move to Oregon or Washington. Rita will move neither to Oregon nor Washington.

Fall 2015 EECS-1019c: Assignment #1 w/ answers 6 of 7 10. [8pt] Show that each of these conditional statements is a tautology by using truth tables. a. [2pt] [ p (p q)] q p q p q [ p (p q)] [ p (p q)] q T T T F T T F T F T F T T T T F F F T T b. [2pt] [(p q) (q r)] (p r) p q r (p q) (q r) (p q) (p r) [(p q) (q r)] (q r) (p r) T T T T T T T T T T F T F F F T T F T F T F T T T F F F T F F T F T T T T T T T F T F T F F T T F F T T T T T T F F F T T T T T c. [2pt] [p (p q)] q p q p q p (p q) [p (p q)] q T T T T T T F F F T F T T F T F F T F T d. [2pt] [(p q) (p q) (q r)] r p q r p q p q q r (p q) [(p q) (p q) (p q) (q r) (q r)] r T T T T T T T T T T F T T F F T T F T T F T F T T F F T F T F T F T T T T T T T F T F T T F F T F F T F T T F T F F F F T T F T

Fall 2015 EECS-1019c: Assignment #1 w/ answers 7 of 7 30. [2pt] Show that (p q) ( p r) (q r) is a tautology. (p q) ( p r) 1 ( p q) (p r) [implication equiv.] 2 T (( p q) (p r)) [identity] 3 ( p p) (( p q) (p r)) [negation] 4 ( p ( p q) (p r)) (p ( p q) (p r)) [distributive] 5 (q F ) (F r) [modus ponens] 6 (q r) [domination] 34. [6pt] Find the dual of each of these compound propositions. a. [2pt] p q p q b. [2pt] p (q (r T )) p (q (r F )) c. [2pt] (p q) (q F ) (p q) (q T )