Welcome to Wk02 MATH225 Applications of Discrete Mathematics and Statistics http://media.dcnews.ro/image/201109/w670/statistics.jpg.

Slides:



Advertisements
Similar presentations
Copyright © Cengage Learning. All rights reserved. CHAPTER 2 THE LOGIC OF COMPOUND STATEMENTS THE LOGIC OF COMPOUND STATEMENTS.
Advertisements

The Foundation: Logic Conditional Statements Muhammad Arief download dari
2.2 Conditional Statements. Goals Identify statements which are conditional Identify the antecedent and consequent of a conditional statement Negate conditional.
1 Section 1.1 Logic. 2 Proposition Statement that is either true or false –can’t be both –in English, must contain a form of “to be” Examples: –Cate Sheller.
Copyright © Cengage Learning. All rights reserved.
Adapted from Discrete Math
Section 1-4 Logic Katelyn Donovan MAT 202 Dr. Marinas January 19, 2006.
Discrete Mathematics and Its Applications
Chapter 5 – Logic CSNB 143 Discrete Mathematical Structures.
(CSC 102) Lecture 3 Discrete Structures. Previous Lecture Summary Logical Equivalences. De Morgan’s laws. Tautologies and Contradictions. Laws of Logic.
2.2 Statements, Connectives, and Quantifiers
CSNB143 – Discrete Structure LOGIC. Learning Outcomes Student should be able to know what is it means by statement. Students should be able to identify.
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.
Thinking Mathematically
Chapter 1: The Foundations: Logic and Proofs
CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.
Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.
Copyright © Cengage Learning. All rights reserved. CHAPTER 2 THE LOGIC OF COMPOUND STATEMENTS THE LOGIC OF COMPOUND STATEMENTS.
Symbolic Logic The Following slide were written using materials from the Book: The Following slide were written using materials from the Book: Discrete.
LECTURE 1. Disrete mathematics and its application by rosen 7 th edition THE FOUNDATIONS: LOGIC AND PROOFS 1.1 PROPOSITIONAL LOGIC.
رياضيات متقطعة لعلوم الحاسب MATH 226. Text books: (Discrete Mathematics and its applications) Kenneth H. Rosen, seventh Edition, 2012, McGraw- Hill.
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 Propositional Logic
Presented by: Tutorial Services The Math Center
Logic.
2. The Logic of Compound Statements Summary
Conditional Statements
Propositional Logic.
AND.
DISCRETE MATHEMATICS CHAPTER I.
Discrete Mathematics Lecture 1 Logic of Compound Statements
CSNB 143 Discrete Mathematical Structures
Boolean Algebra & De Morgan's Theorems
Lecture 1 – Formal Logic.
Truth Tables for Negation, Conjunction, and Disjunction
Niu Kun Discrete Mathematics Chapter 1 The Foundations: Logic and Proof, Sets, and Functions Niu Kun 离散数学.
COMP 1380 Discrete Structures I Thompson Rivers University
Conditional Statements
(CSC 102) Discrete Structures Lecture 2.
CPCS222 Discrete Structures I
Ch.1 (Part 1): The Foundations: Logic and Proofs
Hardware building blocks in detail
Truth Tables – Logic (Continued)
Mathematics for Computing
CMSC Discrete Structures
The Foundations: Logic and Proofs
Information Technology Department
CHAPTER 1: LOGICS AND PROOF
CS201: Data Structures and Discrete Mathematics I
CSRU 1400 Discrete Structure: Logic
Copyright © Cengage Learning. All rights reserved.
Conditional Statements
CS 220: Discrete Structures and their Applications
Applied Discrete Mathematics Week 1: Logic
(1.4) An Introduction to Logic
Discrete Mathematics and Its Applications Kenneth H
Discrete Mathematics Lecture 2: Propositional Logic
Discrete Mathematics CMP-200 Propositional Equivalences, Predicates & Quantifiers, Negating Quantified Statements Abdul Hameed
Statements of Symbolic Logic
COMP 1380 Discrete Structures I Thompson Rivers University
Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction
1.3 Propositional Equivalences
Discrete Structures Prepositional Logic 2
Conditional Statements
CS201: Data Structures and Discrete Mathematics I
Conditional Statements
Presentation transcript:

Welcome to Wk02 MATH225 Applications of Discrete Mathematics and Statistics http://media.dcnews.ro/image/201109/w670/statistics.jpg

Now, for something profound…

TRUTH

Question on a true/false test: Truth Question on a true/false test: US presidents are named “Barack” T ___ F ___

Question on a true/false test: Truth Question on a true/false test: US presidents are named “George” T ___ F ___

Question on a true/false test: Truth Question on a true/false test: US presidents are male T ___ F ___

Question on a true/false test: Truth Question on a true/false test: US presidents are at least 35 years old T ___ F ___

So, it is easier to be “false” than to be “true” Truth So, it is easier to be “false” than to be “true”

Truth So, it is easier to be “false” than to be “true” To be “true” a statement must be true in all cases

Truth So, it is easier to be “false” than to be “true” To be “true” a statement must be true in all cases If not, it is “false”

Truth We know what truth is

We know what truth is but it is a little hard to define it

Logical Statements Most of the definitions of formal logic have been developed so that they agree with natural or intuitive logic

Logical Statements They are used by people who need to think and communicate clearly and unambiguously

Logical Statements They are used by people who need to think and communicate clearly and unambiguously No misunderstandings or misinterpretations!

Logical Statements In any mathematical theory, new terms are defined by using those that have been previously defined

Logical Statements But a few initial terms necessarily remain undefined

Logical Statements In logic, the words “true” and “false” are the initial undefined terms

Logical Statements Could you come up with a definition of “true”?

Logical Statements A statement (or proposition) is a sentence that is true or false but not both

Logical Statements A statement (or proposition) is a sentence that is true or false but not both (Sentence is another initial undefined term…)

Is it a statement/proposition? “Two plus two equals four” Logical Statements IN-CLASS PROBLEMS Is it a statement/proposition? “Two plus two equals four”

Logical Statements IN-CLASS PROBLEMS Is it a statement/proposition? “Two plus two equals four” Yes, because it is true

Is it a statement/proposition? “Two plus two equals five” Logical Statements IN-CLASS PROBLEMS Is it a statement/proposition? “Two plus two equals five”

Logical Statements IN-CLASS PROBLEMS Is it a statement/proposition? “Two plus two equals five” Yes, because it is false

Is it a statement/proposition? “He is a CTU student” Logical Statements IN-CLASS PROBLEMS Is it a statement/proposition? “He is a CTU student”

Logical Statements IN-CLASS PROBLEMS Is it a statement/proposition? “He is a CTU student” No, because it cannot be given a truth value

Logical Statements IN-CLASS PROBLEMS Is it a statement/proposition? “Alfred Hitchcock was a brilliant director”

Logical Statements IN-CLASS PROBLEMS Is it a statement/proposition? “Alfred Hitchcock was a brilliant director” No, because it cannot be given a truth value

Questions? www.career.gatech.edu

Logical Statements Universal statements/ propositions contain variations of the words “for all”

Logical Statements Universal statements/ propositions contain variations of the words “for all” Ex: All males have a Y chromosome

Logical Statements Existential statements/ propositions contain versions of the word “some”

Logical Statements Existential statements/ propositions contain versions of the words “there is” Ex: Some males carry pocketknives

Logical Statements Statements are usually labeled with a variable name like “p” “q” “r”

Logical Statements Statements are usually labeled with a variable name like “p” “q” “r” “mind your ps and qs!”

Compound Statements Statements using “and”, “or”, “not”, “if then” and “if and only if” are compound statements (otherwise they are simple statements)

Compound Statements Most important mathematical concepts can only be defined using phrases that are universal (“all”), existential (“there is”) and conditional (“if-then”)

Compound Statements Types of compound statements:  means “AND” called the conjuction

Compound Statements Types of compound statements:  means “AND” called the conjuction  for sets

Compound Statements a ≤ x ≤ b means a ≤ x and x ≤ b

Compound Statements Types of compound statements:  means “OR” called the disjunction

Compound Statements Types of compound statements:  means “OR” called the disjunction  for sets

Compound Statements x ≤ a means x < a or x = a

Compound Statements  a pyramid upon the sand (“and”)  points down to the ore (“or”) below

Compound Statements  and  both mean “and”  and  both mean “or”

Compound Statements To evaluate the “truth” of compound statements, we use truth tables

Compound Statements A truth table has one column for each input variable and one final column showing all of the possible results of the logical operation

Compound Statements Example: p: Ann is on the softball team q: Paul is on the softball team Are these statements?

Compound Statements IN-CLASS PROBLEMS Example: p: Ann is on the softball team q: Paul is on the softball team Find p  q

Compound Statements IN-CLASS PROBLEMS Example: p: Ann is on the softball team q: Paul is on the softball team Find p  q (p or q) p q p  q

Compound Statements IN-CLASS PROBLEMS Example: p: Ann is on the softball team q: Paul is on the softball team What values can p have? p q p  q

Compound Statements Example: p: Ann is on the softball team q: Paul is on the softball team What values can p have? p q p  q T F

Compound Statements Example: p: Ann is on the softball team q: Paul is on the softball team What values can q have? p q p  q

Compound Statements Example: p: Ann is on the softball team q: Paul is on the softball team What values can q have? p q p  q T F

Compound Statements IN-CLASS PROBLEMS Example: p: Ann is on the softball team q: Paul is on the softball team What combinations of values can you have for p and q? p q p  q

Compound Statements IN-CLASS PROBLEMS Example: p: Ann is on the softball team q: Paul is on the softball team What combinations of values can you have for p and q? p q p  q T

Compound Statements IN-CLASS PROBLEMS Example: p: Ann is on the softball team q: Paul is on the softball team What combinations of values can you have for p and q? p q p  q T F

Compound Statements IN-CLASS PROBLEMS Example: p: Ann is on the softball team q: Paul is on the softball team What combinations of values can you have for p and q? p q p  q T F

Compound Statements IN-CLASS PROBLEMS Example: p: Ann is on the softball team q: Paul is on the softball team What combinations of values can you have for p and q? p q p  q T F

Compound Statements IN-CLASS PROBLEMS Example: p: Ann is on the softball team q: Paul is on the softball team Is p  q (p or q) true for p true and q true? p q p  q T F

Compound Statements IN-CLASS PROBLEMS Example: p: Ann is on the softball team q: Paul is on the softball team Is p  q (p or q) true for p true and q true? p q p  q T F

Compound Statements IN-CLASS PROBLEMS Example: p: Ann is on the softball team q: Paul is on the softball team Is p  q (p or q) true for p true and q false? p q p  q T F

Compound Statements IN-CLASS PROBLEMS Example: p: Ann is on the softball team q: Paul is on the softball team Is p  q (p or q) true for p true and q false? p q p  q T F

Compound Statements IN-CLASS PROBLEMS Example: p: Ann is on the softball team q: Paul is on the softball team Is p  q (p or q) true for p false and q true? p q p  q T F

Compound Statements IN-CLASS PROBLEMS Example: p: Ann is on the softball team q: Paul is on the softball team Is p  q (p or q) true for p false and q true? p q p  q T F

Compound Statements IN-CLASS PROBLEMS Example: p: Ann is on the softball team q: Paul is on the softball team Is p  q (p or q) true for p false and q false? p q p  q T F

Compound Statements IN-CLASS PROBLEMS Example: p: Ann is on the softball team q: Paul is on the softball team Is p  q (p or q) true for p false and q false? p q p  q T F

Compound Statements Example: p: Ann is on the softball team q: Paul is on the softball team This truth table shows when p  q is true p q p  q T F

Compound Statements IN-CLASS PROBLEMS Example: p: Ann is on the softball team q: Paul is on the softball team Find p  q

Compound Statements IN-CLASS PROBLEMS Example: p: Ann is on the softball team q: Paul is on the softball team This truth table shows when p  q is true p q p  q T F

Compound Statements In a conjunction (), both statements must be true for the conjunction to be true In a disjunction (), both statements must be false for the disjunction to be false

Questions? www.career.gatech.edu

Compound Statements Types of compound statements: ~ or ¬ means “NOT” called the negation

Compound Statements Types of compound statements: ~ or ¬ means “NOT” called the negation Ac for sets

Compound Statements The negation of a statement is a statement that exactly expresses what it would mean for the statement to be false

Compound Statements A statement p has a negation ~p (“not p”)

Compound Statements ~p will have the opposite truth value than p

Compound Statements ~p will have the opposite truth value than p If p is true, then ~p is false

Compound Statements ~p will have the opposite truth value than p If p is true, then ~p is false If p is false, then ~p is true

Compound Statements Truth table for ~p p ~p T F

Questions? www.career.gatech.edu

Compound Statements The statements p, q, r are connected by ~, ,  These symbols are called “logical connectives”

Compound Statements We can build compound sentences out of component statements and the terms “not” “and” and “or”

Compound Statements We can build compound sentences out of component statements and the terms “not” “and” and “or” This is called a statement/ propositional form

Compound Statements Remember, if we want these sentences to be statements, they must be either true or false

Compound Statements We define compound sentences to be statements by specifying their truth values in terms of the statements that compose them

Compound Statements The truth table for a given statement form displays all possible combinations of truth values and component statement variables

Compound Statements Remember PEMDAS?

Compound Statements There is also an order or operations for compound statements

Compound Statements PEMDAS for compound statements: “~ before  or ”

Compound Statements PEMDAS for compound statements: “squiggle before arrows”

Compound Statements PEMDAS for compound statements: “~ before  or ” Example: ~ p  q = (~ p)  q

Compound Statements The order of operations can be overridden through the use of parentheses

Compound Statements The order of operations can be overridden through the use of parentheses ~ (p  q) is the negation of the conjunction of p and q

Compound Statements The symbols  and  are considered coequal in order of operation

Compound Statements p  q  r is ambiguous It must be written as either: (p  q)  r or p  (q  r) to have meaning

Compound Statements IN-CLASS PROBLEMS Suppose x is a particular real number p: 0<x q: x<3 r: x=3 Write x ≤ 3 in terms of p,q and r

Compound Statements IN-CLASS PROBLEMS Suppose x is a particular real number p: 0<x q: x<3 r: x=3 Write x ≤ 3 in terms of p,q and r q  r

Compound Statements IN-CLASS PROBLEMS Suppose x is a particular real number p: 0<x q: x<3 r: x=3 Write 0 < x < 3 in terms of p,q and r

Compound Statements IN-CLASS PROBLEMS Suppose x is a particular real number p: 0<x q: x<3 r: x=3 Write 0 < x < 3 in terms of p,q and r p  q

Compound Statements IN-CLASS PROBLEMS Suppose x is a particular real number p: 0<x q: x<3 r: x=3 Write 0 < x ≤ 3 in terms of p,q and r

Compound Statements IN-CLASS PROBLEMS Suppose x is a particular real number p: 0<x q: x<3 r: x=3 Write 0 < x ≤ 3 in terms of p,q and r p  (q  r)

Questions? www.career.gatech.edu

Logical Equivalence 6 is greater than 2 2 is less than 6 Are these two statements two different ways of saying the same thing?

Logical Equivalence 6 is greater than 2 2 is less than 6 Are these two statements two different ways of saying the same thing? Yep because of the definition of the words “greater than” and “less than”

Logical Equivalence Dogs bark and cats meow Cats meow and dogs bark Are these two statements two different ways of saying the same thing?

Logical Equivalence Dogs bark and cats meow Cats meow and dogs bark Are these two statements two different ways of saying the same thing? Yep, but not because of definitions of words

Logical Equivalence Dogs bark and cats meow Cats meow and dogs bark Are these two statements two different ways of saying the same thing? Yep, because of the logical form of the statements

Logical Equivalence Any two statements whose logical forms are related in the same way would either both be true or both be false

Logical Equivalence p q pq p and q qp q and p T F

Logical Equivalence Two statement forms are called logically equivalent if and only if they have identical truth values in their truth table

Logical Equivalence Two statement forms are called logically equivalent if and only if they have identical truth values in their truth table Written: p ≡ q

Logical Equivalence Test for logical equivalence: 1) What are the statements? 2) Construct a truth table 3) If the truth values are the same for each statement, then they are logically equivalent 4) If not, then not…

Logical Equivalence IN-CLASS PROBLEMS Double negative property: ~(~p) ≡ p Is ~(~p) logically equivalent to p?

Logical Equivalence IN-CLASS PROBLEMS Double negative property: ~(~p) ≡ p Is ~(~p) logically equivalent to p? p ~(~p)

Logical Equivalence IN-CLASS PROBLEMS Double negative property: ~(~p) ≡ p Is ~(~p) logically equivalent to p? p ~p ~(~p)

Logical Equivalence IN-CLASS PROBLEMS Double negative property: ~(~p) ≡ p Is ~(~p) logically equivalent to p? p ~p ~(~p) T F

Logical Equivalence IN-CLASS PROBLEMS Double negative property: ~(~p) ≡ p Is ~(~p) logically equivalent to p? p ~p ~(~p) T F

Logical Equivalence IN-CLASS PROBLEMS Double negative property: ~(~p) ≡ p Is ~(~p) logically equivalent to p? p ~p ~(~p) T F

Logical Equivalence IN-CLASS PROBLEMS Double negative property: ~(~p) ≡ p Is ~(~p) logically equivalent to p? p ~p ~(~p) T F p and ~(~p) always have the same truth values

Is ~(pq) logically equivalent to ~p  ~q? Logical Equivalence IN-CLASS PROBLEMS Is ~(pq) logically equivalent to ~p  ~q?

Is ~(pq) logically equivalent to ~p  ~q? Logical Equivalence IN-CLASS PROBLEMS Is ~(pq) logically equivalent to ~p  ~q? p q

Is ~(pq) logically equivalent to ~p  ~q? Logical Equivalence IN-CLASS PROBLEMS Is ~(pq) logically equivalent to ~p  ~q? p q T F

Is ~(pq) logically equivalent to ~p  ~q? Logical Equivalence IN-CLASS PROBLEMS Is ~(pq) logically equivalent to ~p  ~q? p q pq T F

Is ~(pq) logically equivalent to ~p  ~q? Logical Equivalence IN-CLASS PROBLEMS Is ~(pq) logically equivalent to ~p  ~q? p q pq T F

Is ~(pq) logically equivalent to ~p  ~q? Logical Equivalence IN-CLASS PROBLEMS Is ~(pq) logically equivalent to ~p  ~q? p q pq ~(pq) T F

Is ~(pq) logically equivalent to ~p  ~q? Logical Equivalence IN-CLASS PROBLEMS Is ~(pq) logically equivalent to ~p  ~q? p q pq ~(pq) T F

Is ~(pq) logically equivalent to ~p  ~q? Logical Equivalence IN-CLASS PROBLEMS Is ~(pq) logically equivalent to ~p  ~q? p q pq ~(pq) ~p ~q T F

Is ~(pq) logically equivalent to ~p  ~q? Logical Equivalence IN-CLASS PROBLEMS Is ~(pq) logically equivalent to ~p  ~q? p q pq ~(pq) ~p ~q T F

Is ~(pq) logically equivalent to ~p  ~q? Logical Equivalence IN-CLASS PROBLEMS Is ~(pq) logically equivalent to ~p  ~q? p q pq ~(pq) ~p ~q ~p~q T F

~(pq) and ~p~q don’t have Logical Equivalence IN-CLASS PROBLEMS Is ~(pq) logically equivalent to ~p  ~q? p q pq ~(pq) ~p ~q ~p~q T F ~(pq) and ~p~q don’t have the same truth values

Questions? www.career.gatech.edu

Conditional Statements Types of compound statements: Conditional statements/ propositions contain versions of the words “if-then”

Conditional Statements Types of compound statements: Conditional statements/ propositions contain versions of the words “if-then” Ex: If a human has a Y chromosome, it is genetically male

Conditional Statements Types of compound statements: Conditional statements/ propositions contain versions of the words “if-then” denoted symbolically by “p → q”

Conditional Statements In a conditional statement p → q p is called the hypothesis (or antecedent) and q is called the conclusion (or consequent)

Conditional Statements The truth of statement q depends on the truth of statement p

Conditional Statements Logically equivalent conditional statements have the same truth value in their truth tables

Conditional Statements IN-CLASS PROBLEMS Is this a statement? If Lisa is in France, then she is in Europe

Conditional Statements IN-CLASS PROBLEMS Is this statement conditional? If Lisa is in France, then she is in Europe

Conditional Statements IN-CLASS PROBLEMS If Lisa is in France, then she is in Europe Think of it as: p: Lisa is in France q: She is in Europe If p then q or p → q

Conditional Statements IN-CLASS PROBLEMS Is this a statement? If Lisa is not in Europe, then she is not in France

Conditional Statements IN-CLASS PROBLEMS Is this statement conditional? If Lisa is not in Europe, then she is not in France

Conditional Statements IN-CLASS PROBLEMS If Lisa is not in Europe, then she is not in France Think of it as: ~q: Lisa is not in Europe ~p: She is not in France If ~q then ~p or ~q → ~p

Conditional Statements IN-CLASS PROBLEMS Are these statements equivalent? If Lisa is in France, then she is in Europe p → q If Lisa is not in Europe, then she is not in France ~q → ~p

Conditional Statements IN-CLASS PROBLEMS in France in Europe p→q not in Europe not in France ~q→~p

Conditional Statements IN-CLASS PROBLEMS in France in Europe p→q not in Europe not in France ~q→~p T F

Conditional Statements IN-CLASS PROBLEMS in France in Europe p→q not in Europe not in France ~q→~p T F

Conditional Statements IN-CLASS PROBLEMS in France in Europe p→q not in Europe not in France ~q→~p T F

Conditional Statements For conditional statements, p → q is false only when p is true but q is false Otherwise it is true

Conditional Statements IN-CLASS PROBLEMS in France in Europe p→q not in Europe not in France ~q→~p T F

Conditional Statements IN-CLASS PROBLEMS in France in Europe p→q not in Europe not in France ~q→~p T F

Conditional Statements IN-CLASS PROBLEMS in France in Europe p→q not in Europe not in France ~q→~p T F

Conditional Statements IN-CLASS PROBLEMS in France in Europe p→q not in Europe not in France ~q→~p T F p→q and ~q→~p have the same truth values

Conditional Statements Note: while p→q and ~q→~p are logically equivalent, p→q and ~p→~q aren’t

Conditional Statements Contrapositive (or transposition) of a conditional statement/ proposition: The contrapositive of p→q is ~q→~p

Conditional Statements A conditional statement/ proposition is logically equivalent to its contrapositive

Contrapositive Statements IN-CLASS PROBLEMS What is the contrapositive to: If Howard can swim across the lake, then Howard can swim to the island

Contrapositive Statements IN-CLASS PROBLEMS What is the contrapositive to: If Howard can swim across the lake, then Howard can swim to the island If Howard cannot swim to the island, then Howard cannot swim across the lake

Contrapositive Statements IN-CLASS PROBLEMS What is the contrapositive to: If today is Easter, then tomorrow is Monday

Contrapositive Statements IN-CLASS PROBLEMS What is the contrapositive to: If today is Easter, then tomorrow is Monday If tomorrow is not Monday, then today is not Easter

Questions? www.career.gatech.edu

Biconditional Statements Types of compound statements: Biconditional statements/ propositions contain versions of the words “if and only if” denoted symbolically by “p ↔ q”

Biconditional Statements Types of compound statements: Biconditional statements/ propositions contain versions of the words “if and only if” Sometimes written: iff

Biconditional Statements IN-CLASS PROBLEMS Is it biconditional? I wear my sunglasses if it is sunny

Biconditional Statements IN-CLASS PROBLEMS Is it biconditional? I wear my sunglasses if it is sunny nope

Biconditional Statements IN-CLASS PROBLEMS Is it biconditional? I wear my sunglasses if and only if it is sunny

Biconditional Statements IN-CLASS PROBLEMS Is it biconditional? I wear my sunglasses if and only if it is sunny yep

Biconditional Statements IN-CLASS PROBLEMS Truth table: Sunglasses? Sunny? Sunglasses iff sunny

Biconditional Statements IN-CLASS PROBLEMS Truth table: Sunglasses? Sunny? Sunglasses iff sunny T F

Biconditional Statements IN-CLASS PROBLEMS Truth table: Sunglasses? Sunny? Sunglasses iff sunny T F

Biconditional Statements For biconditional statements, p ↔ q is true whenever the two statements have the same truth value Otherwise it is false

Questions?

Truth Tables in Circuits In designing digital circuits, the designer often begins with a truth table describing what the circuit should do https://www.allaboutcircuits.com/textbook/digital/chpt-7/converting-truth-tables-boolean-expressions/

Truth Tables in Circuits Suppose we were given the task of designing a flame detection circuit for a toxic waste incinerator https://www.allaboutcircuits.com/textbook/digital/chpt-7/converting-truth-tables-boolean-expressions/

Truth Tables in Circuits The intense heat of the fire is intended to neutralize the toxicity of the waste introduced into the incinerator https://www.allaboutcircuits.com/textbook/digital/chpt-7/converting-truth-tables-boolean-expressions/

Truth Tables in Circuits Combustion-based techniques are commonly used to neutralize medical waste, which may be infected with deadly viruses or bacteria https://www.allaboutcircuits.com/textbook/digital/chpt-7/converting-truth-tables-boolean-expressions/

Truth Tables in Circuits So long as a flame is maintained in the incinerator, it is safe to inject waste into it to be neutralized https://www.allaboutcircuits.com/textbook/digital/chpt-7/converting-truth-tables-boolean-expressions/

Truth Tables in Circuits If the flame were to be extinguished, it would be unsafe to inject waste into the combustion chamber, as it would exit the exhaust un-neutralized, and pose a health threat to anyone in close proximity to the exhaust https://www.allaboutcircuits.com/textbook/digital/chpt-7/converting-truth-tables-boolean-expressions/

Truth Tables in Circuits What we need in this system is a sure way of detecting the presence of a flame, and permitting waste to be injected only if a flame is “proven” by the flame detection system https://www.allaboutcircuits.com/textbook/digital/chpt-7/converting-truth-tables-boolean-expressions/

Truth Tables in Circuits https://www.allaboutcircuits.com/textbook/digital/chpt-7/converting-truth-tables-boolean-expressions/

Truth Tables in Circuits Our task, now, is to design the circuitry of the logic system to open the waste valve if and only if there is good flame proven by the sensors https://www.allaboutcircuits.com/textbook/digital/chpt-7/converting-truth-tables-boolean-expressions/

Truth Tables in Circuits Do we want the valve to be opened if only one out of the three sensors detects flame? Two out of three? All three? https://www.allaboutcircuits.com/textbook/digital/chpt-7/converting-truth-tables-boolean-expressions/

Truth Tables in Circuits Design the system so that the valve is opened if and only if all three sensors detect a good flame https://www.allaboutcircuits.com/textbook/digital/chpt-7/converting-truth-tables-boolean-expressions/

Truth Tables in Circuits Sensor A Sensor B Sensor C Open? https://www.allaboutcircuits.com/textbook/digital/chpt-7/converting-truth-tables-boolean-expressions/

Truth Tables in Circuits Sensor A Sensor B Sensor C Open? No fire Fire https://www.allaboutcircuits.com/textbook/digital/chpt-7/converting-truth-tables-boolean-expressions/

Truth Tables in Circuits Sensor A Sensor B Sensor C Open? No fire Fire https://www.allaboutcircuits.com/textbook/digital/chpt-7/converting-truth-tables-boolean-expressions/

Truth Tables in Circuits Sensor A Sensor B Sensor C Open? No fire Fire https://www.allaboutcircuits.com/textbook/digital/chpt-7/converting-truth-tables-boolean-expressions/

Truth Tables in Circuits Sensor A Sensor B Sensor C Open? No fire Fire No Yes https://www.allaboutcircuits.com/textbook/digital/chpt-7/converting-truth-tables-boolean-expressions/

Truth Tables in Circuits This functionality could be generated with a three-input AND gate: the output of the circuit will be “on” if and only if input A AND input B AND input C are all “fire” https://www.allaboutcircuits.com/textbook/digital/chpt-7/converting-truth-tables-boolean-expressions/

Truth Tables in Circuits It would be nice to have a system that minimized shutting the system down unnecessarily, yet still provide sensor redundancy https://www.allaboutcircuits.com/textbook/digital/chpt-7/converting-truth-tables-boolean-expressions/

Truth Tables in Circuits Two out of three might do this! https://www.allaboutcircuits.com/textbook/digital/chpt-7/converting-truth-tables-boolean-expressions/

Truth Tables in Circuits Sensor A Sensor B Sensor C Open? No fire Fire https://www.allaboutcircuits.com/textbook/digital/chpt-7/converting-truth-tables-boolean-expressions/

Truth Tables in Circuits Sensor A Sensor B Sensor C Open? No fire Fire no yes https://www.allaboutcircuits.com/textbook/digital/chpt-7/converting-truth-tables-boolean-expressions/

Truth Tables in Circuits We might want to know when one of the sensors did not agree with the other two https://www.allaboutcircuits.com/textbook/digital/chpt-7/converting-truth-tables-boolean-expressions/

Truth Tables in Circuits Sensor A Sensor B Sensor C Only two agree? No fire Fire https://www.allaboutcircuits.com/textbook/digital/chpt-7/converting-truth-tables-boolean-expressions/

Truth Tables in Circuits Sensor A Sensor B Sensor C Only two agree? No fire Fire yes no https://www.allaboutcircuits.com/textbook/digital/chpt-7/converting-truth-tables-boolean-expressions/

Questions?

Beach Trip Logic problems are found in Crossword Puzzle books They use the skills we learned in this class!