Classwork/Homework Classwork – Page 90 (11 – 49 odd)

Slides:



Advertisements
Similar presentations
3 Logic The Study of What’s True or False or Somewhere in Between.
Advertisements

CS128 – Discrete Mathematics for Computer Science
Uses for Truth Tables Determine the truth conditions for any compound statementDetermine the truth conditions for any compound statement Determine whether.
Discrete Mathematics Math 6A Instructor: M. Welling.
Truth Tables for Negation, Conjunction, and Disjunction.
Normal or Canonical Forms Rosen 1.2 (exercises). Logical Operators  - Disjunction  - Conjunction  - Negation  - Implication p  q   p  q  - Exclusive.
Propositions and Truth Tables
2.5 Verifying Arguments Write arguments symbolically. Determine when arguments are valid or invalid. Recognize form of standard arguments. Recognize common.
Mathematical Structures A collection of objects with operations defined on them and the accompanying properties form a mathematical structure or system.
Copyright © Curt Hill Truth Tables A way to show Boolean Operations.
Chapter 1 The Logic of Compound Statements. Section 1.1 Logical Form and Logical Equivalence.
2.2 Statements, Connectives, and Quantifiers
Logical Form and Logical Equivalence Lecture 2 Section 1.1 Fri, Jan 19, 2007.
Logic Disjunction A disjunction is a compound statement formed by combining two simple sentences using the word “OR”. A disjunction is true when at.
How do I show that two compound propositions are logically equivalent?
Thinking Mathematically
COMP 170 L2 Part 3 of Course Chapter 3 of Textbook.
Logical Form and Logical Equivalence Lecture 1 Section 1.1 Wed, Jan 12, 2005.
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.
Thinking Mathematically Logic 3.4 Truth Tables for the Conditional and Biconditional.
 Statement - sentence that can be proven true or false  Truth value – true or false  Statements are often represented using letters such as p and q.
CS-7081 Application - 1. CS-7082 Example - 2 CS-7083 Simplifying a Statement – 3.
 Conjunctive Normal Form: A logic form must satisfy one of the following conditions 1) It must be a single variable (A) 2) It must be the negation of.
Chapter 1 Propositional Logic
Introduction to Logic © 2008 Pearson Addison-Wesley.
Truth Tables for Negation, Conjunction, and Disjunction
2. The Logic of Compound Statements Summary
Propositional Logic.
The Foundations: Logic and Proofs
AND.
DISCRETE MATHEMATICS CHAPTER I.
Thinking Mathematically
Truth Tables and Equivalent Statements
CHAPTER 3 Logic.
Truth Tables for Negation, Conjunction, and Disjunction
Citra Noviyasari, S.Si, MT
How do I show that two compound propositions are logically equivalent?
Discrete Mathematics Lecture # 2.
Logic – Bell Ringer.
Chapter 8 Logic Topics
1.2 Propositional Equivalences
Propositional Equivalences
Information Technology Department
CS 220: Discrete Structures and their Applications
Section 3.4 Equivalent Statements
TRUTH TABLES.
TRUTH TABLES continued.
(1.4) An Introduction to Logic
Discrete Mathematics and Its Applications Kenneth H
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Lecture 2: Propositional Equivalences
Discrete Mathematics Lecture 2: Propositional Logic
Discrete Mathematics CMP-200 Propositional Equivalences, Predicates & Quantifiers, Negating Quantified Statements Abdul Hameed
1.2 Propositional Equivalences
MAT 3100 Introduction to Proof
Truth tables Construct a truth table for the following statements:
Equivalent Statements
Statements of Symbolic Logic
Section 3.7 Switching Circuits
Introductory Logic PHI 120
Truth tables Mrs. Palmer.
1.2 Propositional Equivalences
Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction
Truth Tables for the Conditional and Biconditional
Section 3.4 Equivalent Statements
A THREE-BALL GAME.
2-2 Logic Vocab Statement: A sentence that is either true or false
CHAPTER 3 Logic.
Truth Tables for Conditional and Biconditional Statements
Propositional Satisfiability
Presentation transcript:

Classwork/Homework Classwork – Page 90 (11 – 49 odd) Homework – Page 90 (12 – 50 even)

2.3 Truth Tables Learn the truth tables for the five fundamental connectives. Compute truth tables for compound statements. Determine when statements are logically equivalent. State and apply DeMorgan’s laws.

Negating a statement reverses its truth value. If p is a true statement, then its negation is false. If p is a false statement, then its negation is true. p ~ p T F Possible truth values for statement p. Logical truth values for ~ p.

A conjunction is true only when both of its component parts are true. The and connective also works in logic as it does in everyday life. In order for the conjunction to be true, both parts (p and q) need to be true. p q p ^ q T F

A disjuction is false only when both of its component parts are false. Mathematicians use the word or slightly differently then we use or in everyday life. In everyday conversation, we use the exclusive or (one or the other, but not both). In logic, we use the inclusive or (one or the other or both). p q p q T F

We use truth tables to find the logical values of complex statements. When calculating truth tables of compound statements, you also have to pay attention to the order in which you perform logical operations. Tautology – a statement that is always true. If a statement has k variables, then its truth table will have 2k lines.

Logically equivalent statements express the same meaning. Two statements are logically equivalent if they have the same variables and, when their truth tables are computed, the final columns in the tables are identical. DeMorgan’s laws for logic: if p and q are statements, then ~ (p q) is logically equivalent to (~ p) (~ q) ~ (p q) is logically equivalent to (~ p) (~ q)

There is an alternative way to construct truth tables. Truth table for ( ~ p q) (p q) Method 1 1 2 3 4 p q ~ p ~ p ^ q p ^ q (~ p ^ q) (p ^ q) T F

Method 2 Truth table for ( ~ p q) (p q) 1 2 4 3 p q ( ~ q) (p T F

Classwork/Homework Classwork – Page 102 (29 - 33 odd, 37 - 41 odd) Homework – Page 102 (30 - 34 even, 38 – 42 even)

Classwork/Homework Classwork – Page 102 (37 – 45 odd, 61 – 67 odd) Homework – Page 102 (38 – 48 even, 62 – 68 even)