Philosophy 200 substitution rules. Substitution Sometimes, when you translate a statement from English to SL, you translate it in a form that is less.

Slides:



Advertisements
Similar presentations
Propositional Equivalences
Advertisements

Propositional Equivalences
CS1502 Formal Methods in Computer Science Lecture Notes 3 Consequence Rules Boolean Connectives.
08 March 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.
Symbolization techniques Identify component propositions.
Logic 3 Tautological Implications and Tautological Equivalences
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
An Introduction to Propositional Logic Translations: Ordinary Language to Propositional Form.
1 Section 1.2 Propositional Equivalences. 2 Equivalent Propositions Have the same truth table Can be used interchangeably For example, exclusive or and.
Proofs Using Logical Equivalences Rosen 1.2 List of Logical Equivalences p  T  p; p  F  pIdentity Laws p  T  T; p  F  FDomination Laws p  p.
Conditional Statements
CSCI2110 – Discrete Mathematics Tutorial 8 Propositional Logic Wong Chung Hoi (Hollis)
CSci 2011 Discrete Mathematics Lecture 3 CSci 2011.
CSCI 2110 Discrete Mathematics Tutorial 10 Chin 1.
Week 1 - Wednesday.  Course overview  Propositional logic  Truth tables  AND, OR, NOT  Logical equivalence.
1 Logic Logic is a discipline that studies the principles and methods used in correct reasoning It includes: A formal language for expressing statements.
CSci 2011 Discrete Mathematics Lecture 6
Transposition (p > q) : : ( ~ q > ~ p) Negate both statements when switching order of antecedent and consequent If the car starts, there’s gas in the tank.
1 CMSC 250 Discrete Structures CMSC 250 Lecture 1.
HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Section 3.3 Logical Equivalence.
Propositional Logic. Propositions Any statement that is either True (T) or False (F) is a proposition Propositional variables: a variable that can assume.
1 Introduction to Abstract Mathematics Expressions (Propositional formulas or forms) Instructor: Hayk Melikya
Section 1.2: Propositional Equivalences In the process of reasoning, we often replace a known statement with an equivalent statement that more closely.
Chapter 2 Logic 2.1 Statements 2.2 The Negation of a Statement 2.3 The Disjunction and Conjunction of Statements 2.4 The Implication 2.5 More on Implications.
Chapter 1: The Foundations: Logic and Proofs
REVIEW : Quantifiers A key to predicate logic we have been ignoring is the inclusion of quantifiers You should recall from discrete that you can also write.
UMBC CMSC 203, Section Fall CMSC 203, Section 0401 Discrete Structures Fall 2004 Matt Gaston
Week 1 - Wednesday.  Course overview  Propositional logic  Truth tables  AND, OR, NOT  Logical equivalence.
CSci 2011 Recap ^Propositional operation summary not andorconditionalBi-conditional pq ppqqpqpqpqpqpqpqpqpq TTFFTTTT TFFTFTFF FTTFFTTF FFTTFFTT.
CSci 2011 Discrete Mathematics Lecture 4 CSci 2011.
Symbolization techniques Identify component propositions.
Mathematics for Comter I Lecture 3: Logic (2) Propositional Equivalences Predicates and Quantifiers.
 To combine propositions using connectives  To construct the truth table of a given compound proposition  To define de Morgan Law for logic  To define.
Discrete Mathematics Lecture # 4. Conditional Statements or Implication  If p and q are statement variables, the conditional of q by p is “If p then.
1 Introduction to Abstract Mathematics Proof Methods , , ~, ,  Instructor: Hayk Melikya Purpose of Section:Most theorems in mathematics.
Today’s Topics Argument forms and rules (review)
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
 NEXT WEEK: Unit 2 Leisure  Suggested schedule for ONLINE Activities Activities 1 and 2 –Friday Activities 3, 4, 5 –Saturday Activity 6 and 7 –Sunday.
Law of logic Lecture 4.
CS-7081 Application - 1. CS-7082 Example - 2 CS-7083 Simplifying a Statement – 3.
2. The Logic of Compound Statements Summary
Module 2: Conditionals and Logical Equivalences
The Foundations: Logic and Proofs
Lecture 1 – Formal Logic.
COMP 1380 Discrete Structures I Thompson Rivers University
Logical Equivalence of Propositions
7/20/2018 EMR 17 Logical Reasoning Lecture 7.
(CSC 102) Discrete Structures Lecture 2.
Discussion #10 Logical Equivalences
CSE 2353 – September 4th 2002 Logic.
Discrete Mathematics Lecture # 2.
Discrete Structures for Computer Science
Propositional Equivalences
Information Technology Department
7.1 Rules of Implication I Natural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic.
CS 220: Discrete Structures and their Applications
CS201: Data Structures and Discrete Mathematics I
Propositional Equivalences
The Method of Deduction
Malini Sen WESTERN LOGIC Presented by Assistant Professor
Discrete Mathematics Lecture # 3.
CSE 321 Discrete Structures
Foundations of Discrete Mathematics
COMP 1380 Discrete Structures I Thompson Rivers University
Discrete Structures Prepositional Logic 2
Transposition (p > q) : : ( ~ q > ~ p) Negate both statements
A THREE-BALL GAME.
CS201: Data Structures and Discrete Mathematics I
The Foundations: Logic and Proofs
Substitution.
Presentation transcript:

Philosophy 200 substitution rules

Substitution Sometimes, when you translate a statement from English to SL, you translate it in a form that is less useful to a proof than some other, equivalent form.

Example “Biff and Gerald didn’t both pass the exam, and Gerald passed, so Biff must not have passed the exam.” B = Biff passed the exam G= Gerald passed the exam 1.~(B · G) 2.G C. ~B

Example 1.~(B · G)prem 2.Gprem/~B

Example 1.~(B · G)prem 2.Gprem/~B What to do? We have no rules to deal with negations, and that’s all we have to work with.

Example 1.~(B · G)prem 2.Gprem/~B This is where a different translation would have helped us. But you don’t really know ahead of time which translation will work in your proof. (unless you use a system with a good enough rule set to handle any given translation…)

Example 1.~(B · G)prem 2.Gprem/~B 3. So let’s replace line 1 with an equivalent statement form.

Example 1.~(B · G)prem 2.Gprem/~B 3.~B v ~G1, DeM So let’s replace line 1 with an equivalent statement form.

Example 1.~(B · G)prem 2.Gprem/~B 3.~B v ~G1, DeM This is an example of DeMogan’s law which proves that the statement forms on 1 and 3 are equivalent. (also that ~(P v Q) is equivalent with ~P · ~Q)

Example 1.~(B · G)prem 2.Gprem/~B 3.~B v ~G1, DeM And now we can straightforwardly conclude the proof.

Example 1.~(B · G)prem 2.Gprem/~B 3.~B v ~G1, DeM 4.~B2,3 DS QED

Important Tip Continue to think of the replacement rules as alternate ways that a statement could have been translated from English into SL.

De Morgan’s Laws Pip and Quincy don’t both speak Klingon. ~(P · Q) :: ~P v ~Q Neither Pip nor Quincy speaks Klingon. ~(P v Q) :: ~P · ~Q

Association The number in this box could be a five, a six, or an eight. F v (S v E) :: (F v S) v E I wear pants, hats, and shoes P · (H · S) :: (P · H) · S

Double Negation Bob doesn’t not smoke ~~B :: B

Material Implication If you pay me the protection money, then I’ll beat you up. P  B :: ~P v B

Exportation If the smurf has plumped up and if it has light grill marks, then it’s cooked perfectly. P  (G  C) :: (P · G)  C

Commutation Jack and Jill went up the hill. (M · F) :: (F · M)

Distribution You can get the burger and have mustard or mayo on it. (B · Y) v (B · D) :: B · (Y v D) You can make a deal or you can stand trial and go to jail. (A v B) · (A v C) :: A v (B · C)

Transposition If you don’t study, you won’t pass. ~S  ~P :: P  S

Biconditional Equivalence You are a mother if and only if you are a female parent. (M  F) :: (M  F) · (F  M) :: (M · F) v (~M · ~F)

Tautology There’s cheese and then there’s cheese C :: C · C Am I right or am I right? (rhetorically) R :: R v R