Logical Connectives. All kittens are cute. ; I like pizza. ; The sky is blue. ; Triangles have three sides.

Similar documents
for all x, the assertion P(x) is false. there exists x, for which the assertion P(x) is true.

[Video] and so on... Problems that require a function definition can be phrased as a word problem such as the following:

2SKILL. Variables Lesson 6. Remembering numbers (and other stuff)...

Multi-Place Predicates and Multiple Quantifiers

Trombone players produce different pitches partly by varying the length of a tube.

Chapter 9 Deductive Arguments II Truth-Functional Logic. Tutorial: Truth Tables

princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 24: Online Algorithms

L05 - Negating Statements

Student Outcomes. Lesson Notes. Classwork. Discussion (4 minutes)

In this lesson: Line height, type size and line width are the three aspects of shaping a perfect paragraph. Lesson 2

If Statements, For Loops, Functions

Mathematical Logic Prof. Arindama Singh Department of Mathematics Indian Institute of Technology, Madras. Lecture - 9 Normal Forms

Propositional Logic:

Binary, Hexadecimal and Octal number system

GENERAL MATH FOR PASSING

C++ Data Types. 1 Simple C++ Data Types 2. 3 Numeric Types Integers (whole numbers) Decimal Numbers... 5

Simple Graph. General Graph

Properties and Definitions

Accounts and Passwords

Chapter 1 Operations With Numbers

Topic C. Communicating the Precision of Measured Numbers

Table of Laplace Transforms

Data Structures and Algorithms Dr. Naveen Garg Department of Computer Science and Engineering Indian Institute of Technology, Delhi.

Class 8 - September 13 Indirect Truth Tables for Invalidity and Inconsistency ( 6.5)

Section 1.1 Logic LOGIC

VARIABLES. Aim Understanding how computer programs store values, and how they are accessed and used in computer programs.

Lesson 4. Objective: Compare and classify quadrilaterals. Lesson Suggested Lesson Structure. Multiply by 4 (8 minutes)

Excerpt from "Art of Problem Solving Volume 1: the Basics" 2014 AoPS Inc.

Grade 7/8 Math Circles. Counting I

Introduction to the Internet Computer Essentials Session 4 - Step-by-Step Guide

Have the students look at the editor on their computers. Refer to overhead projector as necessary.

Quick Reference Design Guide

Unit 9 Tech savvy? Tech support. 1 I have no idea why... Lesson A. A Unscramble the questions. Do you know which battery I should buy?

Formatting: Cleaning Up Data

Grade 6 Math Circles November 6 & Relations, Functions, and Morphisms

Divisibility Rules and Their Explanations

(a) (4 pts) Prove that if a and b are rational, then ab is rational. Since a and b are rational they can be written as the ratio of integers a 1

(Refer Slide Time: 02.06)

Typing Control. Chapter Conditionals

Informatics 1 - Computation & Logic: Tutorial 4

MA30SA Applied Math Unit D - Linear Programming Revd:

Section 1.1 Definitions and Properties

CS 3512, Spring Instructor: Doug Dunham. Textbook: James L. Hein, Discrete Structures, Logic, and Computability, 3rd Ed. Jones and Barlett, 2010

9. MATHEMATICIANS ARE FOND OF COLLECTIONS

Selec%on and Decision Structures in Java: If Statements and Switch Statements CSC 121 Spring 2016 Howard Rosenthal

COMP 161 Lecture Notes 16 Analyzing Search and Sort

CMPSCI 250: Introduction to Computation. Lecture #7: Quantifiers and Languages 6 February 2012

5 R1 The one green in the same place so either of these could be green.

Selec%on and Decision Structures in Java: If Statements and Switch Statements CSC 121 Fall 2016 Howard Rosenthal

Propositional Logic. Application of Propositional logic

, etc. Let s work with the last one. We can graph a few points determined by this equation.

Recursively Enumerable Languages, Turing Machines, and Decidability

CMSC 201 Fall 2016 Lab 09 Advanced Debugging

Lesson 13: The Graph of a Linear Equation in Two Variables

Propositional Logic. Part I

The name of our class will be Yo. Type that in where it says Class Name. Don t hit the OK button yet.

Chapter 3. Set Theory. 3.1 What is a Set?

Answer Key #1 Phil 414 JL Shaheen Fall 2010

Computational Geometry: Lecture 5

1. Logic as a subject matter is the study of logics, understood as models of acceptable inference patterns

How to Improve Your Campaign Conversion Rates

Proofwriting Checklist

Functional Programming in Haskell Prof. Madhavan Mukund and S. P. Suresh Chennai Mathematical Institute

1.1 Defining Functions

Mathematical Logic Part One

following determine whether it is an element, subset or neither of A and

Valuable points from Lesson 6 Adobe Flash CS5 Professional Classroom in a Book

CS61A Summer 2010 George Wang, Jonathan Kotker, Seshadri Mahalingam, Eric Tzeng, Steven Tang

Mathematical Logic Part Two

Variables and Data Representation

CSS Crash Course for Fearless Bloggers by Gill Andrews

Honors Computer Science Python Mr. Clausen Programs 4A, 4B, 4C, 4D, 4E, 4F

Mathematical Logic Part Two

GAP CLOSING. Grade 9. Facilitator s Guide

CS40-S13: Functional Completeness

(Refer Slide Time: 01.26)

CDs & DVDs: Different Types of Disk Explained

Problem Solving through Programming In C Prof. Anupam Basu Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur

Grade 7/8 Math Circles February 11/12, Counting I

Lecture Transcript While and Do While Statements in C++

Formal Methods of Software Design, Eric Hehner, segment 1 page 1 out of 5

Functional abstraction. What is abstraction? Eating apples. Readings: HtDP, sections Language level: Intermediate Student With Lambda

Functional abstraction

Hey there, I m (name) and today I m gonna talk to you about rate of change and slope.

WBJS Grammar Glossary Punctuation Section

8/27/2016. ECE 120: Introduction to Computing. Graphical Illustration of Modular Arithmetic. Representations Must be Unambiguous

Lesson 1A - First Java Program HELLO WORLD With DEBUGGING examples. By John B. Owen All rights reserved 2011, revised 2015

Shannon Switching Game

(Refer Slide Time: 06:01)

Programming in the Real World. Dr. Baldassano Yu s Elite Education

Mathematical Logic Prof. Arindama Singh Department of Mathematics Indian Institute of Technology, Madras. Lecture - 37 Resolution Rules

A simple problem that has a solution that is far deeper than expected!

The first time you open Word

SPRITES Moving Two At the Same Using Game State

5.6 Rational Equations

Creating a Box-and-Whisker Graph in Excel: Step One: Step Two:

III SEMESTER B. A. PHILOSOPHY PHL3B04 - SYMBOLIC LOGIC AND INFORMATICS QUESTION BANK FOR INTERNAL ASSESSMENT. Multiple Choice Questions

MITOCW watch?v=4dj1oguwtem

Discussion 11. Streams

QUICK EXCEL TUTORIAL. The Very Basics

Transcription:

Logical Connectives We have learned what a statement is. Recall that a statement is just a proposition that asserts something that is either true or false. For instance, these are propositions: All kittens are cute. ; I like pizza. ; The sky is blue. ; Triangles have three sides. These are simple statements. But, statements can be a lot more complicated than this. Define a compound statement as any proposition which contains either: (a) two or more simple statements, or (b) at least one negated simple statement. For instance: Peggy is taking Logic and Sue is taking Ethics. Chad saw a squirrel today or he saw a deer. If it snows today, then we will build a snowman. The cookies will turn out right if and only if we bake them at 350 degrees. It is not the case that the sun is shining today. Notice that (with the exception of the last sentence about the sun shining) all of the propositions above include TWO statements. The two statements are connected by what is called a connective or an operator, because they OPERATE on one or more statements, and often CONNECT two or more of them together (in order, they are: and, or, if then, and if and only if ). The final sentence only includes ONE simple statement, but it is the NEGATION of that statement. The connective in that sentence is not. If we replace each of the statements above with capital letters, we will be able to see the connectives more clearly: P and S S or D If S then B. C if and only if B. Not S. In this lesson, we will learn about each of the operators above (the words in bold). In logic, though, we actually use SYMBOLS for each of the logical operators. Like this: P and S P S S or D S C If S then B. S B C if and only if B. C B Not S. S Let s look at each of these operators in more detail, beginning with not or. 1

1. Negation: We represent not with a dash ( ). Whenever we want to NEGATE a statement, this basically means that we want to say that the statement is FALSE. For instance, imagine that I told you something like: I m going to give you a million dollars NOT. The NOT here is serving the purpose of negation. Its purpose is to indicate that the entire statement just uttered is false. Only, in logic, the not comes first, like this: or NOT: I m going to give you a million dollars. It is not the case that I m going to give you a million dollars. In logic, we use symbols for the operators and capital letters for AFFIRMATIVE statements. So, we will replace the NOT with a, and let s use the letter G for I m going to give you a million dollars. In that case, the translation of the statement above into Symbolic Logic form is just this: G Synonyms for not : All negative claims should be represented this way. So, G would be the correct symbolization of all of the following: It is not the case that I am giving you one million dollars. Translation: G It is false that I am giving you one million dollars. Translation: G I am not giving you one million dollars. Translation: G Note that the comes IN FRONT of a SINGLE statement. All of the other symbols we are about to learn must always come IN BETWEEN TWO statements. 2. Conjunction: Conjunction means conjoining two statements together to affirm them both. We typically do this with the word and. For instance, I might say that I like vanilla AND chocolate. The claims on either side of the and are called the conjuncts. We represent conjunction with a caret,. For example: Peggy wants pizza, and Sue wants pizza. gets translated as: P S Synonyms for and : But, and is not the ONLY word that indicates conjunction. For instance, the following compound statements are also conjunctions: Peggy likes pepperoni pizza, but Sue likes Hawaiian. Dominoes has a special on pepperoni; however, Papa John s has a special on Hawaiian. Peggy and Sue decide to get burgers instead. 2

ALL of the above statements are really just the conjunction of two separate claims. To see this, just replace the bold words with the word and and you ll see that it doesn t really change the claims being made. For instance, if we change: to: Peggy likes pepperoni pizza, but Sue likes Hawaiian. Peggy likes pepperoni pizza, and Sue likes Hawaiian. These two statements indicate the same thing; namely, that Peggy likes pepperoni pizza and also Sue likes Hawaiian pizza. Swapping the order: Notice that Peggy likes pepperoni and Sue likes Hawaiian means exactly the same thing as Sue likes Hawaiian and Peggy likes pepperoni. So, for conjunction, the order of the conjuncts can be swapped, and the swapped sentence still means the same thing. So, P S means the same thing as S P 3. Disjunction: Disjunction means presenting two statements as ALTERNATIVES. We typically do this with the word or. For instance, I might say that I will eat strawberry OR chocolate. The claims on either side of the or are called the disjuncts. We represent disjunction with a wedge,, which basically just looks like the letter v. For instance: I will have strawberry or I will have chocolate. Gets translated as: S C Note: We often add the word either in front of a disjunction. This has the same meaning: Either I will have strawberry, or I will have chocolate. Translation: S C Swapping the order: Notice that I will have strawberry or chocolate means exactly the same thing as I will have chocolate or strawberry. So, for disjunction, the order of the disjuncts can be swapped, and the swapped sentence still means the same thing. So, S C means the same thing as C S 4. Conditionals: Conditional statements express an if then claim. For instance, I might say that IF there is any pepperoni left, THEN I will eat pepperoni. The FIRST part of the sentence (after the if ) is called the antecedent, while the SECOND part of the sentence (after the then ) is called the consequent. The antecedent is the CONDITION upon which the consequent is guaranteed to follow. The conditional relation is expressed by the arrow symbol,. For instance, 3

If there is any pepperoni left, then I will eat pepperoni. gets translated as: P E Note: Which letters we choose are not really that important. I could have chosen P to represent the consequent, I will eat Pepperoni but that would be confusing, since I already chose P to represent the antecedent, If there is any Pepperoni left. So, instead, I chose E to represent the consequent, I will Eat pepperoni. In general, try to pick letters that make as much sense as possible, and do not use the same letter twice for different statements. Location of the If : In everyday conversation, we don t always put the if part of the conditional first. For instance, instead of the above, we might have said this instead: I will eat pepperoni, if there is any pepperoni left. Note that this has the SAME MEANING. So, the translation is still: P E The important thing here is to look for the word if. Everything after the if is STILL the antecedent EVEN WHEN the if part of the statement COMES SECOND. Synonyms for if then : There are actually a LOT of synonyms for if then. Here are a few of them: If Peggy goes to the party, then Sue will go too. Sue will go to the party if Peggy goes. Sue will go to the party, provided that Peggy goes. Sue will go to the party on the condition that Peggy goes. Sue s going to the party entails that Peggy goes too. Sue will go to the party only if Peggy goes. Note: This translation of only if is not intuitive. I will explain it in a bit. NOT swapping the order: Note that changing the order of the antecedent and the consequent does NOT result in a sentence with the same meaning. For instance, consider the difference between: If it is raining, then the ground is wet. Translation: R W and: If the ground is wet, then it is raining. Translation: W R 4

These do NOT mean the same thing. If it is raining, then the ground will definitely be wet. On the other hand, if the ground is wet, this does NOT guarantee that it is raining. (for instance, I might be spraying the ground with a hose, or maybe some snow is melting and getting the ground wet). So, unlike and and or where the letters can be swapped without changing the meaning, for if then the order can NOT be swapped without changing the meaning. 5. Bi-Conditionals: Bi-Conditional statements are DOUBLE conditionals; that is, the if then claim goes in BOTH directions, rather than just one direction. This is typically expressed by the phrase if and only if, and it is symbolized by the double-arrow,. So, for instance, the bi-conditional statement Sue will go to the party if and only if Peggy does. literally means the same thing as: Sue will go to the party if Peggy goes. AND Sue will go to the party only if Peggy goes. So, the bi-conditional above could be stated as follows: (P S) (S P) That s WHY we call it a bi-conditional. It s literally a two-way conditional. The arrow goes in one direction from the P to the S, and it ALSO goes in the other direction from the S to the P. We abbreviate this by using the double-arrow for bi-conditionals, like this: S P 6. Summary: The following chart summarizes everything so far: Operator Symbol Example NOT P AND P Q OR P Q IF THEN P Q IF AND ONLY IF P Q 7. On Translating Only If : This can be confusing so pay close attention. We have said that unlike our translation of if by itself when the term ONLY if appears, everything after the if is the CONSEQUENT, and NOT the antecedent. For instance, You will win the lottery only if you ve bought a ticket. ( W only if B ) 5

Gets translated as: W B This may seem counter-intuitive, but the first sentence is really just saying that you MUST buy a lottery ticket in order to win the lottery. That is, having bought a ticket is a NECESSARY pre-condition for winning. You might have been tempted to translate W only if B as B W, but, consider the difference between the following two sentences: If you will win the lottery, then you ve bought a ticket. (W B) If you ve bought a ticket, then you will win the lottery. (B W) W only if B was obviously true. Here, W B is also obviously true. However, B W is not obviously true. After all, lots of people buy lottery tickets but never win. So, we translate W only if B as W B. It turns out that these two statements mean the same thing in logic. Note #1: These last two explanations on if and only if should help to make sense of the bi-conditional, if and only if. For, we have just learned that: and P if Q gets translated as: Q P P only if Q gets translated as: P Q So, when we combine them, P if and only if Q gets translated as: (P Q) and (Q P) which we abbreviate as: P Q Note #2: You may have been thinking that You will win the lottery only if you ve bought a ticket should be translated as: If you have NOT bought a ticket, then you will NOT win the lottery instead. Symbolize this as B W. That seems right. So, why did we say that it should be translated as W B? As it turns out, these two strings of symbols mean the same thing. In logic, we say that they are logically equivalent. We ll express their logical equivalence like this: W B B W We ll learn more about logical equivalence later. 6