Chapter 8 Logic Topics 3.1-3.4.

Slides:



Advertisements
Similar presentations
Geometry Chapter 2 Terms.
Advertisements

TRUTH TABLES The general truth tables for each of the connectives tell you the value of any possible statement for each of the connectives. Negation.
04 March 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.
IB Math Studies – Topic 3. IB Course Guide Description.
CS128 – Discrete Mathematics for Computer Science
Logic Chapter 2. Proposition "Proposition" can be defined as a declarative statement having a specific truth-value, true or false. Examples: 2 is a odd.
SEVENTH EDITION and EXPANDED SEVENTH EDITION
Adapted from Discrete Math
IB Math Studies – Topic 3. IB Course Guide Description.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Propositions and Truth Tables
Propositions and Truth Tables. Proposition: Makes a claim that may be either true or false; it must have the structure of a complete sentence.
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
2.5 Verifying Arguments Write arguments symbolically. Determine when arguments are valid or invalid. Recognize form of standard arguments. Recognize common.
Chapter 8 Logic DP Studies. Content A Propositions B Compound propositions C Truth tables and logical equivalence D Implication and equivalence E Converse,
MATERI II PROPOSISI. 2 Tautology and Contradiction Definition A tautology is a statement form that is always true. A statement whose form is a tautology.
CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.
Looking Ahead Monday: Starting Logic Tuesday: Continuing Logic Wednesday: 15 week Exam, Projects Returned Thursday: Activity Friday: Finish Logic.
BY: MISS FARAH ADIBAH ADNAN IMK. CHAPTER OUTLINE: PART III 1.3 ELEMENTARY LOGIC INTRODUCTION PROPOSITION COMPOUND STATEMENTS LOGICAL.
Chapter 3 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Chapter 7 Review Important Terms, Symbols, Concepts 7.1. Logic A proposition is a statement (not a question.
Chapter 3: Introduction to Logic. Logic Main goal: use logic to analyze arguments (claims) to see if they are valid or invalid. This is useful for math.
MAIN TOPIC : Statement, Open Sentences, and Truth Values Negation Compound Statement Equivalency, Tautology, Contradiction, and Contingency Converse, Inverse,
Thinking Mathematically
Venn Diagrams Truth Sets & Valid Arguments Truth Sets & Valid Arguments Truth Tables Implications Truth Tables Implications Truth Tables Converse, Inverse,
Logic The Lost Art of Argument. Logic - Review Proposition – A statement that is either true or false (but not both) Conjunction – And Disjunction – Or.
Thinking Mathematically Logic 3.4 Truth Tables for the Conditional and Biconditional.
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.
Simple Logic.
Chapter 1 Propositional Logic
Introduction to Logic © 2008 Pearson Addison-Wesley.
Presented by: Tutorial Services The Math Center
2. The Logic of Compound Statements Summary
AND.
CSNB 143 Discrete Mathematical Structures
Discrete Mathematics Logic.
Lecture 03 Logic and Propositional Calculus Profs. Koike and Yukita
How do I show that two compound propositions are logically equivalent?
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Logic – Bell Ringer.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
2 Chapter Introduction to Logic and Sets
Information Technology Department
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
3.5 Symbolic Arguments.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Section 3.4 Equivalent Statements
(1.4) An Introduction to Logic
1 Chapter An Introduction to Problem Solving
Discrete Mathematics and Its Applications Kenneth H
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Discrete Mathematics Lecture 2: Propositional Logic
Discrete Mathematics Logic.
1 Chapter An Introduction to Problem Solving
Equivalent Statements
Symbolic Logic 2/25/2019 rd.
Equivalent Statements
Statements of Symbolic Logic
Section 3.3 Truth Tables for the Conditional and Biconditional
Truth Tables for the Conditional and Biconditional
CHAPTER 3 Logic.
Section 3.4 Equivalent Statements
8C Truth Tables, 8D, 8E Implications 8F Valid Arguments
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
8A, 8B Propositions Unit 7: Logic and Sets 8A, 8B 6/1/ :59 AM.
3.5 Symbolic Arguments.
Presentation transcript:

Chapter 8 Logic Topics 3.1-3.4

Propositions Must be objective (fact-based) Cannot be a question May be indeterminate (the statement does not have the same answer for all people)

Pg. 233 example 1

Proposition notation Represented by letters such as p, q, & r. The negation of a proposition is “not p”, and is written as ¬p. The truth value of ¬p is the opposite of the truth value of p.

Pg. 234 Example 2

Negation & Venn Diagrams U: Universal set P : Truth set P’: ¬p

Pg. 235 Example 3

Compound Propositions Connective Symbol conjunction and True only when both propositions are true disjunction or True when one or both propositions are true exclusive disjunction or, but not both True when only one proposition is true

Truth tables

Pg. 241 example 5

Tautology, Logical Contradiction & Logical Equivalence

Pg. 241-244 examples 6-9 6.

7.

8.

9.

Implication & Equivalence Implication: When 2 propositions can be linked with “If... then….” p is the antecedent; q is the consequent Equivalence: When 2 propositions can be linked with “…if and only if…” Statement Symbol If p then q Statement Symbol p if and only if q

Implication & Equivalence Truth Tables Pg. 247 #5

Pg. 247 #6

Converse, Inverse & Contrapositive

PG. 248 #1

PG. 248 #2

VALID ARGUMENTS A tautology indicates a valid argument.