Logic ChAPTER 3.

Slides:

Advertisements

Similar presentations

3.4 More on the Conditional

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.

Propositional Equivalences

Combining what we have already talked about! Conditional Statements: If_______________ then _____________________.HypothesisConclusion Change the following.

Types of Conditionals Geometry. The converse of a conditional statement is formed by switching the hypothesis and conclusion. p: x is prime. q: x is odd.

John Rosson Thursday February 15, 2007 Survey of Mathematical Ideas Math 100 Chapter 3, Logic.

Notes on Logic Continued

Chapter 1 The Logic of Compound Statements. Section 1.2 – 1.3 (Modus Tollens) Conditional and Valid & Invalid Arguments.

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.

Logic: Connectives AND OR NOT P Q (P ^ Q) T F P Q (P v Q) T F P ~P T F

1 Section 1.2 Propositional Equivalences. 2 Equivalent Propositions Have the same truth table Can be used interchangeably For example, exclusive or and.

Conditional Statements

Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.

TRUTH TABLES. Introduction Statements have truth values They are either true or false but not both Statements may be simple or compound Compound statements.

Logic ChAPTER 3.

Propositions and Truth Tables

Chapter 1 Section 1.4 More on Conditionals. There are three statements that are related to a conditional statement. They are called the converse, inverse.

Conditional Statements M Deductive Reasoning Proceeds from a hypothesis to a conclusion. If p then q. p  q hypothesis  conclusion.

Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.3, Slide Logic The Study of What’s True or False or Somewhere in Between.

Section 1.5 Implications. Implication Statements If Cara has a piano lesson, then it is Friday. If it is raining, then I need to remember my umbrella.

Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.3, Slide Logic The Study of What’s True or False or Somewhere in Between.

Section 1-4 Logic Katelyn Donovan MAT 202 Dr. Marinas January 19, 2006.

Discrete Maths 2. Propositional Logic Objective

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.

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 5 – Logic CSNB 143 Discrete Mathematical Structures.

Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.

COS 150 Discrete Structures Assoc. Prof. Svetla Boytcheva Fall semester 2014.

Chapter 3 section 3. Conditional pqpqpq TTT TFF FTT FFT The p is called the hypothesis and the q is called the conclusion.

CSNB143 – Discrete Structure LOGIC. Learning Outcomes Student should be able to know what is it means by statement. Students should be able to identify.

Chapter 2: The Logic of Compound Statements 2.2 Conditional Statements

Conditional Statements

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.

MADAM SITI AISYAH ZAKARIA. CHAPTER OUTLINE: PART III 1.3 ELEMENTARY LOGIC LOGICAL CONNECTIVES CONDITIONAL STATEMENT.

How do I show that two compound propositions are logically equivalent?

Propositional Logic ITCS 2175 (Rosen Section 1.1, 1.2)

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.

Venn Diagrams Truth Sets & Valid Arguments Truth Sets & Valid Arguments Truth Tables Implications Truth Tables Implications Truth Tables Converse, Inverse,

Section 1.1. Section Summary Propositions Connectives Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional Truth.

CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.

Notes - Truth Tables fun, fun, and more fun!!!!. A compound statement is created by combining two or more statements, p and q.

Joan Ridgway. If a proposition is not indeterminate then it is either true (T) or false (F). True and False are complementary events. For two propositions,

 2012 Pearson Education, Inc. Slide Chapter 3 Introduction to Logic.

Section 1.1. Propositions A proposition is a declarative sentence that is either true or false. Examples of propositions: a) The Moon is made of green.

Conditional Statements Lecture 2 Section 1.2 Fri, Jan 20, 2006.

Mathematics for Computing Lecture 2: Computer Logic and Truth Tables Dr Andrew Purkiss-Trew Cancer Research UK

Thinking Mathematically Logic 3.4 Truth Tables for the Conditional and Biconditional.

3.3 – The Conditional A conditional statement is a compound statement that uses the connective if…then. The conditional is written with an arrow, so “if.

Conditional statement or implication IF p then q is denoted p ⇒ q p is the antecedent or hypothesis q is the consequent or conclusion ⇒ means IF…THEN.

Section 1.3 Implications. Vocabulary Words conditional operation ( ⇒ or →) conditional proposition conditional statement (implication statement) hypothesis.

Chapter 1. Chapter Summary  Propositional Logic  The Language of Propositions (1.1)  Logical Equivalences (1.3)  Predicate Logic  The Language of.

Aim 1.4: To work with conditionals and biconditionals Do Now: Determine the truth value of the following sentences: 1.9 is a prime number and New York.

2. The Logic of Compound Statements Summary

CSNB 143 Discrete Mathematical Structures

Conditional Statements

Chapter 8 Logic Topics

Conditional Statements

Information Technology Department

Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.

Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.

Symbolic Logic 2/25/2019 rd.

Equivalent Statements

Truth Tables for the Conditional and Biconditional

CHAPTER 3 Logic.

Logic and Reasoning.

Conditional Statements Section 2.3 GEOMETRY

Different Forms of Conditional Statements

Presentation transcript:

Logic ChAPTER 3

Variations of the Conditional and Implications 3.4

Variations of the conditional Variations of p → q Converse: Inverse: Contrapositive: p → q is logically equivalent to ~ q → ~ p q → p is logically equivalent to ~ p → ~ q

Examples of variations p: n is not an even number. q: n is not divisible by 2. Conditional: p → q If n is not an even number, then n is not divisible by 2. Converse: q → p If n is not divisible by 2, then n is not an even number. Inverse: ~ p → ~ q If n is an even number, then n is divisible by 2. Contrapositive: ~q → ~p If n is divisible by 2, then n is an even number.

p q T F p → q T F q → p T F ~p → ~ q T F ~q → ~p T F Equivalent Conditional Converse Inverse Contrapositive p q T F p → q T F q → p T F ~p → ~ q T F ~q → ~p T F

Conditional Equivalents Statement Equivalent forms if p, then q p → q p is sufficient for q q is necessary for p p only if q q if p

Biconditional Equivalents Statement Equivalent forms p if and only if q p ↔ q p is necessary and sufficient for q q is necessary and sufficient for p q if and only if p

Examples of variations Given: h: honk u: you love Ultimate Write the following in symbolic form. Honk if you love Ultimate. If you love Ultimate, honk. Honk only if you love Ultimate. A necessary condition for loving Ultimate is to honk. A sufficient condition for loving Ultimate is to honk To love Ultimate, it is sufficient and necessary that you honk. or

Tautologies and Contradictions A statement that is always true is called a tautology. A statement that is always false is called a contradiction.

Example Show by means of a truth table that the statement p ↔ ~ p is a contradiction. p ~p p ↔ ~ p T F

Implications The statement p is said to imply the statement q, p  q, if and only if the conditional p → q is a tautology.

Example Show that p q p → q (p → q) Λ p [(p → q) Λ p] → q T F END