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

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

Overview. 1. Introduction to Propositional Logic. 2. Operations on Propositions. 3. Truth Tables. 4. Translating Sentences into Logical Expressions

Discrete Mathematical Structures. Chapter 1 The Foundation: Logic

Introduction to Sets and Logic (MATH 1190)

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.

Math.3336: Discrete Mathematics. Propositional Equivalences

CS1021. Why logic? Logic about inference or argument. Start from assumptions or axioms. Make deductions according to rules of reasoning.

Example. Logic. Logical Statements. Outline of logic topics. Logical Connectives. Logical Connectives

CSC Discrete Math I, Spring Propositional Logic

Practice Exam 2. You MUST show all your work, and indicate which value is the main operator value.

PROPOSITIONAL CALCULUS

Section L.1- Introduction to Logic

Total score: /100 points

Homework assignment 1: Solutions

Supplementary exercises in propositional logic

Sec 3.3 The Conditional & Circuits

Math 13, Spring 2013, Lecture B: Midterm

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

Section 3.1. Statements and Logical Connectives. Copyright 2013, 2010, 2007, Pearson, Education, Inc.

1.3 Propositional Equivalences

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

Discrete Mathematics. Sec

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

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

Proposition/Statement. Boolean Logic. Boolean variables. Logical operators: And. Logical operators: Not 9/3/13. Introduction to Logical Operators

Compound Propositions

ECOM Discrete Mathematics

Examples. Example (1) Example (2) Let x, y be two variables, and denote statements p : x = 0 and q : y = 1. Solve. x 2 + (y 1) 2 = 0.

Announcements. CS311H: Discrete Mathematics. Propositional Logic II. Inverse of an Implication. Converse of a Implication

Truth Tables for Arguments

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

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

1.1 Language and Logic

Section 1.1: Logical Form and Logical Equivalence

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

Section 3.1 Statements, Negations, and Quantified Statements

Mat 243 Exam 1 Review

HOMEWORK 1: SOLUTIONS - MATH 215 INSTRUCTOR: George Voutsadakis

1.1 Language and Logic

Solutions to Homework I (1.1)

Propositional Equivalence

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?

EECS 1028 M: Discrete Mathematics for Engineers

Section A (not in the text) Which of the following are statements? Explain. 3. The President of the United States in 2089 will be a woman.

Announcements. CS243: Discrete Structures. Propositional Logic II. Review. Operator Precedence. Operator Precedence, cont. Operator Precedence Example

Solving and Graphing Inequalities Joined by And or Or

Logical Operators. Conjunction Disjunction Negation Exclusive Or Implication Biconditional

THE ISLAMIC UNIVERSITY OF GAZA ENGINEERING FACULTY DEPARTMENT OF COMPUTER ENGINEERING DISCRETE MATHMATICS DISCUSSION ECOM Eng. Huda M.

DISCRETE STRUCTURES WEEK5 LECTURE1

Intro to Logic and Proofs

PS10.3 Logical implications

Introduction to Decision Sciences Lecture 2

Functions. Lecture 4: Truth functions, evaluating compound statements. Arithmetic Functions. x y x+y

CSE 20: Discrete Mathematics


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

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

C241 Homework Assignment 4

Chapter 3: Logic. Diana Pell. A statement is a declarative sentence that is either true or false, but not both.

Discrete Mathematics and Applications COT3100

Full file at

Recall that the expression x > 3 is not a proposition. Why?

Mathematical Reasoning (Part I) 1

CSE 240 Logic and Discrete Mathematics

CS 173: Discrete Mathematical Structures, Spring 2008 Homework 1 Solutions

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

DISCRETE MATHEMATICS BA202

Deductive and Inductive Logic

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

CS 2740 Knowledge Representation. Lecture 4. Propositional logic. CS 2740 Knowledge Representation. Administration

Logical Representations. LING 7800/CSCI 7000 Martha Palmer 9/30/2014

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

software design & management Gachon University Chulyun Kim

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

Write the negation of each of the following propositions without using any form of the word not :

Course Staff. Textbook

Review. Propositional Logic. Propositions atomic and compound. Operators: negation, and, or, xor, implies, biconditional.

Discrete Mathematics Recitation Course 張玟翔

A = LW V = LWH. P = a + b + c T = CN + F. d = rt P = 2(L +W ) = 2L + 2W 635 = 2N N / N = 510 / N N = 255

Introduction Propositional Logic. Discrete Mathematics Andrei Bulatov

The Logic of Compound Statements cont.

(p == train arrives late) (q == there are taxis) (r == If p and not q, then r. Not r. p. Therefore, q. Propositional Logic

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

PL: Truth Trees. Handout Truth Trees: The Setup

Proving logical equivalencies (1.3)

CHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC

PLEASE HAND IN PLEASE HAND IN. Solutions Sample

Logic. Def. A Proposition is a statement that is either true or false.

CS1800 Discrete Structures Spring 2018 February CS1800 Discrete Structures Midterm Version A

Tautologies, Contradictions, and Contingencies

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

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

Conditional Statements

Department of Mathematics and Statistics Math B: Discrete Mathematics and Its Applications Test 1: October 19, 2006

Announcements CompSci 102 Discrete Math for Computer Science

It is not the case that ϕ. p = It is not the case that it is snowing = It is not. r = It is not the case that Mary will go to the party =

Preparing for the CS 173 (A) Fall 2018 Midterm 1

Predicates and Quantifiers

ECS 20: Discrete Mathematics for Computer Science UC Davis Phillip Rogaway June 12, Final Exam

Learning Goals of CS245 Logic and Computation

Transcription:

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 make sure they are secured together. Problem 1 Indicate whether each statement below is a proposition. If the statement is a proposition, express the negation of the proposition in English or mathematical symbols. a. 0 < x < 10. No b. π is approximately 22/7. Yes; π is not approximately 22/7 c. Pay attention in class. No d. All years divisible by 4 are leap years. Yes; Not all years divisible by 4 are leap years. Problem 2 he propositional variables, p, q, and s have the following truth assignments: p =, q = F, r = F. Give the truth value for the following compound propositions: a. p q b. q r F c. p r F d. r Problem 3 he values for the propositional variables p, q, r, s, are determined as follows: p = q = F r = F s = Determine the truth values for the following propositions: a. (p q) s b. (r q) p c. (s q) (p q)

d. (r p) s e. p (q s) Problem 4 Give a truth table for the following propositions: a. (p q) (q p) p q p q q p (p q) (q p) F F F F F F F F b. p ( p q) p q p p q p ( p q) F F F F F F F F F F c. (p r) (r q) p q r r p r (r q) (p r) (r q) F F F F F F F F F F F F F F F F F F F F F F F F F Problem 5 Let p and q be the propositions p : I bought a lottery ticket this week. q : I won the million dollar jackpot. Express each of these propositions as an English sentence. a. p q I bought a lottery ticket this week or I didn t win the million dollar jackpot b. p q If I bought a lottery ticket this week, then I won the million dollar jackpot

c. p q I bought a lottery ticket this week if and only if I won the million dollar jackpot d. p q If I didn t buy a lottery ticket this week then I will not win the million dollar jackpot e. p q I didn t buy a lottery ticket this week and I didn t win the million dollar jackpot f. p (p q) I didn t buy a lottery ticket this week or I bought a lottery ticket this week and won the million dollar jackpot. Problem 6 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 (including negations). a. You get an A in this class, but you do not do every exercise in this book. r q b. 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 c. o get an A in this class, it is necessary for you to get an A on the final. p r d. 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 e. Getting an A on the final and doing every exercise in this book is sufficient for getting an A in this class. (p q) r Problem 7 Find out for each of the following propositions whether it is a tautology, a contradiction, or neither (a contingency). Prove your answer (use a truth table).

a. [(p q) (q r)] (p r) p q r p q q r (p q) (q r) p r [(p q) (q r)] (p r) F F F F F F F F F F F F F F F F F F F F F F So it is a tautology. b. (p q r) [(q r) (p q)] p q r p q r p q q r (q r) (p q) (p q r) [(q r) (p q)] F F F F F F F F F F F F F F F F F F F F F F F F F So it is a contingency. Problem 8 For each table, give a logical expression whose truth table is the same as the one given below (note that there may be several correct answers): a. p q? F F F F F F F his could be p q or ( p q) or

b. p q? F F F F F his could be p q or ( p q) or Problem 9 Consider the following sentence: here is a student in this class who has taken some course in every department in the College of Engineering and Computer Science. a. Express the sentence using quantifiers (and logical propositions). You should use the variables: s student, c course, d department, and these should be the only variables. Give the domain of each variable. b. Find the logical negation of the quantifier expression that you obtained in (a). c. ranslate the negation you obtained in (b) into an English sentence. a. Define the following variables and domains Variable Domain s student this class c course all courses d department departments in the College We define the propositional function: P(s, c, d) = s took course c in department d. hen the sentence can be written as s d c P(s, c, d). b. he negation is s d c P(s, c, d). c. In English: Every student in this class has not taken any course in some department in the College.