Logical Equivalence of Propositions

Slides:



Advertisements
Similar presentations
Propositional Equivalences
Advertisements

Propositional Equivalences
PROOF BY CONTRADICTION
CS128 – Discrete Mathematics for Computer Science
Discrete Mathematics Lecture 1 Logic of Compound Statements Harper Langston New York University.
Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.
1 Section 1.2 Propositional Equivalences. 2 Equivalent Propositions Have the same truth table Can be used interchangeably For example, exclusive or and.
1 Math 306 Foundations of Mathematics I Math 306 Foundations of Mathematics I Goals of this class Introduction to important mathematical concepts Development.
Chapter 9: Boolean Algebra
Propositional Equivalence Goal: Show how propositional equivalences are established & introduce the most important such equivalences.
Rosen 1.6. Approaches to Proofs Membership tables (similar to truth tables) Convert to a problem in propositional logic, prove, then convert back Use.
Mathematical Structures A collection of objects with operations defined on them and the accompanying properties form a mathematical structure or system.
Propositional Equivalences
Chap. 2 Fundamentals of Logic. Proposition Proposition (or statement): an declarative sentence that is either true or false, but not both. e.g. –Margret.
Lecture 4. CONDITIONAL STATEMENTS: Consider the statement: "If you earn an A in Math, then I'll buy you a computer." This statement is made up of two.
Section 1.2: Propositional Equivalences In the process of reasoning, we often replace a known statement with an equivalent statement that more closely.
Logical Form and Logical Equivalence M Logical Form Example 1 If the syntax is faulty or execution results in division by zero, then the program.
Chapter 2 Logic 2.1 Statements 2.2 The Negation of a Statement 2.3 The Disjunction and Conjunction of Statements 2.4 The Implication 2.5 More on Implications.
Chapter 1: The Foundations: Logic and Proofs
Laws of Boolean Algebra Commutative Law Associative Law Distributive Law Identity Law De Morgan's Theorem.
UMBC CMSC 203, Section Fall CMSC 203, Section 0401 Discrete Structures Fall 2004 Matt Gaston
Symbolic Logic The Following slide were written using materials from the Book: The Following slide were written using materials from the Book: Discrete.
Spring 2003CMSC Discrete Structures1 Let’s get started with... Logic !
Mathematics for Comter I Lecture 3: Logic (2) Propositional Equivalences Predicates and Quantifiers.
Thinking Mathematically Logic 3.4 Truth Tables for the Conditional and Biconditional.
Discrete Mathematics Lecture # 4. Conditional Statements or Implication  If p and q are statement variables, the conditional of q by p is “If p then.
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
Law of logic Lecture 4.
Set Operators Goals Show how set identities are established
2. The Logic of Compound Statements Summary
Propositional Equivalences
The Foundations: Logic and Proofs
Advanced Algorithms Analysis and Design
Propositional Equivalence
CSE15 Discrete Mathematics 01/23/17
Discrete Mathematics Lecture 1 Logic of Compound Statements
CSNB 143 Discrete Mathematical Structures
Thinking Mathematically
Truth Tables and Equivalent Statements
Discrete Mathematics Logic of Compound Statements
COMP 1380 Discrete Structures I Thompson Rivers University
Citra Noviyasari, S.Si, MT
Classwork/Homework Classwork – Page 90 (11 – 49 odd)
(CSC 102) Discrete Structures Lecture 2.
CPCS222 Discrete Structures I
Discussion #10 Logical Equivalences
Discrete Mathematics Lecture # 2.
Mathematics for Computing
Sets and Logic…. Chapter 2
1.2 Propositional Equivalences
Propositional Equivalences
Information Technology Department
CS 220: Discrete Structures and their Applications
CS201: Data Structures and Discrete Mathematics I
Propositional Equivalences
CSE 311 Foundations of Computing I
CSS 342 Data Structures, Algorithms, and Discrete Mathematics I
Lecture 2: Propositional Equivalences
Discrete Mathematics Lecture # 3.
CSE 321 Discrete Structures
1.2 Propositional Equivalences
Statements of Symbolic Logic
Foundations of Discrete Mathematics
COMP 1380 Discrete Structures I Thompson Rivers University
1.2 Propositional Equivalences
Discrete Structures Prepositional Logic 2
A THREE-BALL GAME.
CS201: Data Structures and Discrete Mathematics I
Concepts of Computation
Propositional Satisfiability
Presentation transcript:

Logical Equivalence of Propositions Dr. Yasir Ali

Two statement forms are called logically equivalent if, and only if, they have identical truth values for each possible substitution of statements for their statement variables. The logical equivalence of statement forms p and q is denoted by writing p ≡ q.

Double Negation: Construct a truth table to show that the negation of the negation of a statement is logically equivalent to the statement. p ≡ ¬(¬p) p ¬p ¬(¬p) T F

Representation of If-Then As Or p →q ≡ ¬ p ∨ q p q ¬p p →q ¬p v q T F T T F F

¬p v q = I won’t catch the 8:05 bus or I am on time. Rewrite the following statement in if-then form. I am on time for work if I catch the 8:05 bus. Let p = I catch the 8:05 bus. q = I am on time. ¬p v q = I won’t catch the 8:05 bus or I am on time. Which can be re written as: I am on time or I won’t catch the 8:05 bus. You get to work hard or you will fail.

D’ Morgan Laws The negation of an and statement is logically equivalent to the or statement in which each component is negated. ¬(p ∧ q) ≡ ¬ p ∨ ¬ q. The negation of an or statement is logically equivalent to the and statement in which each component is negated. ¬(p ∨ q) ≡ ¬ p ∧ ¬ q.

The connector is loose or the machine is unplugged. The dollar is at an all-time high and the stock market is at a record low. Assume x is a particular real number and use De Morgan’s laws to write negations for the statements: −2 < x < 7 x ≤ −1 or x > 1

Tautology and Contradiction A tautology is a statement form that is always true regardless of the truth values of the individual statements substituted for its statement variables. A statement whose form is a tautology is a tautological statement. A contradiction is a statement form that is always false regardless of the truth values of the individual statements substituted for its statement variables. A statement whose form is a contradiction is a contradictory statement.

Tautology and Contradiction The statement form p ∨ ¬ p is a tautology and that the statement form p ∧ ¬ p is a contradiction. If t is a tautology and c is a contradiction, show that p ∧ t ≡ p and p ∧ c ≡ c p ¬ p p ∨ ¬ p p ∧ ¬ p T F p t c p ∧ t p ∧ c T F

Some Important Equivalences Name p ∧ t ≡ p p ∨ c ≡ p Identity laws p ∨ t ≡ t p ∧ c ≡ c Domination laws p ∨ p ≡ p p ∧ p ≡ p Idempotent laws ¬(¬p) ≡ p Double negation law p ∨ q ≡ q ∨ p p ∧ q ≡ q ∧ p Commutative laws (p ∨ q) ∨ r ≡ p ∨ (q ∨ r) (p ∧ q) ∧ r ≡ p ∧ (q ∧ r) Associative laws p ∨ (q ∧ r) ≡ (p ∨ q) ∧ (p ∨ r) p ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r) Distributive laws ¬(p ∧ q) ≡ ¬p ∨¬q ¬(p ∨ q) ≡ ¬p ∧¬q De Morgan’s laws p ∨ (p ∧ q) ≡ p p ∧ (p ∨ q) ≡ p Absorption laws p ∨¬p ≡ t p ∧¬p ≡ c Negation laws

Verify the logical equivalence ∼(∼p ∧ q) ∧ (p ∨ q) ≡ p. ∼(∼p ∧ q) ∧ (p ∨ q) ≡ (∼(∼p)∨ ∼q) ∧ (p ∨ q) by De Morgan’s laws by the double negative law ≡ (p∨ ∼q) ∧ (p ∨ q) by the distributive law ≡ p ∨ (∼q ∧ q) by the negation law ≡ p ∨ c by the identity law. ≡ p

Show that (p ∧ q) → (p ∨ q) is a tautology.

Negation of Conditional Statements The negation of “if p then q” is logically equivalent to “p and not q.” ¬(p →q) ≡ p ∧ ¬ q ¬(p →q) ≡ ¬(¬ p ∨ q) ≡ ¬(¬ p) ∧ (¬ q) by De Morgan’s laws ≡ p ∧ ¬ q by the double negative law.

It is tempting to write the negation of an if-then statement as another if-then statement. Please resist that temptation! Exercise: If P is a square, then P is a rectangle. If x is nonnegative, then x is positive or x is 0. If today is New Year’s Eve, then tomorrow is January.

A conditional statement is logically equivalent to its contrapositive.

Exercises from text book Page 34-35 questions 1-33