Conditionals and Biconditionals

Slides:



Advertisements
Similar presentations
Logic The study of correct reasoning.
Advertisements

Notes on Logic Continued
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.
Today’s Topics n Review Logical Implication & Truth Table Tests for Validity n Truth Value Analysis n Short Form Validity Tests n Consistency and validity.
SEVENTH EDITION and EXPANDED SEVENTH EDITION
Conditional Statements
The Language of Propositional Logic The Syntax and Semantics of PL.
Satisfiability & Logical Truth PHIL /16/2001.
Logic ChAPTER 3.
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Chapter 3 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Chapter 2: The Logic of Compound Statements 2.2 Conditional Statements
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.
Lecture Propositional Equivalences. Compound Propositions Compound propositions are made by combining existing propositions using logical operators.
PHIL012 Class Notes 1/15/2001. Outline Announcements, web page Review Homework Problems (1-7) Set Theory Review & Problem 8 (if time) Assignment for Wednesday.
Section 2-2: Conditional Statements. Conditional A statement that can be written in If-then form symbol: If p —>, then q.
© 2010 Pearson Prentice Hall. All rights reserved. 1 §3.4, Truth Tables for the Conditional and the Biconditional.
COMP 170 L2 Part 3 of Course Chapter 3 of Textbook.
Propositional Logic – The Basics (2) Truth-tables for Propositions.
Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.
ARTIFICIAL INTELLIGENCE Lecture 2 Propositional Calculus.
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.
PHIL 012 2/14/2001 Logical Equivalence & Translation.
CS-7081 Application - 1. CS-7082 Example - 2 CS-7083 Simplifying a Statement – 3.
Logical Operators (Connectives) We will examine the following logical operators: Negation (NOT,  ) Negation (NOT,  ) Conjunction (AND,  ) Conjunction.
Simple Logic.
Discrete Structures for Computer Science Presented By: Andrew F. Conn Slides adapted from: Adam J. Lee Lecture #1: Introduction, Propositional Logic August.
Chapter 1 – Part 3 ELEMENTARY LOGIC
Logic The study of correct reasoning.
2. The Logic of Compound Statements Summary
Conditional Statements
CSNB 143 Discrete Mathematical Structures
CHAPTER 3 Logic.
Niu Kun Discrete Mathematics Chapter 1 The Foundations: Logic and Proof, Sets, and Functions Niu Kun 离散数学.
Conditional Statements
Logic.
COT 3100, Spr Applications of Discrete Structures
(CSC 102) Discrete Structures Lecture 2.
3.4 Truth Tables for the Conditional and the Biconditional
Truth Tables – Logic (Continued)
The Boolean Connectives
Discrete Structures for Computer Science
The Foundations: Logic and Proofs
Truth Functions.
Information Technology Department
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Copyright © Cengage Learning. All rights reserved.
Conditional Statements
Week 6 14 – 17 September 2015.
Midterm Discussion.
Discrete Mathematics and Its Applications Kenneth H
Truth tables 3.2 and 3.3 Constructing Truth tables
CSE 321 Discrete Structures
Equivalent Statements
CHAPTER 3 Logic.
CHAPTER 3 Logic.
Section 3.3 Truth Tables for the Conditional and Biconditional
Truth Tables for the Conditional and Biconditional
Statements and Logical Connectives
CHAPTER 3 Logic.
Discrete Structures Prepositional Logic 2
Conditional Statements
Conditional Statements Section 2.3 GEOMETRY
Conditional Statements
Different Forms of Conditional Statements
Truth Tables for Conditional and Biconditional Statements
The conditional and the bi-conditional
Write the negation of each of the following propositions without using any form of the word “not”: Today is Thursday Today is Monday or Tuesday or Wednesday.
Presentation transcript:

Conditionals and Biconditionals PHIL012 03/26/2001

Outline Announcements 4.1 The Material Conditional → Exams will be handed back Wednesday Next exam April 11 4.1 The Material Conditional → 4.2 The Biconditional: ↔

4.1 The Material Conditional → In English, we often have occasion to express conditional statements such as, “If we’re out of rice, we’ll go to the store.” “If it rains, the game will be postponed.” “If it is Sunday, the stores are all closed.” FOL expresses conditionals in this way: P → Q

The Material Conditional → The Material Conditional (P→Q) consists of two terms, P and Q. The first term, P, is called the antecedent. The second term, Q, is called the consequent. The definition of → says that for P→Q to be true, the consequent must be true whenever the antecedent is true.

Truth Table for → The definition of → in FOL is: P Q P →Q TRUE TRUE TRUE TRUE FALSE FALSE FALSE TRUE TRUE FALSE FALSE TRUE

P→Q and ¬P v Q Note that the truth tables for P→Q and ¬P v Q are identical P Q P → Q ¬ P v Q T T T T T F T T T T F T F F F T F F F T F T T T F T T F F F T F T F T F Thus, the expressions are logically equivalent.

Translation Issues Note, however, that the P→Q is not quite the same as the English expression “If P then Q.” Similar to English, P→Q is true whenever P is true and Q is also true and is false whenever P is true and Q is false. So, “If it is Sunday, the stores are all closed.” will be false just in case it is Sunday and some stores are open.

Translation Issues However, unlike English, the definition of → says that the expression P→Q is also true whenever the antecedent is false: P Q P →Q TRUE TRUE TRUE TRUE FALSE FALSE FALSE TRUE TRUE FALSE FALSE TRUE So, the statements “If we’re out of rice, we’ll go to the store.” “If it rains, the game will be postponed.” “If it is Sunday, the stores are all closed.” are all true in FOL when we have plenty of rice, it isn’t raining, and it isn’t Sunday.

Translation Issues So, “If P then Q” is similar but not identical to P→Q. Other similar English expressions are, P only if Q Q provided P Q when P

Translation Practice If today is Monday, we will have class. TRUE If today is Tuesday, we will have class. TRUE If Russell wins best actor, Gladiator wins best picture. TRUE If Julia doesn’t win best actress, Erin Brockovich wins best picture. TRUE If Philadelphia is the capital of PA, Al Gore is President. TRUE

The biconditional ↔ The ordinary English definition of P↔Q is P if and only if Q (P IFF Q). In other words, P↔Q is true whenever P and Q have the same truth values: P Q P↔Q TRUE TRUE TRUE TRUE FALSE FALSE FALSE TRUE FALSE FALSE FALSE TRUE

↔ and  Since P ↔ Q is true just in case P and Q are logically equivalent, it might be tempting to confuse ↔ and . However, ↔ is a logical connective in FOL (like ^, v, ¬, and →) Whereas  is a shorthand symbol for talking about two statements in FOL.

The biconditional ↔ It is also worth noting that P↔Q is logically equivalent to (P→Q) ^ (Q→P) In other words, P↔Q  (P→Q) ^ (Q→P) This becomes important in 4.3.

Questions

Assignment For Monday, do Ch 4: probs 1-22 (except 17 and 21). For Wednesday, read 4.3.