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

Similar documents
~ p is always false. Based on the basic truth table for disjunction, if q is true then p ~

CSC Discrete Math I, Spring Propositional Logic

Logical Operators. Conjunction Disjunction Negation Exclusive Or Implication Biconditional

Propositional Calculus. Problems. Propositional Calculus 3&4. 1&2 Propositional Calculus. Johnson will leave the cabinet, and we ll lose the election.

1.1 Language and Logic

Section L.1- Introduction to Logic

PROPOSITIONAL CALCULUS

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

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

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

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

Section 1.1: Logical Form and Logical Equivalence

1.1 Language and Logic

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

Mathematical Reasoning (Part I) 1

STRATEGIES OF PROBLEM SOLVING

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

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

EECS 1028 M: Discrete Mathematics for Engineers

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

1.1 Statements and Compound Statements

Introduction to Sets and Logic (MATH 1190)

Chapter 5: Section 5-1 Mathematical Logic

Exercise Set 1 Solutions Math 2020 Due: January 30, Find the truth tables of each of the following compound statements.

Truth Tables for Arguments

TRUTH TABLES LOGIC (CONTINUED) Philosophical Methods

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

Propositional Logic Basics Propositional Equivalences Normal forms Boolean functions and digital circuits. Propositional Logic.

Connectives Name Symbol OR Disjunction And Conjunction If then Implication/ conditional If and only if Bi-implication / biconditional

2.2: Logical Equivalence: The Laws of Logic

PSU MATH RELAYS LOGIC & SET THEORY 2017

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

Compound Propositions

Logic and Propositional Calculus

1.3 Propositional Equivalences

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

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

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.

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.

15414/614 Optional Lecture 1: Propositional Logic

DISCRETE MATHEMATICS BA202

AN INTRODUCTION TO MATHEMATICAL PROOFS NOTES FOR MATH Jimmy T. Arnold

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

PHI Propositional Logic Lecture 2. Truth Tables

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

Solutions to Exercises (Sections )

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

3.2: Compound Statements and Connective Notes

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

Foundation of proofs. Jim Hefferon.

Discrete Mathematics and Applications COT3100

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

Discrete Mathematical Structures. Chapter 1 The Foundation: Logic

Packet #1: Logic & Proofs. Applied Discrete Mathematics

The statement calculus and logic

FUNDAMENTALS OF MATHEMATICS HANDOUT 1.3 DR. MCLOUGHLIN

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

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

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

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

Section 1.1: Propositions and Connectives

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

University of California, San Diego Department of Computer Science and Engineering CSE 20. Solutions to Midterm Exam Winter 2018

Prof. Girardi Exam 1 Math 300 MARK BOX

Chapter 1 Elementary Logic

UNIT-I: Propositional Logic

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

AMTH140 Lecture 8. Symbolic Logic

Propositional Equivalence

Tautologies, Contradictions, and Contingencies

Math.3336: Discrete Mathematics. Propositional Equivalences

Chapter 1, Section 1.1 Propositional Logic

WUCT121. Discrete Mathematics. Logic. Tutorial Exercises

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

CSE 20 DISCRETE MATH. Fall

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

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

DEDUCTIVE REASONING Propositional Logic

Logical Reasoning. Chapter Statements and Logical Operators

Proofs. Joe Patten August 10, 2018

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

Homework assignment 1: Solutions

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.

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

Chapter 1: Formal Logic

Propositions. Frequently, we will use the word statement instead of proposition.

GENERAL MATHEMATICS 11

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

LING 106. Knowledge of Meaning Lecture 3-1 Yimei Xiang Feb 6, Propositional logic

Boolean Logic. CS 231 Dianna Xu

Basic Logic and Proof Techniques

Mat 243 Exam 1 Review

THE LOGIC OF COMPOUND STATEMENTS

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

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

COT 2104 Homework Assignment 1 (Answers)

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

PHIL12A Section answers, 16 February 2011

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

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

Transcription:

Name: MA 101 Exam 2 Logic (Part I) all 2017 Multiple-Choice Questions [5 pts each] Circle the correct answer on the following multiple-choice questions. 1. Which of the following is not a statement? a) All prime numbers are odd naturals greater than 1. b) 10 2017 2017 is larger than 10. c) riangles do not have 4 sides if and only if squares have exactly 5 corners. d) Sentences consisting of ten words or less are always false. e) or some integer x, x x 1. 2. If p is true, then what is the truth value of the compound statement ~ p (~ q r) a) rue. b) alse. c) his truth value cannot be determined.? 3. What can you conclude, in general, about the symbolic statement ~ pq, are component statements? a) It is a tautology (i.e. it is always true). b) It is a contradiction (i.e. it is always false). c) It is only true when q is true. d) It is only true when both p and q are true. p p q, where 4. How many rows would be needed to construct the truth table of a compound statement with 6 component statements? a) 12 b) 16 c) 32 d) 64

or questions 5 7, let w represent the statement he wife has long hair, h represent the statement he husband has a beard, and r represent the statement I remember this couple. 5. Which of the following is the symbolic representation of the statement It is not the case that the wife has long hair or that the husband has a beard. a) ~ w h b) ~ w ~ h c) ~ w h d) ~ w h 6. Which of the following is the verbal translation of the symbolic statement (~ w) (~ h)? a) Neither does the wife have long hair nor does the husband have a beard. b) he wife does not have long hair or the husband does not have a beard. c) It is not the case that the wife has long hair or the husband has a beard. d) Either the wife has long hair or the husband has a beard. 7. Which of the following is equivalent to the symbolic statement ~ w h r? a) he wife has long hair and the husband does not have a beard, provided I remember this couple. b) I remember this couple, provided the wife has long hair and the husband does not have a beard. c) I do not remember this couple, unless the wife has long hair and the husband does not have a beard. d) If I remember this couple, the wife has long hair and the husband does not have a beard.

Show all your work on the following problems to receive full credit. Problem 1 [15 pts] Write the following song lyrics symbolically. Specify the letters you attribute to each of the component statements in the quotation explicitly. a) You may say I m a dreamer but I am not the only one. - John Lennon b) Ready or not, here I come. - he Delfonics c) Lean on me when you re not strong and I ll be your friend. - Bill Withers

Problem 2 [15 pts] Write the negation of the following statements. Do not just provide symbolic answers. 11 a) 2017 2. b) She was unwilling to join the party or her car broke down that day. c) Everyone on Long Island was affected by super storm Sandy in 2012, but some did not lose power in their homes.

Problem 3 [15 pts] a) Use the truth tables provided below to show that ~ ~ p q is not logically equivalent to p ~ q, where p and q represent any two component statements. p q p q b) Can you prove that ~ ~ p q p ~ q without using truth tables? [Bonus 5pts]

Problem 4 [20 pts] a) Using the truth table below, show that the symbolic statement (~ p q) (~ q r) is a tautology (i.e. a compound statement that is always true.) p q r b) Consider the following three component statements: p All triangles have more than 3 sides. q Odd integers have a factor of 2. r Some pigs can solve differential equations. Using the truth table constructed in part a), how can you justify that the statement (~ p q) (~ q r) is still true with the components given above?

Bonus Problem [5 pts] In propositional logic, the disjunction p or q (written symbolically as p q) is said to be inclusive since it is true when either p is true, q is true, or both p and q are true. On the other hand, the disjunctive form Either p or q is said to be exclusive since it is not true when both p and q are true. Write this exclusive form of the disjunction symbolically along with its truth table.