Evaluating Compound Propositions

Slides:



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

Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.
Here’s something you can do if you want to learn about finding half. To understand that half can be arranged non symmetrically You need…. A partner to.
Copyright © Cengage Learning. All rights reserved.
MATH 213 A – Discrete Mathematics for Computer Science Dr. (Mr.) Bancroft.
AP Examination Alert The APCS Examination includes a variety of Boolean Logic questions. Many questions require indirect knowledge of Boolean Logic, and.
Propositional Equivalences
Logical Form and Logical Equivalence Lecture 2 Section 1.1 Fri, Jan 19, 2007.
Computer Science: A Structured Programming Approach Using C1 Objectives ❏ To understand how decisions are made in a computer ❏ To understand the logical.
HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Section 3.3 Logical Equivalence.
WARM UP: 1.) Find the quotient 26.4 ÷ 8.8 = 2.) Find the sum/difference 3 + (-4) = (-5) – 7 = 3.) Determine the answer using order of operations 2 (5 –
IB Computer Science – Logic
Chapter 1: Variables in Algebra
Section 1.3 Order of Operations. Evaluate Is your answer 33 or 19? You can get 2 different answers depending on which operation you did first.
Section 1.1 Propositions and Logical Operations. Introduction Remember that discrete is –the study of decision making in non-continuous systems. That.
Discrete Mathematics Lecture # 1. Course Objectives  Express statements with the precision of formal logic.  Analyze arguments to test their validity.
Expressions and Equations 5.ATO.1 Evaluate numerical expressions involving grouping symbols (i.e., parentheses, brackets, braces). 5.ATO.2 Translate verbal.
Instructor: Chris Trenkov Hands-on Course Python for Absolute Beginners (Spring 2015) Class #003 (February 14, 2015)
Chapter 1. Chapter Summary  Propositional Logic  The Language of Propositions (1.1)  Logical Equivalences (1.3)  Predicate Logic  The Language of.
CMSC201 Computer Science I for Majors Lecture 05 – Comparison Operators and Boolean (Logical) Operators Prof. Katherine Gibson Prof. Jeremy.
Chapter 1 Propositional Logic
Introduction to Logic © 2008 Pearson Addison-Wesley.
Prologue Unit 1 WEEK 1.
CMSC201 Computer Science I for Majors Lecture 03 – Operators
Logic.
Propositional Logic.
The Foundations: Logic and Proofs
DISCRETE MATHEMATICS CHAPTER I.
Equivalent Expressions Using the Distributive Property
Truth Tables and Equivalent Statements
Section 7.1 Logical Operators
Simplifying Fractions
COMP 1380 Discrete Structures I Thompson Rivers University
How do I show that two compound propositions are logically equivalent?
Variation Algebra 2/Trig Unit 3 Day 1.
Independent and dependent varibles
MATH 15A – Discrete Mathematics
Math 2 Fall Semester Final Review.
Principles of Computing – UFCFA3-30-1
IM1 – F-I-F-3 – SUPPORT Piggies & Pools Linear & Exponential Functions
Logic – Bell Ringer.
1.2 Propositional Equivalences
Propositional Equivalences
Intro to Computer Science CS1510 Dr. Sarah Diesburg
Chapter 1 The Foundations: Logic and Proof, Sets, and Functions
Direct and Inverse VARIATION Section 8.1.
U.S. History Research Paper Outline & Organizer (Due 4/11!!)
Computer Science 210 Computer Organization
Propositional Equivalences
Discrete Mathematics and Its Applications Kenneth H
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Python Programming Language
Science Social Studies Exploratory Lunch/Locker Math English
What are the following properties?
1.2 Propositional Equivalences
Equivalent Statements
Bottom Up: Soundness and Completeness
This Lecture Substitution model
Truth tables Mrs. Palmer.
COMP 1380 Discrete Structures I Thompson Rivers University
1.2 Propositional Equivalences
DO NOW Add these vocabulary words to the Ch. 5 Vocab section of your notebook. 1. Rate of Change: the relationship between two quantities that are.
Selection—Making Decisions
Topics discussed in this section:
U.S. History Research Paper Outline & Organizer
2-2 Logic Part 2 Truth Tables.
Variations word problems
Truth tables.
Finding the Missing Coordinate
Bottom Up: Soundness and Completeness
Presentation transcript:

Evaluating Compound Propositions Section 1.2 Evaluating Compound Propositions

Vocabulary Words compound proposition

In-Class Activity #1 Get in groups of 3 or 4 students. By next week I’m going to ask you to try to settle into regular groups that you will use each day for the first half of the semester. Again, each person should print their name at the top of the paper I will hand out. As a group, complete Part One

Activity Let How would we write m = Juan is a math major c = Juan is a computer science major How would we write Juan is a math major but not a computer science major Juan is either a math major or a computer science major

Activity Let How would we write s = stocks are increasing i = interest rates are steady How would we write Stocks are increasing while interest rates are steady Neither are stocks increasing nor are interest rates steady

Activity Neither are stocks increasing nor are interest rates steady. It’s pretty common for me to hear several different answers for this one. How can we determine if two different answers are equivalent?

Truth Tables A truth table shows the relationship between various (often related) statements. It’s size depends on the number of independent variables represented in the statements N independent atomic formulae (variables)  2N rows

One possibility p q ¬ p  ¬ q T F

Order of Operations Just like there is an order of operations with arithmetic (remember PEMDAS?) there is an order of operation with logic. ¬  

One possibility p q ¬ p  ¬ q T F

One possibility p q ¬ p ¬ q ¬ p  ¬ q T F

Activity #2 Let’s see which variations are equivalent.

Variation 1 p q ¬ p ¬ q ¬ p  ¬ q T F

Variation 2 p q p  q ¬ (p  q) T F

Variation 3 p q p  q ¬ (p  q) T F

“Bigger” Compound Propositions While the examples we just looked at were “compound” because they had more than one operator, they still dealt with two variables. But lots of times when we use this phrase we are referring to three or more variables.

Activity #3 Let h = John is healthy w = John is wealthy s = John is wise

Activity #3 Write compound propositions representing John is healthy and wealthy but not wise John is not wealthy but he is healthy and wise John is neither healthy, wealthy, nor wise John is neither wealthy nor wise, but he is healthy. John is wealthy, but he is not both healthy and wise.

How do we build truth tables for these larger compound propositions?

Truth Tables A truth table shows the relationship between various (often related) statements. It’s size depends on the number of independent variables represented in the statements N independent atomic formulae (variables)  2N rows

A three variable truth table p q r p  q  r T F

Activity #4

A three variable truth table p q r p  (¬q  r ) T F

A three variable truth table p q r p  q  p  r T (1) F (2) (3) (4) (5) (6) (7) (8)