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

Similar documents
Discrete Mathematics

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

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

HOMEWORK 1: SOLUTIONS - MATH 215 INSTRUCTOR: George Voutsadakis

Your quiz in recitation on Tuesday will cover 3.1: Arguments and inference. Your also have an online quiz, covering 3.1, due by 11:59 p.m., Tuesday.

Section 1.1 Propositional Logic. proposition : true = T (or 1) or false = F (or 0) (binary logic) the moon is made of green cheese

PROPOSITIONAL CALCULUS

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

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

Logic and Propositional Calculus

Full file at

Basic Logic and Proof Techniques

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.

CSC Discrete Math I, Spring Propositional Logic

PS10.3 Logical implications

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

Logical Operators. Conjunction Disjunction Negation Exclusive Or Implication Biconditional

Section 1.1: Logical Form and Logical Equivalence

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

Direct Proof and Proof by Contrapositive

1.1 Language and Logic

WUCT121. Discrete Mathematics. Logic. Tutorial Exercises

1.1 Language and Logic

Unit I LOGIC AND PROOFS. B. Thilaka Applied Mathematics

Introduction. Applications of discrete mathematics:

Discrete Structures of Computer Science Propositional Logic I

1.1 Statements and Compound Statements

INTRODUCTION TO LOGIC 3 Formalisation in Propositional Logic

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

FUNDAMENTALS OF MATHEMATICS HANDOUT 1.3 DR. MCLOUGHLIN

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

Discrete Mathematics Exam File Spring Exam #1

Unit 1. Propositional Logic Reading do all quick-checks Propositional Logic: Ch. 2.intro, 2.2, 2.3, 2.4. Review 2.9

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

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

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

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

EECS 1028 M: Discrete Mathematics for Engineers

COT 2104 Homework Assignment 1 (Answers)

Chapter 1, Section 1.1 Propositional Logic

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

Compound Propositions

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

Conditional Statements

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

Discrete Mathematical Structures. Chapter 1 The Foundation: Logic

Unit 1 Logic Unit Math 114

Choosing Logical Connectives

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

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

Chapter 1 Elementary Logic

Boolean Logic. CS 231 Dianna Xu

Chapter 2: The Logic of Quantified Statements. January 22, 2010

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

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

2.2: Logical Equivalence: The Laws of Logic

Chapter 1: Formal Logic

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

The statement calculus and logic

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

Mathematical Reasoning (Part I) 1

Math.3336: Discrete Mathematics. Propositional Equivalences

Introduction to Sets and Logic (MATH 1190)

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

Chapter 5: Section 5-1 Mathematical Logic

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

Introduction Propositional Logic. Discrete Mathematics Andrei Bulatov

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

Packet #1: Logic & Proofs. Applied Discrete Mathematics

Definitions Chapter 1 Proof Technique (Pg.1): Proof (Pg.2): Statement (Pg.2): Conditional Statement/Implication (Pg3.): Hypothesis(Pg.

Chapter 1 Logic Unit Math 114

Introduction to Decision Sciences Lecture 2

Discrete Structures for Computer Science

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

Propositional Equivalence

Introduction Propositional Logic

Today s Topic: Propositional Logic

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

Steinhardt School of Culture, Education, and Human Development Department of Teaching and Learning. Mathematical Proof and Proving (MPP)

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

Theorem. For every positive integer n, the sum of the positive integers from 1 to n is n(n+1)

Logic and Proof. On my first day of school my parents dropped me off at the wrong nursery. There I was...surrounded by trees and bushes!

Mat 243 Exam 1 Review

Announcements. Exam 1 Review

Show Your Work! Point values are in square brackets. There are 35 points possible. Tables of tautologies and contradictions are on the last page.

DISCRETE MATHEMATICS BA202

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

On my first day of school my parents dropped me off at the wrong nursery. There I was...surrounded by trees and bushes! 26-Aug-2011 MA

1 Propositional Logic

THE LOGIC OF COMPOUND STATEMENTS

PSU MATH RELAYS LOGIC & SET THEORY 2017

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

Homework 3: Solutions

Logic and Truth Tables

Number Sets, Measurements, and Laws of Algebra

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

Section 3.1 Statements, Negations, and Quantified Statements

Midterm Exam Solution

Topics in Logic and Proofs

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

Transcription:

1&2 Propositional Calculus Propositional Calculus Problems Jim Woodcock University of York October 2008 1. Let p be it s cold and let q be it s raining. Give a simple verbal sentence which describes each of the following propositions: (a) p (b) p q (c) p q (d) q p (e) p q (f) q Propositional Calculus 3&4 2. Let p be she s tall and let q be she s beautiful. Write propositions that symbolise the following: (a) She s tall and beautiful. (b) She s tall but not beautiful. (c) It s false that she s short or beautiful. (d) She s neither tall nor beautiful. (e) It isn t true that she s short or not beautiful. 3. Translate into symbols the following compound statements: (a) We ll win the election, provided that Brown is elected leader of the party. (b) If Brown isn t elected leader of the party, then either Straw or Johnson will leave the cabinet, and we ll lose the election. (c) If x is a rational number and y is an integer, then z isn t real. (d) Either the murderer has left the country or somebody is hiding him. (e) If the murderer has not left the country, then somebody is hiding him. (f) The sum of two numbers is even if and only if either both numbers are even or both numbers are odd. (g) If y is an integer, then z isn t real, provided that x is a rational number.

5&6 Propositional Calculus 4. Let p be the proposition It s snowing. Let q be the proposition I ll go to town. Let r be the proposition I have time. (a) Using propositional connectives, write a proposition which symbolises each of the following: i. If it isn t snowing and I have time, then I ll go to town. ii. I ll go to town only if I have time. iii. It isn t snowing. iv. It s snowing, and I ll not go to town. (b) Write a sentence in English corresponding to each of the following propositions: i. q r p ii. r q iii. (q r) (r q) iv. (r q) Propositional Calculus 7&8 5. State the converse and contrapositive of each of the following: (a) If it rains, I m not going. (b) I ll stay only if you go. (c) If you get 4lbs, you can bake the cake. (d) I can t complete the task if I don t get more help. 6. Let p, q, r denote the following statements: p: Triangle ABC is isosceles; q: Triangle ABC is equilateral; r: Triangle ABC is equiangular. Translate each of the following into an English sentence. (a) q p (b) p q (c) q r (d) p q (e) r p

9&10 Propositional Calculus 7. (a) How many rows are needed for the truth table of the following proposition? p q r s t (b) Ifp1, p2,...,pn are propositional variables, and the compound statement p contains at least one occurrence of each propositional variable pi, how many rows are needed in order to construct the truth table for p? 8. Find truth tables for the following propositions: (a) p q (b) (p q) (c) (p q) 9. Express each of the following statements in the form p q. (a) Rain on Tuesday is a necessary condition for rain on Sunday. (b) If it rains on Tuesday, then it rains on Wednesday. (c) But it rains on Wednesday only if it rains on Friday. (d) Moreover, no rain on Monday means no rain on Friday. (e) Finally, rain on Monday is a sufficient condition for rain on Saturday. Given that it rains on Sunday, what can be said about Saturday s weather? 10. Verify that the proposition p (p q) is a tautology. 11. Verify that the proposition (p q) (p q) is a contradiction. Propositional Calculus 11&12 12. Which of the following propositions are tautologies? (a) p (q p) (b) q r ( r q) (c) (p q) ((q r) (r p)) (d) (p (q r)) ((p q) r) 13. Show that the following pairs of propositions are logically equivalent. (a) p q, q p (b) (p q) r, (p r) (q r) (c) p q r, r q p (d) p q r, (p q) r 14. Show that the proposition ( p q) (p q) isn t a tautology. 15. Show that the following argument is valid: p q, q p. 16. Show that the following argument is valid: p q, q p. 17. Show that the following argument is a fallacy: p q p q. 18. Test the validity of the following argument: If I study, then I ll not fail mathematics. If I do not play Lemmings, then I ll study. But I failed mathematics. Therefore I played Lemmings. 19. What conclusion can be drawn from the truth of p p?

13&14 Propositional Calculus 20. For each of the following expressions, use identities to find equivalent expressions which use only and and are as simple as possible. (a) p q r (b) p ( q r p) (c) p (q r) 21. For each of the following expressions, use identities to find equivalent expressions which use only and and are as simple as possible. (a) p q r (b) (p q r) p q (c) p q ( r p) Propositional Calculus 15&16 22. Establish the following tautologies by simplifying the left-hand side to the form of the right-hand side: (a) (p q p) true (b) ( (p q) p) false (c) ((q p) ( p q) (q q)) p (d) ((p p) ( p p)) false 23. (a) The nand operator (also known to logicians as the Sheffer stroke), is defined by the following truth table: p q p nand q t t f t f t f t t f f t Of course, nand is a contraction of not-and; p nand q is logically equivalent to (p q). Show that i. (p nand p) p ii. ((p nand p) nand (q nand q)) p q iii. ((p nand q) nand (p nand q)) p q

17&18 Propositional Calculus (b) Find equivalent expressions for the following, using no connectives other than nand: i. p q ii. p q (c) The nor operator (also known to logicians as the Pierce arrow), is defined by the following truth table: p q p nor q t t f t f f f t f f f t For each of the following, find equivalent expressions which use only the nor operator. i. p ii. p q iii. p q Propositional Calculus 19&20 24. Formalise the second and third proofs of the theorem: if x 2 3x + 2 < 0, then x > 0 25. Write a program to construct truth tables of propositions.