If v.s. Only If v.s. If and Only If (Iff)

Slides:



Advertisements
Similar presentations
Exercises for CS1512 Weeks 7 and 8 Propositional Logic 1 (questions + solutions)
Advertisements

Discrete Mathematics Lecture 1 Logic of Compound Statements
Truth Tables How to Make and Use. Making a Truth Table To determine the number of rows other than the heading row. To determine the number of rows other.
 Union  Intersection  Relative Complement  Absolute Complement Likened to Logical Or and Logical And Likened to logical Negation.
1/03/09 De 89 à 98. 1/03/09 De 89 à 98 1/03/09 De 89 à 98.
CS128 – Discrete Mathematics for Computer Science
The Foundation: Logic Conditional Statements Muhammad Arief download dari
Discussion #12 1/22 Discussion #12 Deduction, Proofs and Proof Techniques.
MAT 142 Lecture Video Series. Truth Tables Objectives Construct a truth table for a given symbolic expression. Determine if two given statements are.
Chapter 9: Boolean Algebra
Proof by Deduction. Deductions and Formal Proofs A deduction is a sequence of logic statements, each of which is known or assumed to be true A formal.
Conditional Statements
Chapter 2: The Logic of Compound Statements 2.1 Logical Forms and Equivalence 12.1 Logical Forms and Equivalences Logic is a science of the necessary laws.
Truth Tables (MAT 142) Truth Tables.
CSCI2110 – Discrete Mathematics Tutorial 8 Propositional Logic Wong Chung Hoi (Hollis)
Conditional Statements M Deductive Reasoning Proceeds from a hypothesis to a conclusion. If p then q. p  q hypothesis  conclusion.
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Discrete Mathematics Lecture1 Miss.Amal Alshardy.
Thinking Mathematically Logic 3.6 Negations of Conditional Statements and De Morgan’s Laws.
CSS 342 Data Structures, Algorithms, and Discrete Mathematics I
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.
September1999 CMSC 203 / 0201 Fall 2002 Week #1 – 28/30 August 2002 Prof. Marie desJardins.
Thinking Mathematically Equivalent Statements, Conditional Statements, and De Morgan’s Laws.
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.
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.
Ch. 2 Basic Structures Section 1 Sets. Principles of Inclusion and Exclusion | A  B | = | A | + | B | – | A  B| | A  B  C | = | A | + | B | + | C.
Discrete Mathematics Lecture # 7. Bi conditional  If p and q are statement variables, the bi conditional of p and q is  “ p if, and only if, q ” and.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
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.
。 33 投资环境 3 开阔视野 提升竞争力 。 3 嘉峪关市概况 。 3 。 3 嘉峪关是一座新兴的工业旅游城市,因关得名,因企设市,是长城文化与丝路文化交 汇点,是全国唯一一座以长城关隘命名的城市。嘉峪关关城位于祁连山、黑山之间。 1965 年建市,下辖雄关区、镜铁区、长城区, 全市总面积 2935.
Module Code MA0003NI: Computing mathematics Lecture for Week Autumn.
Simple Logic.
LAW 421 Final Exam To purchase this material link 421/LAW-421-Complete-Class/LAW-421- Final-Exam For more courses visit.
Logic Hubert Chan [O1 Abstract Concepts] [O2 Proof Techniques]
Introduction to Logic © 2008 Pearson Addison-Wesley.
Discrete Mathematical
2. The Logic of Compound Statements Summary
Propositional Logic.
The Foundations: Logic and Proofs
Lesson Objectives Aims Be able to define problems using Boolean logic
Thinking Mathematically
Truth Tables and Equivalent Statements
Lecture 03 Logic and Propositional Calculus Profs. Koike and Yukita
MATH 245 Spring 2009 This is mathematics for computer science
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett
COT 3100, Spr Applications of Discrete Structures
(CSC 102) Discrete Structures Lecture 2.
CPCS222 Discrete Structures I
CSS 342 Data Structures, Algorithms, and Discrete Mathematics I
Logic Hubert Chan [O1 Abstract Concepts] [O2 Proof Techniques]
Discrete Mathematics Lecture # 2.
Negations of Quantified Statements
Translating Iff ‘Iff’ abbreviates ‘if and only if’ A iff B
Propositional Equivalences
Information Technology Department
Propositional Equivalence (§1.2)
CS 220: Discrete Structures and their Applications
CSE 311 Foundations of Computing I
CSE 311 Foundations of Computing I
Simplifying Fractions
De Morgan’s laws presentation
CSS 342 Data Structures, Algorithms, and Discrete Mathematics I
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Discrete Mathematics Lecture # 3.
Equivalent Statements
CHAPTER 3 Logic.
Different Forms of Conditional Statements
Presentation transcript:

If v.s. Only If v.s. If and Only If (Iff) If I get 90+ in the final, then I get an A for this course. -- 90+ in the final is sufficient for an A, but may not be necessary. I get an A for this course only if I get 90+ in the final. -- 90+ in the final is necessary for an A, but may not be sufficient. I get an A for this course if and only if I get 90+ in the final. -- 90+ in the final is “equivalent” to an A. (necessary and sufficient)

Or v.s. Exclusive Or Or: p  q Exclusive Or: p⊕q ≡ (p  q)  ~(p  q) I need to get 90+ in the final, or I won’t get an A. -- “get 90+ in the final” or “not get an A” Or Exclusive Or

Negation Write the negation of −3≤𝑥<1. −3≥𝑥>1 ? −3>𝑥≥1 ? It should be 𝑥<−3  𝑥≥1 !! −3≤𝑥<1 is equivalent to “𝑥≥−3 and 𝑥<1”, so by De Morgan’s law, its negation should be “𝑥<−3 or 𝑥≥1”.