The Lost Art of Argument

Slides:



Advertisements
Similar presentations
PROOF BY CONTRADICTION
Advertisements

Uses for Truth Tables Determine the truth conditions for any compound statementDetermine the truth conditions for any compound statement Determine whether.
Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.
1 Inference Rules and Proofs Z: Inference Rules and Proofs.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Adapted from Discrete Math
3.2 – Truth Tables and Equivalent Statements
Propositions and Truth Tables
BY: MISS FARAH ADIBAH ADNAN IMK. CHAPTER OUTLINE: PART III 1.3 ELEMENTARY LOGIC INTRODUCTION PROPOSITION COMPOUND STATEMENTS LOGICAL.
Logic Disjunction A disjunction is a compound statement formed by combining two simple sentences using the word “OR”. A disjunction is true when at.
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Chapter 7 Review Important Terms, Symbols, Concepts 7.1. Logic A proposition is a statement (not a question.
The Foundations Logic and Proofs by raedRASHEED 2014.
Thinking Mathematically
Chapter 9 Logic. Problem Three dogs called Lassie, Timmy and Fido have either black, brown or tri-colour hair. The dogs have lived with their owners.
Logic Eric Hoffman Advanced Geometry PLHS Sept
Logic The Lost Art of Argument. Logic - Review Proposition – A statement that is either true or false (but not both) Conjunction – And Disjunction – Or.
 2012 Pearson Education, Inc. Slide Chapter 3 Introduction to Logic.
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.
 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.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
Chapter 1 Propositional Logic
Introduction to Logic © 2008 Pearson Addison-Wesley.
Truth Tables for Negation, Conjunction, and Disjunction
Presented by: Tutorial Services The Math Center
AND.
DISCRETE MATHEMATICS CHAPTER I.
Thinking Mathematically
Truth Tables and Equivalent Statements
CHAPTER 3 Logic.
Truth Tables for Negation, Conjunction, and Disjunction
Chapter 3: Introduction to Logic
Logic.
Classwork/Homework Classwork – Page 90 (11 – 49 odd)
How do I show that two compound propositions are logically equivalent?
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Logic – Bell Ringer.
Chapter 8 Logic Topics
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
1.2 Propositional Equivalences
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
TRUTH TABLES.
TRUTH TABLES continued.
(1.4) An Introduction to Logic
Discrete Mathematics and Its Applications Kenneth H
Conditional Logic Presentation Name Course Name
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Discrete Mathematics Lecture 2: Propositional Logic
PROPOSITIONAL LOGIC - SYNTAX-
Symbolic Logic 2/25/2019 rd.
1.2 Propositional Equivalences
MAT 3100 Introduction to Proof
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Discrete Mathematics Lecture 2: Propositional Logic
Statements of Symbolic Logic
Section 3.7 Switching Circuits
TRUTH TABLES.
And represent them using Venn Diagrams.
1.2 Propositional Equivalences
Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction
8A, 8B Propositions Unit 7: Logic and Sets 8A, 8B 6/1/ :59 AM.
2-2 Logic Vocab Statement: A sentence that is either true or false
CHAPTER 3 Logic.
Logical truths, contradictions and disjunctive normal form
Truth tables.
Propositional Satisfiability
Presentation transcript:

The Lost Art of Argument Logic The Lost Art of Argument

Propositions Definition: Proposition – A statement that is either true or false (but not both). Examples: This shirt is red √2 is irrational 1 + 1 = 5 There are more stars than grains of sand

Propositions Definition: Proposition – A statement that is either true or false (but not both). Not Propositions: x + 2 = 17 When is Thanksgiving? Why are these not propositions?

Propositions Definition: Conjunction – P Λ Q (“P and Q”) Example: P = Three quarters equal one dollar Q = 8 is an even number P Λ Q = Three quarters equal one dollar and 8 is an even number

Propositions Definition: Disjunction – P ν Q (“P or Q”) Example: P = Three quarters equal one dollar Q = 8 is an even number P Λ Q = Three quarters equal one dollar or 8 is an even number

Propositions Definition: Negation - ~P (Not P) Examples: P = Three quarters equal one dollar Q = 8 is an even number ~P = It is not the case that three quarters equal one dollar or: Three quarters do not equal one dollar ~Q = It is not the case that 8 is an even number or: 8 is not an even number

Truth Tables P Q (P Λ Q) True False Truth tables are a way to visually organize whether a statement is true or false. This is the truth table for: P Λ Q P Q (P Λ Q) True False

Truth Tables P Q (P ν Q) True False Truth tables are a way to visually organize whether a statement is true or false. This is the truth table for: P ν Q P Q (P ν Q) True False

Truth Tables Definition: Equivalent – Two propositions are equivalent when their truth values are the same. Here are two truth tables. Are the two propositions, ~(P Λ Q) and (~P v ~Q) equivalent? P Q (P Λ Q) ~(P Λ Q) T F P Q ~P ~Q (~P v ~Q) T F

Logic Worksheet 1. Place a check next to all statements that are propositions. a. ____ The National debt of Poland is more than $30 Billion. b. ____ Where is my book? c. ____ x + 3 = 0 d. ____ Albert Einstein never wore red boots. e. ____ Horses have gills. f. ____ x^2 ≥ 0

Logic Worksheet 2a. Construct a proposition that is false. 2b. Write the negation of the proposition. 2c. Is the negation of the false proposition true or false? 2d, Will the negation of a false proposition always be true?

Logic Worksheet 3. Construct truth tables for ~(P V Q) and ~P ^ ~Q Are the propositions ~(P V Q) and ~(P V Q) equivalent? Why? P Q (P V Q) ~(P V Q) T F P Q ~P ~Q ~P ^ ~Q T F

Logic - Review Proposition – A statement that is either true or false (but not both) Conjunction – And Disjunction – Or Negation – Not Truth Tables can be used to determine Equivalence Equivalence – Two propositions have the same truth values