Propositional Logic 7) Not Copyright 2008, Scott Gray.

Slides:



Advertisements
Similar presentations
Copyright 2008, Scott Gray1 Propositional Logic 9) Or.
Advertisements

PROOF BY CONTRADICTION
Chapter 13 Control Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display Control Structures Conditional.
Copyright © Cengage Learning. All rights reserved. 6 Equations and Formulas.
MA/CSSE 473/474 How (not) to do an induction proof.
2-1 Making Decisions Sample assignment statements PayAmount = Hours * Rate PayAmount = 40*Rate + (Hours – 40)*Rate*1.5.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.
For Wed, read Chapter 3, section 3. Nongraded Homework: Exercises the end of the section. Even better, do Power of Logic, 7.3, A and B. Graded homework.
IB Math Studies – Topic 3. IB Course Guide Description.
Propositions and Truth Tables
2009/9 1 Logic and Proofs §1.1 Introduction §1.2 Propositional Equivalences §1.3 Predicates and Quantifiers §1.4 Nested Quantifiers §1.5~7 Methods of Proofs.
CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.
Copyright © Curt Hill Truth Tables A way to show Boolean Operations.
1 Inference Rules and Proofs (Z); Program Specification and Verification Inference Rules and Proofs (Z); Program Specification and Verification.
Math 240: Transition to Advanced Math Deductive reasoning: logic is used to draw conclusions based on statements accepted as true. Thus conclusions are.
Copyright 2013, 2009, 2005, 2002 Pearson, Education, Inc.
1 CMSC 250 Discrete Structures CMSC 250 Lecture 1.
Thinking Mathematically
Chapter 2 Inequalities. Lesson 2-1 Graphing and Writing Inequalities INEQUALITY – a statement that two quantities are not equal. SOLUTION OF AN INEQUALITY.
Inverse, Contrapositive & indirect proofs Sections 6.2/6.3.
Solve 7n – 2 = 5n + 6. Example 1: Solving Equations with Variables on Both Sides To collect the variable terms on one side, subtract 5n from both sides.
Thinking Mathematically Logic 3.4 Truth Tables for the Conditional and Biconditional.
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
CS-7081 Application - 1. CS-7082 Example - 2 CS-7083 Simplifying a Statement – 3.
 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.
Principles of Programming - NI July Chapter 4: Basic C Operators In this chapter, you will learn about: Assignment operators Arithmetic operators.
Chapter 1 – Part 3 ELEMENTARY LOGIC
2. The Logic of Compound Statements Summary
AND.
DISCRETE MATHEMATICS CHAPTER I.
Discrete Mathematics Lecture 1 Logic of Compound Statements
Truth Tables for Negation, Conjunction, and Disjunction
Sequence, Selection, Iteration The IF Statement
Chapter 3 The Logic of Quantified Statements
Review of Basic Algebra
Unit 2 Honors Review
6.1 Symbols and Translation
Chapter 8 Logic Topics
2 Chapter Introduction to Logic and Sets
2-1 Making Decisions Sample assignment statements
CS201: Data Structures and Discrete Mathematics I
Logic Use mathematical deduction to derive new knowledge.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Propositional Equivalences
TRUTH TABLES.
Propositional Logic.
(1.4) An Introduction to Logic
The Method of Deduction
1 Chapter An Introduction to Problem Solving
Negations of quantifiers
Discrete Mathematics Lecture 2: Propositional Logic
1 Chapter An Introduction to Problem Solving
Statements joined by “And” (Conjunctions)
Symbolic Logic 2/25/2019 rd.
Relational Operators.
Foundations of Discrete Mathematics
CPSC 121: Models of Computation
Propositional Logic CMSC 471 Chapter , 7.7 and Chuck Dyer
CHAPTER 3 Logic.
Lesson Objective: I will be able to …
Arguments in Sentential Logic
CS201: Data Structures and Discrete Mathematics I
Chapter 2 Sets Active Learning Lecture Slides
Propositional Logic 1) Introduction Copyright 2008, Scott Gray.
Chapter 8 Natural Deduction
Propositional Logic 5) And Copyright 2008, Scott Gray.
Propositional Logic 8) Iff Copyright 2008, Scott Gray.
Conjunctive addition states that if we know that each of two statements is true, we can join them with the conjunction connective and the resulting conjunction.
Presentation transcript:

Propositional Logic 7) Not Copyright 2008, Scott Gray

Expressing “Not” The following are all equivalent: It is not true that Mario will play for the Penguins this year. It is false that Mario will play for the Penguins this year. Mario will not play for the Penguins this year. The Penguins will not have Mario play for them this year. Copyright 2008, Scott Gray

Use of Parentheses Use parentheses when the negation covers a non-simple statement ~(A & B) No parentheses are needed to negate a simple statement ~A & ~B Be sure to read the chapter for a more thorough discussion Copyright 2008, Scott Gray

Tilde In If from an assumption a standard contradiction can be derived, then derive the negation of the assumption Standard contradiction: a conjunction whose right conjunct is the negation of the left conjunct A & ~A (B → C) & ~(B → C) Not a standard contradiction: ~A & A Copyright 2008, Scott Gray

Modus Tollens A → B, ~B ∴ ~A 1 (1) A → B A 2 (2) ~B A 3 (3) A PA 1,3 (4) B 1,3 →O 1,2,3 (5) B & ~B 4,2 &I 1,2 (6) ~A 3-5 ~I Copyright 2008, Scott Gray

Tilde In Dependencies The statement derived by Tilda In depends on all of the assumptions the standard contradiction depends on, minus the assumption whose negation is derived In the Modus Tollens example this is line #3 Copyright 2008, Scott Gray

Tilde Out The “inverse” of Tilde In If from a negative assumption a standard contradiction can be derived, then derive the constituent of the negative assumption Copyright 2008, Scott Gray

Tilde Out Example ~~R ∴ R 1 (1) ~~R A 2 (2) ~R PA 1,2 (3) ~R & ~~R 2,1 &I 1 (4) R 2-3 ~O Copyright 2008, Scott Gray

Assignments Read Chapter 5 Do all of the exercises Be sure to ask me questions if you don’t understand something or can’t solve a problem Copyright 2008, Scott Gray