Statement Forms and Material Equivalence Kareem Khalifa Department of Philosophy Middlebury College.

Slides:



Advertisements
Similar presentations
Logic The study of correct reasoning.
Advertisements

Logic ChAPTER 3.
TRUTH TABLES Section 1.3.
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.
Constructing a Truth Table
Logic & Critical Reasoning
Exercises with the Material Conditional
Propositional Equivalences. L32 Agenda Tautologies Logical Equivalences.
John Rosson Thursday February 15, 2007 Survey of Mathematical Ideas Math 100 Chapter 3, Logic.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.
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.
1 Section 1.2 Propositional Equivalences. 2 Equivalent Propositions Have the same truth table Can be used interchangeably For example, exclusive or and.
1 Math 306 Foundations of Mathematics I Math 306 Foundations of Mathematics I Goals of this class Introduction to important mathematical concepts Development.
Through the Looking Glass, 1865
Conditional Statements & Material Implication Kareem Khalifa Department of Philosophy Middlebury College.
Propositional Logic Lecture 2: Sep 9. Conditional Statement If p then q p is called the hypothesis; q is called the conclusion “If your GPA is 4.0, then.
Propositional Logic 7/16/ Propositional Logic A proposition is a statement that is either true or false. We give propositions names such as p, q,
Truth Tables for Negation, Conjunction, and Disjunction.
3.2 – Truth Tables and Equivalent Statements
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.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.
Propositional Logic.
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.
Section 1-4 Logic Katelyn Donovan MAT 202 Dr. Marinas January 19, 2006.
Chapter 1 The Logic of Compound Statements. Section 1.1 Logical Form and Logical Equivalence.
BY: MISS FARAH ADIBAH ADNAN IMK. CHAPTER OUTLINE: PART III 1.3 ELEMENTARY LOGIC INTRODUCTION PROPOSITION COMPOUND STATEMENTS LOGICAL.
Reason and Argument Chapter 6 (2/3). A symbol for the exclusive ‘or’ We will use ұ for the exclusive ‘or’ Strictly speaking, this connective is not necessary.
1 Propositional Logic 2. Double Negation 2 not-(not-A)=Anot-(not-A)=A A= Ibrahim makes good coffee not-A= Ibrahim does not make good coffee not-(not-A)=Ibrahim.
Chapter 5 – Logic CSNB 143 Discrete Mathematical Structures.
Logical Form and Logical Equivalence Lecture 2 Section 1.1 Fri, Jan 19, 2007.
Discrete Mathematics Lecture1 Miss.Amal Alshardy.
Truth Tables and Validity Kareem Khalifa Department of Philosophy Middlebury College pqrSp v qr & s~(p v q)~p~q~p & ~q~(p v q) -> (r & s) (~p & ~q) ->
The Foundations Logic and Proofs by raedRASHEED 2014.
CSNB143 – Discrete Structure LOGIC. Learning Outcomes Student should be able to know what is it means by statement. Students should be able to identify.
3.3: Truth Tables. Types of Statements Negation: ~p Conjunction: p ˄ q (p and q) Disjunction: p V q (p or q, or both) Conditional: p → q (if p, then q)
Boolean Algebra. Logical Statements A proposition that may or may not be true:  Today is Monday  Today is Sunday  It is raining.
Chapter 7 Logic, Sets, and Counting
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.
MAIN TOPIC : Statement, Open Sentences, and Truth Values Negation Compound Statement Equivalency, Tautology, Contradiction, and Contingency Converse, Inverse,
Chapter 8 – Symbolic Logic Professor D’Ascoli. Symbolic Logic Because the appraisal of arguments is made difficult by the peculiarities of natural language,
Propositional Logic. Propositions Any statement that is either True (T) or False (F) is a proposition Propositional variables: a variable that can assume.
How do I show that two compound propositions are logically equivalent?
Truth Tables Geometry Unit 11, Lesson 6 Mrs. King.
Chapter 7 Logic, Sets, and Counting Section 1 Logic.
Propositional Logic ITCS 2175 (Rosen Section 1.1, 1.2)
Logical Form and Logical Equivalence Lecture 1 Section 1.1 Wed, Jan 12, 2005.
CS203 Discrete Mathematical Structures
The Foundations: Logic and Proof, Sets, and Foundations PROPOSITIONS A proposition is a declarative sentence that is either True or False, but not the.
Section 1.1. Section Summary Propositions Connectives Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional Truth.
Formal Test for Validity. EVALUATIONS Evaluations An evaluation is an assignment of truth-values to sentence letters. For example: A = T B = T C = F.
CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.
Boolean Logic.
TRUTH TABLES. Introduction The truth value of a statement is the classification as true or false which denoted by T or F. A truth table is a listing of.
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,
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
TRUTH TABLES Edited from the original by: Mimi Opkins CECS 100 Fall 2011 Thanks for the ppt.
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.
Assign Yourself and Do Now Thursday, January 10, 2013.
Propositional and predicate logic
Chapter 1. Chapter Summary  Propositional Logic  The Language of Propositions (1.1)  Logical Equivalences (1.3)  Predicate Logic  The Language of.
Discrete Mathematical الرياضيات المتقطعة Dr. Ahmad Tayyar Al Israa University
Section 3.2: Truth Tables for Negation, Conjunction, and Disjunction
Discrete Structures for Computer Science Presented By: Andrew F. Conn Slides adapted from: Adam J. Lee Lecture #1: Introduction, Propositional Logic August.
Boolean logic Taken from notes by Dr. Neil Moore
Boolean logic Taken from notes by Dr. Neil Moore
Presentation transcript:

Statement Forms and Material Equivalence Kareem Khalifa Department of Philosophy Middlebury College

Overview Why this matters Material equivalence Tautologies, contradictions, and contingencies Sample exercises

Why this matters Identifying materially equivalent statements facilitates the understanding of otherwise- torturous prose. –Ex. Being neither honest nor worthy does not entail being either distrusted or disrespected. –Trusted and respected people can be both dishonest and unworthy. Good writing avoids tautologies and contradictions. –Say nothing false, but say something.

IMPORTANT!! Last class, we covered: 1.Testing for validity Today, we’ll be covering two new topics: 2.Material Equivalence 3.Tautologies, Contradictions, and Contingencies For EACH of these topics, you must look for DIFFERENT things on the truth-table. Make sure you understand these differences!

Today’s First Topic: Material Equivalence ( ,  ) General idea: “p  q” says that wherever p is true, q is true, and wherever p is false, q is false. In English, we represent “  ” as “if and only if” or “is necessary and sufficient for.” –Ex. A creature is a human if and only if it is a member of the species Homo sapiens. –Being human is necessary and sufficient for being a member of Homo Sapiens.

Truth table for  pq p  q TTT TFF FTF FFT

Relationship between  and  Recall: –“p only if q” = p  q –“p if q” = q  p So, since “p if and only if q” = p  q, then p  q = [(p  q) & (q  p)]. Similarly, –“p is sufficient for q” = p  q –“p is necessary for q” = q  p So, since “p is necessary and sufficient for q” = p  q, then p  q = [(p  q) & (q  p)].

Example (~q  p)  (p v q) pq~q ~q  p p v q (~q  p)  (p v q) TTF TFT FTF FFT TTTFTTTF T T T F T T T T

ATTENTION!! We have completed the first topic for today: material equivalence. We are moving on to today’s 2 nd topic: tautologies, contradictions, and contingencies. These two ideas require different uses of the truth-table.

Tautologies Tautologies are statements such that there is no way that they can be false. Where there’s a row, there’s a way. So, tautologies are statements such that there is no row on a truth table in which they are false.

Example: p  p “It ain’t over ‘til it’s over” If it’s over, then it’s over. p p  p TT FT

What’s wrong with tautologies? They are completely uninformative. –A statement’s “informativeness” is proportional to its probability of being false. Ex. Someone is in Twilight 302. Ex. Heidi Grasswick is in Twilight 302. –A tautology has no way of being false. –So the probability of a tautology being false is zero. –So tautologies are completely uninformative.

Contradictions Contradictions are statements such that there is no way that they can be true. Where there’s a row, there’s a way. So, contradictions are statements such that there is no row on a truth table in which they are true.

Example P~PP & ~P TFF FTF

Contingent statements Contingencies are statements such that there is some way that they can be true and some way that they can be false. Where there’s a row, there’s a way. So, contingencies are statements such that there is some row on a truth table in which they are true, and some row on a truth table in which they are false.

Example You will receive either an A or a B. ABA v B TTT TFT FTT FFF

Exercise B2 p  [(p  q)  q] pq TT TF FT FF p  q(p  q)  q p  [(p  q)  q] TFTTTFTT TTTFTTTF TTTTTTTT TAUTOLOGY

Exercise B6 (p  p)  (q & ~q) pq~q p  p q & ~q (p  p)  (q & ~q) TTF TFT FTF FFT TTTTTTTT FFFFFFFF FFFFFFFF CONTRADICTION

Exercise C3 [(p  q)  r]  [(q  p)  r] pqr p  qq  p(p  q)  r (q  p)  r [(p  q)  r]  [(q  p)  r] TTT TTF TFT TFF FTT FTF FFT FFF FFFF TTTT TTTTTTTT FFFF TTTT TTTTTTTT F F F T TTTTTT T F F F TTTTTT TTTT TTTFTTTF CONTINGENT TFTTTFTT