AMTH140 Lecture 8. Symbolic Logic

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

CSC Discrete Math I, Spring Propositional Logic

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

Solutions to Homework I (1.1)

Compound Propositions

Propositional Logic Introduction and Basics. 2.2 Conditional Statements. 2.3 Inferencing. mjarrar 2015

2.2: Logical Equivalence: The Laws of Logic

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

CISC-102 Winter 2016 Lecture 17

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

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

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

Propositional Equivalence

PROPOSITIONAL CALCULUS

Propositional natural deduction

Set Theory Basics of Set Theory. mjarrar Watch this lecture and download the slides

Lecture 02: Propositional Logic

ANALYSIS EXERCISE 1 SOLUTIONS

2 Conditional and Biconditional Propositions

3.2: Compound Statements and Connective Notes

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

THE LOGIC OF COMPOUND STATEMENTS

Note: The area of logic that deals with propositions is called the propositional calculus or propositional logic.

Introduction. Applications of discrete mathematics:

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

An Introduction to Logic 1.1 ~ 1.4 6/21/04 ~ 6/23/04

We last time we began introducing equivalency laws.

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

Proofs. Joe Patten August 10, 2018

CSE20: Discrete Mathematics for Computer Science. Lecture Unit 2: Boolan Functions, Logic Circuits, and Implication

Boolean Logic. CS 231 Dianna Xu

TRUTH TABLES LOGIC (CONTINUED) Philosophical Methods

Discrete Mathematical Structures. Chapter 1 The Foundation: Logic

1.1 Language and Logic

DISCRETE MATH: LECTURE 3

A Statement; Logical Operations

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

Unit 2: Logic and Reasoning. start of unit

Propositional Logic. Fall () Propositional Logic Fall / 30

1.1 Language and Logic

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

Section 1.1: Logical Form and Logical Equivalence

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

1.3 Propositional Equivalences

Propositional Logic Not Enough

Section 1.2: Conditional Statements

Introduction to Decision Sciences Lecture 2

Logic and Discrete Mathematics. Section 3.5 Propositional logical equivalence Negation of propositional formulae

Equivalence and Implication

Propositional Logic, Predicates, and Equivalence

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.

2-4: The Use of Quantifiers

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.

DISCRETE STRUCTURES WEEK5 LECTURE1

FUNDAMENTALS OF MATHEMATICS HANDOUT 1.3 DR. MCLOUGHLIN


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

Discrete Mathematics & Mathematical Reasoning Predicates, Quantifiers and Proof Techniques

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.

The Logic of Compound Statements cont.

Chapter 1, Section 1.1 Propositional Logic

Packet #1: Logic & Proofs. Applied Discrete Mathematics

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

2 Truth Tables, Equivalences and the Contrapositive

Today s Topic: Propositional Logic

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

Discrete Mathematics

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

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

15414/614 Optional Lecture 1: Propositional Logic

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

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

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

Logical Operators. Conjunction Disjunction Negation Exclusive Or Implication Biconditional

GEOMETRY. Chapter 2: LOGIC. Name: Teacher: Pd:

Math.3336: Discrete Mathematics. Applications of Propositional Logic

CSE 311: Foundations of Computing. Lecture 2: More Logic, Equivalence & Digital Circuits

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

Section 3.1 Statements, Negations, and Quantified Statements

Elementary Logic and Proof

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

Mathematical Logic Part One

CISC-102 Fall 2018 Week 11

EECS 1028 M: Discrete Mathematics for Engineers

AI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic and Predicate Logic

Discrete Structures for Computer Science

MATHEMATICAL REASONING

Propositional Calculus: Formula Simplification, Essential Laws, Normal Forms

Discrete Mathematics and Its Applications

PHI Propositional Logic Lecture 2. Truth Tables

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

LECTURE 1. Logic and Proofs

Group 5. Jeremy Gutierrez. Jesus Ochoa Perez. Alvaro Gonzalez. MATH 170: Discrete Mathematics. Dr. Lipika Deka. March 14, 2014.

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

Overview. 1. Introduction to Propositional Logic. 2. Operations on Propositions. 3. Truth Tables. 4. Translating Sentences into Logical Expressions

Discrete Mathematics and Applications COT3100

Definition 2. Conjunction of p and q


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

Mathematical Reasoning (Part I) 1

Transcription:

AMTH140 Lecture 8 Slide 1 Symbolic Logic March 10, 2006 Reading: Lecture Notes 6.2, 6.3; Epp 1.1, 1.2 Logical Connectives Let p and q denote propositions, then: 1. p q is conjunction of p and q, meaning p and q. It is true when both p and q are true. Slide 2 2. p q is disjunction of p and q, meaning p or q. Note that or is always used in the inclusive sense, so p q is true when p is true or q is true or both are true. 3. p is negation of p, meaning not p. It is true when p is false. 1

Truth Tables Slide 3 p q p q p q p q p p T T T T T T T F T F F T F T F T F T F F T T F F F F F F Application Let Slide 4 p = John is healthy q = John is wealthy r = John is wise How do we express: 1. John is healthy, wealthy and wise. 2. John is not wealthy, but he is healthy and wise. 3. John is wealthy, but he is not both healthy and wise. 2

p = John is healthy, q = John is wealthy, r = John is wise 1. John is healthy, wealthy and wise. p (q r) Slide 5 2. John is not wealthy, but he is healthy and wise. ( q) (p r) 3. John is wealthy, but he is not both healthy and wise. q ( (p r)) Logical Equivalence Slide 6 Two compound propositions P and Q are logically equivalent, written P Q, if the two propositions have the same truth values for all possible truth values of the component propositions. Examples De Morgan s Laws (p q) ( p) ( q) (p q) ( p) ( q) 3

Applications What is the negation of Slide 7 Let then 1 < x 4 p = the proposition 1 < x q = the proposition x 4 p q = the proposition 1 < x 4 By De Morgan s laws (p q) ( p) ( q) Slide 8 so i.e. or ( 1 < x 4) ( ( 1 < x)) ( (x 4)) 1 x or x > 4 x 1 or x > 4 4

p = John is healthy, q = John is wealthy, r = John is wise Slide 9 In symbols, John is wealthy, but he is not both healthy and wise is q ( (p r)) By De Morgan s laws (p r) ( p) ( r) So q ( (p r)) q (( p) ( r)) i.e. John is wealthy, and he is not healthy or he is not wise. Examples Distributive Laws These are p (q r) (p q) (p r) p (q r) (p q) (p r) Slide 10 Thus John is wealthy or he is healthy and wise. is logically equivalent to John is wealthy or healthy and he is wealthy or wise. 5

p (q r) (p q) (p r) p q r q r p q p r p (q r) (p q) (p r) T T T T T T T T T T F T T F T T Slide 11 T F T T F T T T T F F F F F F F F T T T F F F F F T F T F F F F F F T T F F F F F F F F F F F F Conditional Statements If p and q are propositions then the conditional statement if p then q or p implies q is denoted by p q. It is false when p is true and q is false, otherwise it true. Slide 12 In a conditional statement p q, p is called the hypothesis and q is called the conclusion. A conditional statement which is true by virtue of its hypothesis being false is said to be true by default. The proposition If 1 + 1 = 3 then I am the king of England is true but uninformative. 6

Truth Table The proposition p q is true if either p is false or both p and q are true. p q p q Slide 13 T T T T F F F T T F F T Logical Equivalence p q ( p) q p q p p q ( p) q T T F T T Slide 14 T F F F F F T T T T F F T T T 7

Negation of a Conditional (p q) p ( q) Slide 15 p q p q q (p q) p ( q) T T T F F F T F F T T T F T T F F F F F T T F F Example is logically equivalent to If John is wealthy then is not wise. John is not wealthy or he is not wise. Slide 16 The negation is John is wealthy and he is wise. 8

Contrapositives The contrapositive of a conditional statement p q is the statement ( q) ( p). These are logically equivalent. Slide 17 p q ( q) ( p) p q q p p q ( q) ( p) T T F F T T T F T F F F F T F T T T F F T T T T Example The contrapositive of is If John is wealthy then is not wise. Slide 18 If John is wise then is not wealthy. 9

The Biconditional Slide 19 If p and q are propositions then the biconditional of p and q is p if and only if q and denoted by p q. It is true when p and q have the same truth value and false if they have opposite truth values. p q p q T T T T F F F T F F F T Logical Equivalence p q (p q) (q p) In words p if and only if q is logically equivalent to if p then q and if q then p or p implies q and q implies p. Slide 20 p q p q q p p q (p q) (q p) T T T T T T T F F T F F F T T F F F F F T T T T 10

Necessary and Sufficient Conditions If p and q are propositions then: 1. p is a necessary condition for q means that if q is true then it is necessary that p is true. Logically, q p. Slide 21 2. p is a sufficient condition for q means that p being true is sufficient for q to be true. Logically, p q. 3. Thus p is a necessary and sufficient condition for q means q p and p q, i.e. p q, Example 1. John is wise is a necessary condition for John to be wealthy means that he can t be wealthy without being wise, i.e. if John is wealthy then he is wise. Slide 22 2. John is wise is a sufficient condition for John to be wealthy means if John is wise then he is wealthy. 3. John is wise is a necessary and sufficient condition for John to be wealthy means John is wise if and only if he is wealthy or John is wise and wealthy or he is not wise and not wealthy. 11