Q250: Math and Logic Unit 1 Review Problems for 9/7/12

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

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

Rules Build Arguments Rules Building Arguments

PROPOSITIONAL CALCULUS

CSC Discrete Math I, Spring Propositional Logic

Logical Operators. Conjunction Disjunction Negation Exclusive Or Implication Biconditional

Predicate Logic. Andreas Klappenecker

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

III. Elementary Logic

PHI Propositional Logic Lecture 2. Truth Tables

Mathacle. PSet ---- Algebra, Logic. Level Number Name: Date: I. BASICS OF PROPOSITIONAL LOGIC

Mat 243 Exam 1 Review

Math.3336: Discrete Mathematics. Nested Quantifiers/Rules of Inference

Readings: Conjecture. Theorem. Rosen Section 1.5

3. The Logic of Quantified Statements Summary. Aaron Tan August 2017

DISCRETE MATHEMATICS BA202

CSCE 222 Discrete Structures for Computing. Predicate Logic. Dr. Hyunyoung Lee. !!!!! Based on slides by Andreas Klappenecker

Natural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic.

Logic. Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another.

Proof Worksheet 2, Math 187 Fall 2017 (with solutions)

CSE 20 DISCRETE MATH. Winter

Predicate Logic & Quantification

Chapter 1, Logic and Proofs (3) 1.6. Rules of Inference

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

A Quick Lesson on Negation

CSE 20: Discrete Mathematics

What is the decimal (base 10) representation of the binary number ? Show your work and place your final answer in the box.

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

COMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University

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

Proofs. Example of an axiom in this system: Given two distinct points, there is exactly one line that contains them.

Advanced Topics in LP and FP

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

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

Math 3336: Discrete Mathematics Practice Problems for Exam I

Section 1.2: Propositional Logic

Review. Propositions, propositional operators, truth tables. Logical Equivalences. Tautologies & contradictions

Proving Arguments Valid in Predicate Calculus

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

The Logic of Compound Statements cont.

Introduction Logic Inference. Discrete Mathematics Andrei Bulatov

CSCI.6962/4962 Software Verification Fundamental Proof Methods in Computer Science (Arkoudas and Musser) Chapter p. 1/33

A. Propositional Logic

(Refer Slide Time: 02:20)

CS 2336 Discrete Mathematics

Analyzing Arguments with Truth Tables

Warm-Up Problem. Write a Resolution Proof for. Res 1/32

Review for Midterm 1. Andreas Klappenecker

Tutorial 2 Logic of Quantified Statements

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

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

University of Ottawa CSI 2101 Midterm Test Instructor: Lucia Moura. February 9, :30 pm Duration: 1:50 hs. Closed book, no calculators

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

Rules of Inference. Arguments and Validity

HANDOUT AND SET THEORY. Ariyadi Wijaya

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

Logic and Proofs. (A brief summary)

ICS141: Discrete Mathematics for Computer Science I

Example ( x.(p(x) Q(x))) ( x.p(x) x.q(x)) premise. 2. ( x.(p(x) Q(x))) -elim, 1 3. ( x.p(x) x.q(x)) -elim, x. P(x) x.

15414/614 Optional Lecture 1: Propositional Logic

Discrete Structures of Computer Science Propositional Logic III Rules of Inference

CSE 20 DISCRETE MATH. Fall

MACM 101 Discrete Mathematics I. Exercises on Predicates and Quantifiers. Due: Tuesday, October 13th (at the beginning of the class)

COMP219: Artificial Intelligence. Lecture 19: Logic for KR

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

COMP219: Artificial Intelligence. Lecture 19: Logic for KR

Packet #1: Logic & Proofs. Applied Discrete Mathematics

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

8.8 Statement Forms and Material Equivalence

Part Two: The Basic Components of the SOFL Specification Language

CPSC 121: Models of Computation. Module 6: Rewriting predicate logic statements

Packet #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics

Logic. Logic is a discipline that studies the principles and methods used in correct reasoning. It includes:

Overview. I Review of natural deduction. I Soundness and completeness. I Semantics of propositional formulas. I Soundness proof. I Completeness proof.

CSE 20 DISCRETE MATH SPRING

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

Today s Lecture 2/25/10. Truth Tables Continued Introduction to Proofs (the implicational rules of inference)

CSE 20 DISCRETE MATH WINTER

Supplementary Logic Notes CSE 321 Winter 2009

Intro to Logic and Proofs

Propositional Logic. Spring Propositional Logic Spring / 32

Review: Potential stumbling blocks

Solutions to Exercises (Sections )

Unit I LOGIC AND PROOFS. B. Thilaka Applied Mathematics

Logic and Proofs. (A brief summary)

A Little Deductive Logic

Review 3. Andreas Klappenecker

Tautologies, Contradictions, and Contingencies

Discrete Structures for Computer Science

UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc (MATHEMATICS) I Semester Core Course. FOUNDATIONS OF MATHEMATICS (MODULE I & ii) QUESTION BANK

Overview. Knowledge-Based Agents. Introduction. COMP219: Artificial Intelligence. Lecture 19: Logic for KR

10 LOGIC Introduction. Objectives

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

KS MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) RULES OF INFERENCE. Discrete Math Team

Chapter 2: The Logic of Quantified Statements

At least one of us is a knave. What are A and B?

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

A Little Deductive Logic

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

Manual of Logical Style

Transcription:

2. i. p ( q p) p q q q p p ( q p) T T F F F T F T T T F T F F T F F T F T Q250: Math and Logic Unit 1 Review Problems for 9/7/12 ii. (p q) ( r q) p q r r p q r q (p q) ( r q) T T T F T T T T T F T T T T T F T F F F T T F F T F T F F T T F F T F F T F T F T F F F T F F F T F F F T F T F iii. (p r q) (q p) p q r p p r q q p (p r q) (q p) T T T F T F F T T F F T F F T F T F T T T T F F F T T T F T T T T T T F T F T T T T F F T T T F F F F F T F F T iv. (p r) ( p r) p r p r p r p r (p r) ( p r) T T F F T T T T F F T F T T F T T F F F F F F T T F T T v. ((p r) q) (p q) p q r q p r (p r) q p q ((p r) q) (p q) T T T F T T T T T T F F F F T F T F T T T T F F T F F T F T F F F T T F F F F T F T F F F F F T F F T T F T F F F F F T F T F F 1

4. Determine whether each of the following propositions is a tautology, a contradiction, or neither (a contingency). If it is a contingency, provide two interpretations that demonstrate this is the case. i. (p q) ( r q): Neither because entries 1-3 and 7 are true, but 4-6 and 8 are false. p q r r p q r q (p q) ( r q) T T T F T T T T T F T T T T T F T F F F T T F F T F T F F T T F F T F F T F T F T F F F T F F F T F F F T F T F ii. (p r) (p r): Tautology because all entries are true. p r r p r p r (p r) (p r) T T F T F T T F T F T T F T F F T T F F T F T T iii. ((p q) (r q)) (p q r): Neither because entries 3 and 4 are true, but 1, 2, and 5-8 are false. p q r q p q r q (p q) (r q) p q r ((p q) (r q)) (p q r) T T T F F T T F F T T F F F T T F F T F T T T T T T T T F F T T F F F T F T T F F T T F F F T F F F T T F F F F T T F T T F F F F F T F F T F F iv. ((a b) c) ((a b) c): Typo, so disregard, but here is how to do the problem as written anyway. Neither because entries 1, 3, 5, 7, and 8 are true, but 2, 4, and 6 are false. a b c c a b (a b) c ((a b) c) ((a b) c) ((a b) c) ((a b) c) T T T F T F F T T T F T T T T F T F T F T F F T T F F T T T T F F T T F T F F T F T F T T T T F F F T F F F F T F F F T F F F T 2

v. (q p) ( s q) (p s) q: Contradiction because all entries are false. p q s q s q p s q p s (p s) (q p) ( s q) (p s) q T T T F F T T T F F T T F F T T F F T F T F T T F T T T F F T F F T T T T F T F F T T F F F T T F F F T F F T F F T F F F F T T F T T T F F F F F T T T T T F F 6. For each of the following, prove that the conclusion follows logically from the premises. i. s: p q, r (p q), r p Prove: q r Conclusion does not follow. ii. s: ( q r) p, r (p q), (r p) q Conclusion does not follow. Prove: q iii. s: p q, q r 1. p q 2. q 3. q r 4. r 5. p q r iv. s: p q, p q, p Typo: Disregard Prove: p q r Prove: p Disjunction Elimination: 2,3 Disjunction Introduction: 4 v. s: p ( q r), r (q p), q Prove: r q 1. r (q p) 2. r 3. q p 4. p 5. p ( q r) 6. q r 7. q 8. q 9. r Modus Tollens: 1,2 Conjunction Elimination: 3 Disjunction Elimination: 4,5 Conjunction Elimination: 6 Contradiction: 1-8 10. r q Conjunction Introduction: 8,9 vi. s: p (n s), (p r) (q m) 1. p (n s) 2. p 3. p r 4. (p r) (q m) 5. q m 6. q 7. p q Prove: p q Disjunction Introduction: 2 Modus Tollens: 3,4 Conjunction Elimination: 5 Conjunction Introduction: 2,6 3

vii. s: s t, p q, (p r) s 1. p q 2. p 3. p r 4. (p r) s 5. s 6. s t 7. t Prove: t Disjunction Introduction: 2 Modus Ponens: 3,4 Modus Ponens: 5,6 viii. s: (m n) (q m), m q, (m q) (m n) Prove: n m 1. m q 2. (m q) (m n) 3. m n 4. (m n) (q m) 5. q m 6. m 7. q 8. q 9. m Modus Ponens: 1,2 Modus Ponens: 3,4 Modus Tollens: 5,6 Disjunction Elimination: 1,6 Contradiction: 6-8 10. n m Disjunction Introduction: 9 ix. s: ( w y) (z a), w x, x, a 1. x 2. w x 3. w 4. w y 5. ( w y) (z a) 6. z a 7. a 8. z Prove: z Modus Tollens: 1,2 Disjunction Introduction: 3 Modus Ponens: 4,5 Disjunction Elimination: 6,7 x. s: D E, E F Prove: (D A) (F E) 1. D E 2. E F 3. D A 4. D 5. E 6. F 7. F E 8. (D A) (F E) Conjunction Elimination: 3 Modus Ponens: 1,4 Modus Ponens: 2,5 Conjunction Introduction: 5,6 Implication Introduction: 3-7 7. Transform each informal argument into predicate logic. Then give a formal proof. i. All monkeys who play chess drive well. Therefore, if there is a monkey that plays chess, then there is a monkey that can drive well. Let Chess(x) mean that x plays chess, and let Drives(x) mean that x drives well, where the domain of discourse of x is monkeys. 1. x Chess(x) Drives(x) 2. Chess(c) Drives(c) 3. x Chess(x) x Drives(x) Existential Introduction: 2 4

ii. All superheroes who wear a cape get stuck in sliding doors. Therefore, if all superheroes wear a cape, then at least some superheroes get stuck in sliding doors. Let Cape(x) mean that x wears a cape, and let Stuck(x) mean that x gets stuck in sliding doors, where the domain of discourse of x is superheroes. 1. x Cape(x) Stuck(x) 2. Cape(c) Stuck(c) 3. x Cape(x) x Stuck(x) Universal Intro and Existential Intro: 2 iii. Everyone who is sane can do logic. No lunatics are fit to serve on a jury. None of your friends can do logic. Therefore, if a person is fit to serve on a jury, then he/she is not your friend. Let Sane(x) mean that x is sane, let Logic(x) mean that x can do logic, let Friend(x) mean that x is your friend, and let Jury(x) mean that x is fit to serve on a jury, where the domain of discourse of x is people. 1. x Sane(x) Logic(x) 2. x Sane(x) Jury(x) 3. x Friend(x) Logic(x) 4. Sane(c) Logic(c) 5. Sane(c) Jury(c) 6. Friend(c) Logic(c) 7. Jury(c) 8. Sane(c) 9. Logic(c) 10. Friend(c) 11. Jury(c) Friend(c) 12. x Jury(x) Friend(x) Universal Elimination: 2 Universal Elimination: 3 Modus Tollens: 5,7 Modus Ponens: 4,8 Modus Tollens: 6,9 Implication Introduction: 7-10 Universal Introduction: 7-11 iv. Babies are illogical. Nobody is despised who can manage a crocodile. Illogical persons are despised. Therefore babies cannot manage crocodiles. Let Baby(x) mean that x is a baby, let Logical(x) mean that x is Logical, let Despised(x) mean that x is despised, and let Croc(x) mean that x can manage crocodiles, where the domain of discourse of x is people. 1. x Baby(x) Logical(x) 2. x Croc(x) Despised(x) 3. x Logical(x) Despised(x) 4. Baby(c) Logical(c) 5. Croc(c) Despised(c) Universal Elimination: 2 6. Logical(c) Despised(c) Universal Elimination: 3 7. Baby(c) 8. Logical(c) Modus Ponens: 4,7 9. Despised(c) Modus Ponens: 6,8 10. Croc(c) Modus Tollens: 5,9 11. Baby(c) Croc(c) Implication Introduction: 7-10 12. x Baby(x) Croc(x) Universal Introduction: 7-11 5

2024 © sciencedocbox.com Privacy Policy | Terms of Service | Feedback