MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.

Similar documents
1) The set of the days of the week A) {Saturday, Sunday} B) {Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, Sunday}

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

MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.

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

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

Where are my glasses?

PSU MATH RELAYS LOGIC & SET THEORY 2017

THE LOGIC OF COMPOUND STATEMENTS

Section 3.1 Statements, Negations, and Quantified Statements

DeMorgan s Laws and the Biconditional. Philosophy and Logic Sections 2.3, 2.4 ( Some difficult combinations )

Logic Review Solutions

1) A) 1 B) 2 C) 3 D) 2 3

ANALYSIS EXERCISE 1 SOLUTIONS

Mat 243 Exam 1 Review

CHAPTER 6 - THINKING ABOUT AND PRACTICING PROPOSITIONAL LOGIC

Review Test 1. MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.

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.

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

3.2: Compound Statements and Connective Notes

CSC Discrete Math I, Spring Propositional Logic

The statement calculus and logic

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

What is Logic? Introduction to Logic. Simple Statements. Which one is statement?

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

Unit I LOGIC AND PROOFS. B. Thilaka Applied Mathematics

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

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

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

FUNDAMENTALS OF MATHEMATICS HANDOUT 1.3 DR. MCLOUGHLIN

Box. Turn in your e xam to Kathy Stackhouse in Chem 303 by noon on Thursday, March 30.

Math Assignment 2 Solutions - Spring Jaimos F Skriletz Provide definitions for the following:

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

KOÇ UNIVERSITY EQUR 121 FIRST EXAM March 3, 2014

Pre-Algebra Summer Assignment

Aiste: Do you often go to that festival?

EECS 1028 M: Discrete Mathematics for Engineers

Logic and Propositional Calculus

Predicates, Quantifiers and Nested Quantifiers

Math 102 Section 08, Fall 2010 Solutions Practice for Formal Proofs of Arguments

Truth Tables for Arguments

LOGIC. Name: Teacher: Pd: Page 1

Test 1 Solutions(COT3100) (1) Prove that the following Absorption Law is correct. I.e, prove this is a tautology:

PROPOSITIONAL CALCULUS

THE LOGIC OF COMPOUND STATEMENTS

Section 1.2: Conditional Statements

DISCRETE MATHEMATICS BA202

Solutions for the fourth week s homework Math 131

Introduction to Sets and Logic (MATH 1190)

Fill in the blank with either or to make the statement true. A) B)

a. ~p : if p is T, then ~p is F, and vice versa

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

PS10.3 Logical implications

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?

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

Read ahead and use your textbook to fill in the blanks. We will work the examples together.

CCHS Math Unit Exam (Ch 1,2,3) Name: Math for Luiberal Arts (200 Points) 9/23/2014

Mathematical Logic Part One

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

Logic and Truth Tables

1.3 Propositional Equivalences

Math 1312 Lesson 1: Sets, Statements, and Reasoning. A set is any collection of objects. These objects are called the elements of the set.

Section 1.1: Logical Form and Logical Equivalence

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

Implications, Quantifiers, and Venn Diagrams. Implications Logical Quantifiers Venn Diagrams. Different Ways of Stating Implications

Mathematical Logic Part One

Midterm Exam Solution

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

PHIL12A Section answers, 16 February 2011

Chapter 2: The Logic of Compound Statements

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

Mathematical Logic Part One

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

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

Skills Practice Skills Practice for Lesson 3.1

Discrete Mathematical Structures. Chapter 1 The Foundation: Logic

Propositional Logic Not Enough

CS103 Handout 09 Fall 2012 October 19, 2012 Problem Set 4

Math Exam Jam Concise. Contents. 1 Algebra Review 2. 2 Functions and Graphs 2. 3 Exponents and Radicals 3. 4 Quadratic Functions and Equations 4

a n d n d n i n n d a o n e o t f o b g b f h n a f o r b c d e f g c a n h i j b i g y i t n d p n a p p s t e v i s w o m e b

Mathematical Logic Part One

Unit 6 Logic Math 116

Math161 HW#2, DUE DATE:

Numbers that are divisible by 2 are even. The above statement could also be written in other logically equivalent ways, such as:

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

Computer Science 280 Spring 2002 Homework 2 Solutions by Omar Nayeem

THE LOGIC OF COMPOUND STATEMENTS

FOUNDATION OF COMPUTER SCIENCE ETCS-203

A spinner has a pointer which can land on one of three regions labelled 1, 2, and 3 respectively.

Chapter 1, Section 1.1 Propositional Logic

Compound Propositions

Math.3336: Discrete Mathematics. Propositional Equivalences

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

Manual of Logical Style

Solutions to Exercises (Sections )

AMTH140 Lecture 8. Symbolic Logic

Boolean Logic Boolean logic combines multiple statements that are either true or false into an expression that is either true or false.

WORKSHEET. Área: ingles Periodo: 1 Fecha: 26 feb al 2 Mar. Competencia: writing and grammar comprehension. Uses of the past tenses Part I

Family Feud Review. Math 1001: Quantitative Skills and Reasoning. September 8, 2011

DEDUCTIVE REASONING Propositional Logic

Propositional Equivalence

Transcription:

Worksheet 10. (Sec 3.6-3.7) Please indicate the most suitable answer on blank near the right margin. Name MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Write the negation of the conditional statement. 1) If she can't take out the trash, I will. 1) A) She can take out the trash, and I can't. B) She can't take out the trash, and I won't. C) If she can take out the trash, I can't. D) She can't take out the trash, I can't. 2) If I get a high-paying job, then I can pay off all my bills. 2) A) I get a high-paying job and can pay off all my bills. B) I get a high-paying job and I cannot pay off all my bills. C) I don't get a high-paying job and can pay off all my bills. D) I don't get a high-paying job and cannot pay off all my bills. Use the De Morgan law that states: ~() is equivalent to ~ p to write an equivalent English statement for the statement. 3) It is not true that Boston and Russia are both states. 3) A) If Boston is a state, then Russia is not a state. B) Boston is not a state and Russia is not a state. C) It is true that Boston and Russia are both states. D) Boston is not a state or Russia is not a state. Use De Morgan's laws to write a negation of the statement. 4) She is not older than 21 and he is older than 21. 4) A) It is not true that she is older than 21 or he is not older than 21. B) She is older than 21 or he is not younger than 21. C) She is older than 21 or he is not older than 21. D) She is older than 21 but he is not older than 21. Use a truth table to determine whether the symbolic form of the argument is valid or invalid. 1

5) 5) p r ~ r q A) p q r p r () (p r) ~ r ~ r q [() (p r)] (~ r q) F T T F T F F T F B) p q r p r () (p r) ~ r ~ r q [() (p r)] (~ r q) T T F T F F T T F T F T F T F F T F T F F F F F T F F F T T F T F F T F F T F F T F T T F C) p q r p r () (p r) ~ r ~ r q [() (p r)] (~ r q) F T T F T F F T T F F F T T T T F T Symbolic argument is valid. 2

D) p q r p r () (p r) ~ r ~ r q [() (p r)] (~ r q) F T T F T F F T T 6) () (q r) 6) p r A) Valid B) Invalid SHORT ANSWER. Write the word or phrase that best completes each statement or answers the question. Translate the argument into symbolic form. Then use a truth table to determine whether the argument is valid or invalid. (Ignore differences in past, present, and future tense.) 7) If it is July or August, then I am living at the beach 7) I am not living at the beach. It is neither July nor August. 3

MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Write the passage in the form of an argument using the following simple statements: p: The "diamond" is a fake. q: Peter will be unhappy for weeks. The argument's conclusion should be: The diamond must not have been a fake. Determine if the argument is valid or invalid. 8) Peter bought a "diamond" from a street vendor. I was sure it was a fake and that it would make 8) Peter miserable for weeks. But I saw him a few days later. He had got the "diamond" appraised and looked quite happy... A) p The argument is invalid. C) The argument is invalid. B) D) The argument is valid. The argument is valid. SHORT ANSWER. Write the word or phrase that best completes each statement or answers the question. Draw a valid conclusion from the given premises. 9) If I work in the garden, my back gets sore. 9) If my back gets sore, I take a hot bath Therefore... 4

Translate the argument into symbolic form, then use the table below to determine whether the argument is valid or invalid. Indicate valid/invalid and identify the type of answer. VALID ARGUMENTS Direct Contrapositive p q INVALID ARGUMENTS Disjunctive ~ p q p Transitive q r ~ r Fallacy of the Converse q p Fallacy of the Inverse ~ p Misuse of Disjunctive p q Misuse of Transitive q r r p ~ r 10) If Fred studies hard, then he gets a good grade. 10) Fred got a good grade. He studies hard. 11) If he wants to come, he will say so. 11) If he says so, then he will come. If he comes, that means he wants to. MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Use an Euler diagram to determine whether the argument is valid or invalid. 12) All insects have six legs. 12) No spiders are insects. Therefore, no spiders have six legs. 13) Some people enjoy walking. 13) Some people enjoy swimming. Therefore, some people who enjoy walking enjoy swimming. 14) All soda pops are carbonated. 14) All diet colas are soda pops. Therefore, all diet colas are carbonated. 5