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

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

PHI Propositional Logic Lecture 2. Truth Tables

Truth Tables for Arguments

Section 1.1: Logical Form and Logical Equivalence

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

CSC Discrete Math I, Spring Propositional Logic

PL: Truth Trees. Handout Truth Trees: The Setup

THE LOGIC OF COMPOUND STATEMENTS

Maryam Al-Towailb (KSU) Discrete Mathematics and Its Applications Math. Rules Math. of1101 Inference 1 / 13

Propositional Equivalence

Math.3336: Discrete Mathematics. Propositional Equivalences

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

Introduction to Sets and Logic (MATH 1190)

Symbolic Logic 3. For an inference to be deductively valid it is impossible for the conclusion to be false if the premises are true.

Propositional Logic Review

PS10.3 Logical implications

PSU MATH RELAYS LOGIC & SET THEORY 2017

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

Tautologies, Contradictions, and Contingencies

DEDUCTIVE REASONING Propositional Logic

PHIL12A Section answers, 28 Feb 2011

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

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

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

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

Supplementary exercises in propositional logic

1 Tautologies, contradictions and contingencies

Proving logical equivalencies (1.3)

Compound Propositions

Section 1.2 Propositional Equivalences. A tautology is a proposition which is always true. A contradiction is a proposition which is always false.

13.3 Truth Tables for the Conditional and the Biconditional

Logic and Truth Tables

Test 6A. Chapter 6 Test A

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

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

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

Logic and Truth Tables

1.3 Propositional Equivalences

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

PROPOSITIONAL CALCULUS

Propositional Logic George Belic

Discrete Mathematics

COT 2104 Homework Assignment 1 (Answers)

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

Mat 243 Exam 1 Review

Propositional Language - Semantics

Computation and Logic Definitions

A Quick Lesson on Negation

FORMAL PROOFS DONU ARAPURA

Sec$on Summary. Tautologies, Contradictions, and Contingencies. Logical Equivalence. Normal Forms (optional, covered in exercises in text)

Homework 3: Solutions

The Logic of Compound Statements cont.

2 Truth Tables, Equivalences and the Contrapositive

Logical forms and substitution instances. Philosophy and Logic Unit 2, Section 2.1

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

Logic: Propositional Logic Truth Tables

Introduction to Metalogic

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

Truth Tables for Propositions

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

Announcements CompSci 102 Discrete Math for Computer Science

Logic Review Solutions

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

ANALYSIS EXERCISE 1 SOLUTIONS

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

a. See the textbook for examples of proving logical equivalence using truth tables. b. There is a real number x for which f (x) < 0. (x 1) 2 > 0.

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

3.0. OBJECTIVES 3.1.INTRODUCTION

8.8 Statement Forms and Material Equivalence

Lecture 13: Soundness, Completeness and Compactness

Discrete Mathematical Structures. Chapter 1 The Foundation: Logic

1. Propositions: Contrapositives and Converses

Formal Logic Lecture 11

SOEN331 Winter Tutorial 4 on Logic

First Order Logic: Syntax and Semantics

MAT2345 Discrete Math

The statement calculus and logic

The following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof

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

Foundations of algebra

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

FOUNDATION OF COMPUTER SCIENCE ETCS-203

THE LOGIC OF COMPOUND STATEMENTS

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

DERIVATIONS AND TRUTH TABLES

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

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

VALIDITY IN SENTENTIAL LOGIC

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.

Midterm Exam Solution

3 The Semantics of the Propositional Calculus

The Foundations: Logic and Proofs. Part I

WUCT121. Discrete Mathematics. Logic. Tutorial Exercises

8. Reductio ad absurdum

CHAPTER 6 - THINKING ABOUT AND PRACTICING PROPOSITIONAL LOGIC

5. And. 5.1 The conjunction

Propositional Logic (2A) Young W. Lim 11/8/15

Informatics 1 - Computation & Logic: Tutorial 1

Introduction Logic Inference. Discrete Mathematics Andrei Bulatov

Transcription:

Practice Exam 2 You MUS show all your work, and indicate which value is the main operator value. I. ranslate the following statements into symbolic form, using A, B, C, and D. hen, using your knowledge of the truth of propositions A, B, C, and D in these exercises, determine the truth values of propositions 1-7. 1. Alaska is a state and British Columbia is a state, or California is a state. 2. Alaska is not a state if either British Columbia is a state or California is a state. 3. Both Alaska is a state and British Columbia is a state provided that Delaware is not in the Pacific time zone. 4. Delaware is in the Pacific time zone if and only if California is not a state. 5. If Alaska is a state implies that either British Columbia is a state or California is a state, then Delaware is in the Pacific time zone. 6. Delaware is in the Pacific time zone only if neither California nor Alaska is a state. 7. Delaware is in the Pacific time zone; however, given that British Columbia is a state and California is not a state, Alaska is a state. II. ill in the blanks with necessary or sufficient to make the following statements true. hen translate the statements into symbolic form. 1. Being beheaded is a condition for losing one s life. Symbolic form (use B and L): 2. Being a reptile is a condition for being a lizard. Symbolic form (use R and L): 3. A passport is a condition for traveling to Europe. Symbolic form (use P and E):

III. Given that A and B are true and X and Y are false, determine the truth values of the following propositions. Show your work and circle the answer. 1. [(A X) v (Y B)] ~[(A v X) (B v Y)] 2. [(B v X) (B ~Y)] [(~Y A) (Y v ~B)] 3. (A A) v (X ~Y) IV. Use an ordinary truth table to determine whether the following propositions are tautologous (), self-contradictory (S-C), or contingent (C) I recommend using one pool of values for all three statements. V. Answer the following questions about propostions 1-3 in part IV above. 1. Are 1 and 2 logically equivalent, contradictory, consistent, or inconsistent? 2. Are 2 and 3 logically equivalent, contradictory, consistent, or inconsistent? 3. Are 1 and 3 logically equivalent, contradictory, consistent, or inconsistent? 1. (A B) ~(B v ~A) 2. (A B) [(A B) v B] 3. [B ~(A v B)] v A VI. Use and show an ordinary truth table to answer the following questions. 1. Albert says to Barbara: Our philosophy instructor just said that if the class studies hard then the class won t fail the exam. Barbara replies: Unfortunately the instructor s claim is consistent with the claim that the class will study hard or it will fail the exam. Is Barbara correct? (Use C and ) 2. Yasmine says to Zatoichi: Russia will call for a cease fire if and only if Europe imposes sanctions. Zatoichi responds by saying: But that means that Russia won t call for a cease fire given that Europe won t impose sanctions. Is Zatoichi correct? (Use R and E) VII. Determine whether the following arguments are valid or invalid by constructing an ordinary truth table for each. If an argument is invalid, circle the pertinent truth values. 1. A B / ~C ~B / A v C // B v C 2. (A ~B) v (B ~A) / (B ~A) (~B A) // ~(B v ~A)

3. A ~B / ~A B // B ~A VIII. Use indirect truth tables to determine whether the following arguments are valid or invalid. Be sure to explicitly note any contradictions that result from this process. 1. (A B) v (C D) / B (E ) / D (G H) // v H 2. ~A v G / B ~ / B ~G // ~A ~B 3. A v B / ~A v (C D) / B (E ) // D IX. Use indirect truth tables to determine if the following sets of claims are consistent. Be sure to explicitly note any contradictions that result from this process. 1. G ~C / [B v (G A)] / (G v B) 2. (C v A) G / ~B v C / ~C (B ~A) PRACICE EXAM 2 ANSWER KEY I. Please be sure to CIRCLE the main operator value, unfortunately here I ve only been able to highlight the main operator value in bold type. 1. (A B) v C 5. [A (B v C)] D 2. (B v C) ~A 6. D ~(C v A) 3. ~D (A B) 7. D [(B ~C) A]

4. D ~C II. 1. Being beheaded is a sufficient condition for losing one s life. Symbolic form (use B and L): B L 2. Being a reptile is a necessary condition for being a lizard. Symbolic form (use R and L): L R 3. A passport is a necessary condition for traveling to Europe. Symbolic form (use P and E): E P III. I ve worked these out on one line, with the m.o. value in bold. 1. [(A X) v (Y B)] ~[(A v X) (B v Y)] 2. [(B v X) (B ~Y)] [(~Y A) (Y v ~B)] 3. (A A) v (X ~Y) IV. Again, the m.o. values are in bold. Self-Contradictory autologous Contingent AB 1. (A B) ~(B v ~A) 2. (A B) [(A B) v B] 3. [B ~(A v B)] v A V. Answer the following questions about propostions 1-3 in part IV above. 1. Are 1 and 2 logically equivalent, contradictory, consistent, or inconsistent? 2. Are 2 and 3 logically equivalent, contradictory, consistent, or inconsistent? 3. Are 1 and 3 logically equivalent, contradictory, consistent, or inconsistent? VI. Use and show an ordinary truth table to answer the following questions. 1. C C ~ / C v Yes, Barbara is correct, see rows 2 & 3.

2. R E R E / ~E ~R No, Zatoichi is wrong, see row 3. VII. Determine whether the following arguments are valid or invalid by constructing an ordinary truth table for each. If an argument is invalid, circle the pertinent truth values. ABC 1. A B / ~C ~B / A v C // B v C his argument is valid, it cannot have all true premises and a false conclusion. AB 2. (A ~B) v (B ~A) / (B ~A) (~B A) // ~(B v ~A) <---Shows invalid AB 3. A ~B / ~A B // B ~A <------Shows invalid VII. You must indicate contradictions, and can simply cross out the relevant m.o. value. 1. (A B) v (C D) / B (E ) / D (G H) // v H X Contradiction in the first premise, therefore VALID 2. ~A v G / B ~ / B ~G // ~A ~B INVALID

3. A v B / ~A v (C D) / B (E ) // D INVALID Also: < doesn t work, but < does VIII. Use indirect truth tables to determine if the following sets of claims are consistent. Be sure to explicitly note any contradictions that result from this process. 1. G ~C / [B v (G A)] / (G v B) CONSISEN 2. (C v A) G / ~B v C / ~C (B ~A) CONSISEN <----- doesn t work, but <------does