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

Save this PDF as:

Size: px
Start display at page:

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

## Transcription

1 1&2 Propositional Calculus Propositional Calculus Problems Jim Woodcock University of York October 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.

2 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

3 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& 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?

4 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& 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

5 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& Formalise the second and third proofs of the theorem: if x 2 3x + 2 < 0, then x > Write a program to construct truth tables of propositions.

### CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS 1.1 - Logical Form and Logical Equivalence Definition. A statement or proposition is a sentence that is either true or false, but not both. ex. 1 + 2 = 3 IS a statement

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

Logic: Truth Tables CS160 Rosen Chapter 1 Logic? 1 What is logic? Logic is a truth-preserving system of inference Truth-preserving: If the initial statements are true, the inferred statements will be true

### HOMEWORK 1: SOLUTIONS - MATH 215 INSTRUCTOR: George Voutsadakis

HOMEWORK 1: SOLUTIONS - MATH 215 INSTRUCTOR: George Voutsadakis Problem 1 Make truth tables for the propositional forms (P Q) (P R) and (P Q) (R S). Solution: P Q R P Q P R (P Q) (P R) F F F F F F F F

### CSC Discrete Math I, Spring Propositional Logic

CSC 125 - Discrete Math I, Spring 2017 Propositional Logic Propositions A proposition is a declarative sentence that is either true or false Propositional Variables A propositional variable (p, q, r, s,...)

### Logic and Propositional Calculus

CHAPTER 4 Logic and Propositional Calculus 4.1 INTRODUCTION Many algorithms and proofs use logical expressions such as: IF p THEN q or If p 1 AND p 2, THEN q 1 OR q 2 Therefore it is necessary to know

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

What is Logic? Introduction to Logic Peter Lo Logic is the study of reasoning It is specifically concerned with whether reasoning is correct Logic is also known as Propositional Calculus CS218 Peter Lo

### 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.

LOGIC In mathematical and everyday English language, we frequently use logic to express our thoughts verbally and in writing. We also use logic in numerous other areas such as computer coding, probability,

### Discrete Structures of Computer Science Propositional Logic I

Discrete Structures of Computer Science Propositional Logic I Gazihan Alankuş (Based on original slides by Brahim Hnich) July 26, 2012 1 Use of Logic 2 Statements 3 Logic Connectives 4 Truth Tables Use

### Section 1.1: Logical Form and Logical Equivalence

Section 1.1: Logical Form and Logical Equivalence An argument is a sequence of statements aimed at demonstrating the truth of an assertion. The assertion at the end of an argument is called the conclusion,

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

Chapter 1: The Logic of Compound Statements January 7, 2008 Outline 1 1.1 Logical Form and Logical Equivalence 2 1.2 Conditional Statements 3 1.3 Valid and Invalid Arguments Central notion of deductive

### Logical Operators. Conjunction Disjunction Negation Exclusive Or Implication Biconditional

Logical Operators Conjunction Disjunction Negation Exclusive Or Implication Biconditional 1 Statement meaning p q p implies q if p, then q if p, q when p, q whenever p, q q if p q when p q whenever p p

### Introduction. Applications of discrete mathematics:

Introduction Applications of discrete mathematics: Formal Languages (computer languages) Compiler Design Data Structures Computability Automata Theory Algorithm Design Relational Database Theory Complexity

### WUCT121. Discrete Mathematics. Logic. Tutorial Exercises

WUCT11 Discrete Mathematics Logic Tutorial Exercises 1 Logic Predicate Logic 3 Proofs 4 Set Theory 5 Relations and Functions WUCT11 Logic Tutorial Exercises 1 Section 1: Logic Question1 For each of the

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

Logic? Propositional Logic (Rosen, Chapter 1.1 1.3) TOPICS Propositional Logic Truth Tables Implication Logical Proofs 10/1/12 CS160 Fall Semester 2012 2 What is logic? Logic is a truth-preserving system

### Unit I LOGIC AND PROOFS. B. Thilaka Applied Mathematics

Unit I LOGIC AND PROOFS B. Thilaka Applied Mathematics UNIT I LOGIC AND PROOFS Propositional Logic Propositional equivalences Predicates and Quantifiers Nested Quantifiers Rules of inference Introduction

### 2.2: Logical Equivalence: The Laws of Logic

Example (2.7) For primitive statement p and q, construct a truth table for each of the following compound statements. a) p q b) p q Here we see that the corresponding truth tables for two statement p q

### Conditional Statements

Conditional Statements Lecture 3 Section 2.2 Robb T. Koether Hampden-Sydney College Fri, Jan 17, 2014 Robb T. Koether (Hampden-Sydney College) Conditional Statements Fri, Jan 17, 2014 1 / 26 1 Conditional

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

MAT 101 Solutions Exam 2 (Logic, Part I) Multiple-Choice Questions 1. D Because this sentence contains exactly ten words, it is stating that it is false. But if it is taken to be false, then it has to

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

Unit 1. Propositional Logic Reading do all quick-checks Propositional Logic: Ch. 2.intro, 2.2, 2.3, 2.4. Review 2.9 Typeset September 23, 2005 1 Statements or propositions Defn: A statement is an assertion

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

Statements Compounds and Truth Tables. Statements, Negations, Compounds, Conjunctions, Disjunctions, Truth Tables, Logical Equivalence, De Morgan s Law, Tautology, Contradictions, Proofs with Logical Equivalent

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

CS100: DISCREE SRUCURES Lecture 5: Logic (Ch1) Lecture Overview 2 Statement Logical Connectives Conjunction Disjunction Propositions Conditional Bio-conditional Converse Inverse Contrapositive Laws of

### INTRODUCTION TO LOGIC 3 Formalisation in Propositional Logic

Introduction INRODUCION O LOGIC 3 Formalisation in Propositional Logic Volker Halbach If I could choose between principle and logic, I d take principle every time. Maggie Smith as Violet Crawley in Downton

### Choosing Logical Connectives

Choosing Logical Connectives 1. Too Few Connectives?: We have chosen to use only 5 logical connectives in our constructed language of logic, L1 (they are:,,,, and ). But, we might ask, are these enough?

### Discrete Mathematical Structures. Chapter 1 The Foundation: Logic

Discrete Mathematical Structures Chapter 1 he oundation: Logic 1 Lecture Overview 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Quantifiers l l l l l Statement Logical Connectives Conjunction

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

COT3100: Propositional Equivalences 1 Logic and Proofs Jan 2007 COT3100: Propositional Equivalences 2 1 Translating from Natural Languages EXAMPLE. Translate the following sentence into a logical expression:

### Unit 1 Logic Unit Math 114

Unit 1 Logic Unit Math 114 Section 1.1 Deductive and Induction Reasoning Deductive Reasoning: The application of a general statement to a specific instance. Deductive reasoning goes from general to specific

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

Math 15 - Spring 2017 - Homework 1.1 and 1.2 Solutions 1. (1.1#1) Let the following statements be given. p = There is water in the cylinders. q = The head gasket is blown. r = The car will start. (a) Translate

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

Chapter 2: The Logic of Quantified Statements January 22, 2010 Outline 1 2.1- Introduction to Predicates and Quantified Statements I 2 2.2 - Introduction to Predicates and Quantified Statements II 3 2.3

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

5 Logic In this part of the course we consider logic. Logic is used in many places in computer science including digital circuit design, relational databases, automata theory and computability, and artificial

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

Formal Methods Midterm 1, Spring, 2007 Name Show Your Work! Point values are in square brackets. There are 35 points possible. Tables of tautologies and contradictions are on the last page. 1. Use truth

### Propositional Equivalence

Propositional Equivalence Tautologies and contradictions A compound proposition that is always true, regardless of the truth values of the individual propositions involved, is called a tautology. Example:

### Packet #1: Logic & Proofs. Applied Discrete Mathematics

Packet #1: Logic & Proofs Applied Discrete Mathematics Table of Contents Course Objectives Page 2 Propositional Calculus Information Pages 3-13 Course Objectives At the conclusion of this course, you should

### Chapter 5: Section 5-1 Mathematical Logic

Chapter 5: Section 5-1 Mathematical Logic D. S. Malik Creighton University, Omaha, NE D. S. Malik Creighton University, Omaha, NE Chapter () 5: Section 5-1 Mathematical Logic 1 / 29 Mathematical Logic

### DISCRETE MATHEMATICS BA202

TOPIC 1 BASIC LOGIC This topic deals with propositional logic, logical connectives and truth tables and validity. Predicate logic, universal and existential quantification are discussed 1.1 PROPOSITION

### Topics in Logic and Proofs

Chapter 2 Topics in Logic and Proofs Some mathematical statements carry a logical value of being true or false, while some do not. For example, the statement 4 + 5 = 9 is true, whereas the statement 2

### Today s Topic: Propositional Logic

Today s Topic: Propositional Logic What is a proposition? Logical connectives and truth tables Translating between English and propositional logic Logic is the basis of all mathematical and analytical

### Logic and Truth Tables

Logic and Truth Tables What is a Truth Table? A truth table is a tool that helps you analyze statements or arguments in order to verify whether or not they are logical, or true. There are five basic operations

### Sec\$on Summary. Propositions Connectives. Truth Tables. Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional

Section 1.1 Sec\$on Summary Propositions Connectives Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional ruth ables 2 Proposi\$ons A proposition is a declarative

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

Proposition/Statement Boolean Logic CS 231 Dianna Xu A proposition is either true or false but not both he sky is blue Lisa is a Math major x == y Not propositions: Are you Bob? x := 7 1 2 Boolean variables

### Number Sets, Measurements, and Laws of Algebra

Number Sets, Measurements, and Laws of Algebra Sequences and Series Descriptive Statistics Sets and Venn Diagrams Area of a triangle: Law of Sines: 1 2 ab sinc a sin A = b sin B = c sinc sin A

### Chapter 2: Introduction to Propositional Logic

Chapter 2: Introduction to Propositional Logic PART ONE: History and Motivation Origins: Stoic school of philosophy (3rd century B.C.), with the most eminent representative was Chryssipus. Modern Origins:

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

Chapter 3: Logic Diana Pell Section 3.1: Statements and Quantifiers A statement is a declarative sentence that is either true or false, but not both. Exercise 1. Decide which of the following are statements

### Symbolic Logic Outline

Symbolic Logic Outline 1. Symbolic Logic Outline 2. What is Logic? 3. How Do We Use Logic? 4. Logical Inferences #1 5. Logical Inferences #2 6. Symbolic Logic #1 7. Symbolic Logic #2 8. What If a Premise

### LOGIC. Name: Teacher: Pd: Page 1

LOGIC Name: Teacher: Pd: Page 1 Table of Contents Day 1 Introduction to Logic HW pages 8-10 Day 2 - Conjunction, Disjunction, Conditionals, and Biconditionals HW pages 16-17 #13-34 all, #35 65(every other

### Mathematical Logic. Truth Tables. Truth Tables: Example. Practical Class: Formalization in Propositional Logic. Chiara Ghidini

Practical Class: Formalization in Propositional Logic 1 2 FBK-IRST, Trento, Italy 2014/2015 3 : Example F G F F G F G F G T T F T T T T F F F T F F T T F T T F F T F F T Truth tables of some propositional

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

E6 PPENDIX E Introduction to Logic E.2 Implications, Quantifiers, and Venn Diagrams Implications Logical Quantifiers Venn Diagrams Implications statement of the form If p, then q is called an implication

### LECTURE 1. Logic and Proofs

LECTURE 1 Logic and Proofs The primary purpose of this course is to introduce you, most of whom are mathematics majors, to the most fundamental skills of a mathematician; the ability to read, write, and

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

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

### Argument. whenever all the assumptions are true, then the conclusion is true. If today is Wednesday, then yesterday is Tuesday. Today is Wednesday.

Logic and Proof Argument An argument is a sequence of statements. All statements but the first one are called assumptions or hypothesis. The final statement is called the conclusion. An argument is valid

### To reason to a correct conclusion, we must build our arguments on true statements. Sometimes it is helpful to use truth tables. Simple Truth Table p

Geometry Week 9 Sec 5.3 and 5.4 section 5.3 To reason to a correct conclusion, we must build our arguments on true statements. Sometimes it is helpful to use truth tables. Simple Truth Table p T F p F

### 2 Truth Tables, Equivalences and the Contrapositive

2 Truth Tables, Equivalences and the Contrapositive 12 2 Truth Tables, Equivalences and the Contrapositive 2.1 Truth Tables In a mathematical system, true and false statements are the statements of the

### Formal Logic: Quantifiers, Predicates, and Validity. CS 130 Discrete Structures

Formal Logic: Quantifiers, Predicates, and Validity CS 130 Discrete Structures Variables and Statements Variables: A variable is a symbol that stands for an individual in a collection or set. For example,

### 4.1 Real-valued functions of a real variable

Chapter 4 Functions When introducing relations from a set A to a set B we drew an analogy with co-ordinates in the x-y plane. Instead of coming from R, the first component of an ordered pair comes from

### CHAPTER 6 - THINKING ABOUT AND PRACTICING PROPOSITIONAL LOGIC

1 CHAPTER 6 - THINKING ABOUT AND PRACTICING PROPOSITIONAL LOGIC Here, you ll learn: what it means for a logic system to be finished some strategies for constructing proofs Congratulations! Our system of

### Propositional Logic 1

Propositional Logic 1 Section Summary Propositions Connectives Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional Truth Tables 2 Propositions A proposition is

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

Logic Logic is study of abstract reasoning, specifically, concerned with whether reasoning is correct. Logic focuses on relationship among statements as opposed to the content of any particular statement.

### UNIT 2: A DISCUSSION ON FUNDAMENTALS OF LOGIC

UNIT 2: A DISCUSSION ON FUNDAMENTALS OF LOGIC Introduction: Logic is being used as a tool in a number of situations for a variety of reasons. Logic is found to be extremely useful in decision taking problems.

### Logic of Sentences (Propositional Logic) is interested only in true or false statements; does not go inside.

You are a mathematician if 1.1 Overview you say to a car dealer, I ll take the red car or the blue one, but then you feel the need to add, but not both. --- 1. Logic and Mathematical Notation (not in the

### The Logic of Compound Statements cont.

The Logic of Compound Statements cont. CSE 215, Computer Science 1, Fall 2011 Stony Brook University http://www.cs.stonybrook.edu/~cse215 Refresh from last time: Logical Equivalences Commutativity of :

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

CS103 Handout 09 Fall 2012 October 19, 2012 Problem Set 4 This fourth problem set explores propositional and first-order logic, along with its applications. Once you've completed it, you should have a

### FORMAL PROOFS DONU ARAPURA

FORMAL PROOFS DONU ARAPURA This is a supplement for M385 on formal proofs in propositional logic. Rather than following the presentation of Rubin, I want to use a slightly different set of rules which

### Unit 6 Logic Math 116

Unit 6 Logic Math 116 Logic Unit Statement: A group words or symbols that can be classified as true or false. Examples of statements Violets are blue Five is a natural number I like Algebra 3 + 7 = 10

### HANDOUT AND SET THEORY. Ariyadi Wijaya

HANDOUT LOGIC AND SET THEORY Ariyadi Wijaya Mathematics Education Department Faculty of Mathematics and Natural Science Yogyakarta State University 2009 1 Mathematics Education Department Faculty of Mathematics

### MATHEMATICAL REASONING

QUESTION BANK FOR FIRST YEAR P U C CHAPTER: 14 MATHEMATICAL REASONING One mark questions 1. What is a mathematically acceptable statement? 2. What kind of sentences are not statements? NOTE : While dealing

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

Proposition logic and argument CISC2100, Spring 2017 X.Zhang 1 Where are my glasses? I know the following statements are true. 1. If I was reading the newspaper in the kitchen, then my glasses are on the

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

Propositional Logic Propositions A proposition is a declaration of fact that is either true or false, but not both. Examples and non-examples: One plus two equals four (proposition) Mozart is the greatest

### Only one of the statements in part(a) is true. Which one is it?

M02/1/13 1. Consider the statement If a figure is a square, then it is a rhombus. or this statement, write in words (i) (ii) (iii) its converse; its inverse; its contrapositive. Only one of the statements

### Propositional Logic Logical Implication (4A) Young W. Lim 4/21/17

Propositional Logic Logical Implication (4A) Young W. Lim Copyright (c) 2016-2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation

### CSE 20 DISCRETE MATH. Fall

CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Distinguish between a theorem, an axiom, lemma, a corollary, and a conjecture. Recognize direct proofs

### 9/5/17. Fermat s last theorem. CS 220: Discrete Structures and their Applications. Proofs sections in zybooks. Proofs.

Fermat s last theorem CS 220: Discrete Structures and their Applications Theorem: For every integer n > 2 there is no solution to the equation a n + b n = c n where a,b, and c are positive integers Proofs

### Logic Review Solutions

Logic Review Solutions 1. What is true concerning the validity of the argument below? (hint: Use a Venn diagram.) 1. All pesticides are harmful to the environment. 2. No fertilizer is a pesticide. Therefore,

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

Symbolic Logic 3 Testing deductive validity with truth tables For an inference to be deductively valid it is impossible for the conclusion to be false if the premises are true. So, given that truth tables

### IB MATH STUDIES. Summer Review Packet for Students. Richard Montgomery High School

IB IB MAH SUDIES Summer Review Packet for Students he problems in the packet are designed to help you review topics from Algebra 2 and Pre-Calculus that are important to your success in IB Math Studies.

### Section 2.1: Introduction to the Logic of Quantified Statements

Section 2.1: Introduction to the Logic of Quantified Statements In the previous chapter, we studied a branch of logic called propositional logic or propositional calculus. Loosely speaking, propositional

### MA103 STATEMENTS, PROOF, LOGIC

MA103 STATEMENTS, PROOF, LOGIC Abstract Mathematics is about making precise mathematical statements and establishing, by proof or disproof, whether these statements are true or false. We start by looking

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

Announcements CS311H: Discrete Mathematics Propositional Logic II Instructor: Işıl Dillig First homework assignment out today! Due in one week, i.e., before lecture next Wed 09/13 Remember: Due before

### practice: logic [159 marks]

practice: logic [159 marks] Consider two propositions p and q. Complete the truth table below. 1a. [4 marks] (A1)(A1)(ft)(A1)(A1)(ft) (C4) Note: Award (A1) for each correct column (second column (ft) from

### ECOM Discrete Mathematics

ECOM 2311- Discrete Mathematics Chapter # 1 : The Foundations: Logic and Proofs Fall, 2013/2014 ECOM 2311- Discrete Mathematics - Ch.1 Dr. Musbah Shaat 1 / 85 Outline 1 Propositional Logic 2 Propositional

### Solutions to Homework Set 1

Solutions to Homework Set 1 1. Prove that not-q not-p implies P Q. In class we proved that A B implies not-b not-a Replacing the statement A by the statement not-q and the statement B by the statement

### 1 Tautologies, contradictions and contingencies

DEDUCTION (I) TAUTOLOGIES, CONTRADICTIONS AND CONTINGENCIES & LOGICAL EQUIVALENCE AND LOGICAL CONSEQUENCE October 6, 2003 1 Tautologies, contradictions and contingencies Consider the truth table of the

### 2 Conditional and Biconditional Propositions

18 FUNDAMENTALS OF MATHEMATICAL LOGIC 2 Conditional and Biconditional Propositions Let p and q be propositions. The implication p! q is the proposition that is false only when p is true and q is false;

### Logic in Computer Science (COMP118) Tutorial Problems 1

Logic in Computer Science (COMP118) Tutorial Problems 1 1. Let p 1 denote the proposition: Tom s house is red; p 2 denote the proposition: Jim s house is red; p 3 denote the proposition: Mary s house is

### IF-THEN STATEMENTS DAY 17

IF-THEN STATEMENTS DAY 17 DEDUCTIVE REASONING: The process of using orderly statements to make logical conclusions. IF-THEN STATEMENTS: CONDITIONAL STATEMENTS CONDITIONAL CONVERSE (FLIPPED CONDITIONAL)

### EECS-1019c: Assignment #1

Fall 2015 EECS-1019c: Assignment #1 w/ answers 1 of 7 Out of N points. EECS-1019c: Assignment #1 Section 1.1 [20pt] (Choose 10 of 20) 2. [10pt] Which of these are propositions? What are the truth values

### Chapter 3. Propositional Logic

Chapter 3 Propositional Logic 3.1 ARGUMENT FORMS This chapter begins our treatment of formal logic. Formal logic is the study of argument forms, abstract patterns of reasoning shared by many different

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

Section 1.2 Propositional Equivalences A tautology is a proposition which is always true. Classic Example: P P A contradiction is a proposition which is always false. Classic Example: P P A contingency

### Logical Reasoning. Chapter Statements and Logical Operators

Chapter 2 Logical Reasoning 2.1 Statements and Logical Operators Preview Activity 1 (Compound Statements) Mathematicians often develop ways to construct new mathematical objects from existing mathematical

### MATH CSE20 Homework 5 Due Monday November 4

MATH CSE20 Homework 5 Due Monday November 4 Assigned reading: NT Section 1 (1) Prove the statement if true, otherwise find a counterexample. (a) For all natural numbers x and y, x + y is odd if one of

### Notes for Recitation 1

6.042/18.062J Mathematics for Computer Science September 10, 2010 Tom Leighton and Marten van Dijk Notes for Recitation 1 1 Logic How can one discuss mathematics with logical precision, when the English

### An Introduction to Mathematical Reasoning

An Introduction to Mathematical Reasoning Matthew M. Conroy and Jennifer L. Taggart University of Washington 2 Version: December 28, 2016 Contents 1 Preliminaries 7 1.1 Axioms and elementary properties

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

CSCE 222 Discrete Structures for Computing Predicate Logic Dr. Hyunyoung Lee Based on slides by Andreas Klappenecker 1 Predicates A function P from a set D to the set Prop of propositions is called a predicate.

### Math Real Analysis

1 / 28 Math 370 - Real Analysis G.Pugh Sep 3 2013 Real Analysis 2 / 28 3 / 28 What is Real Analysis? Wikipedia: Real analysis... has its beginnings in the rigorous formulation of calculus. It is a branch

### Introduction to Metalogic 1

Philosophy 135 Spring 2012 Tony Martin Introduction to Metalogic 1 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: (i) sentence letters p 0, p 1, p 2,... (ii) connectives,

8. Reductio ad absurdum 8.1 A historical example In his book, The Two New Sciences, 10 Galileo Galilea (1564-1642) gives several arguments meant to demonstrate that there can be no such thing as actual

### Rules of Inference. Arguments and Validity

Arguments and Validity A formal argument in propositional logic is a sequence of propositions, starting with a premise or set of premises, and ending in a conclusion. We say that an argument is valid if

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

Math 378 Exam 1 Spring 2009 Show all Work Name 1) Let h = John is healthy, w = John is wealthy and s = John is wise Write the following statement is symbolic form a) In order for John to be wealthy it

### Truth Table Definitions of Logical Connectives

Truth Table Definitions of Logical Connectives 1. Truth Functions: Logicians DEFINE logical operators in terms of their relation to the truth or falsehood of the statement(s) that they are operating on.