Sec$on Summary. Propositions Connectives. Truth Tables. Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional

Similar documents
Chapter 1, Part I: Propositional Logic. With Question/Answer Animations

Chapter Summary. Propositional Logic. Predicate Logic. Proofs. The Language of Propositions (1.1) Applications (1.2) Logical Equivalences (1.

Propositional Logic 1

Chapter 1, Part I: Propositional Logic. With Question/Answer Animations

The Foundations: Logic and Proofs. Part I

Section 1.1 Propositional Logic. proposition : true = T (or 1) or false = F (or 0) (binary logic) the moon is made of green cheese

CSC Discrete Math I, Spring Propositional Logic

Introduction. Applications of discrete mathematics:

Logic. Def. A Proposition is a statement that is either true or false.

2/18/14. What is logic? Proposi0onal Logic. Logic? Propositional Logic, Truth Tables, and Predicate Logic (Rosen, Sections 1.1, 1.2, 1.

Discrete Mathematical Structures. Chapter 1 The Foundation: Logic

Proposition/Statement. Boolean Logic. Boolean variables. Logical operators: And. Logical operators: Not 9/3/13. Introduction to Logical Operators

Compound Propositions

Discrete Mathematics and Applications COT3100

W3203 Discrete Mathema1cs. Logic and Proofs. Spring 2015 Instructor: Ilia Vovsha. hcp://

3/29/2017. Logic. Propositions and logical operations. Main concepts: propositions truth values propositional variables logical operations

EECS 1028 M: Discrete Mathematics for Engineers

Chapter 1, Section 1.1 Propositional Logic

Introduction Propositional Logic. Discrete Mathematics Andrei Bulatov

Note: The area of logic that deals with propositions is called the propositional calculus or propositional logic.

CS100: DISCRETE STRUCTURES. Lecture 5: Logic (Ch1)

1 The Foundations. 1.1 Logic. A proposition is a declarative sentence that is either true or false, but not both.

HW1 graded review form? HW2 released CSE 20 DISCRETE MATH. Fall

Lecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)

Boolean Logic. CS 231 Dianna Xu

2/13/2012. Logic: Truth Tables. CS160 Rosen Chapter 1. Logic?

Today s Topic: Propositional Logic

Discrete Mathematics

Section 1.1: Logical Form and Logical Equivalence

Discrete Structures for Computer Science

An Introduction to Logic 1.1 ~ 1.4 6/21/04 ~ 6/23/04

PROPOSITIONAL CALCULUS

Discrete Structures of Computer Science Propositional Logic I

DISCRETE MATHEMATICS BA202

Definition 2. Conjunction of p and q

Why Learning Logic? Logic. Propositional Logic. Compound Propositions

Example. Logic. Logical Statements. Outline of logic topics. Logical Connectives. Logical Connectives

What is Logic? Introduction to Logic. Simple Statements. Which one is statement?

Logic as a Tool Chapter 1: Understanding Propositional Logic 1.1 Propositions and logical connectives. Truth tables and tautologies

Propositional Logic Basics Propositional Equivalences Normal forms Boolean functions and digital circuits. Propositional Logic.

10/5/2012. Logic? What is logic? Propositional Logic. Propositional Logic (Rosen, Chapter ) Logic is a truth-preserving system of inference

Propositional logic ( ): Review from Mat 1348

Chapter 1: Formal Logic

GEOMETRY. Chapter 2: LOGIC. Name: Teacher: Pd:

CSE 20: Discrete Mathematics

Propositional Logic. Fall () Propositional Logic Fall / 30

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

Math.3336: Discrete Mathematics. Applications of Propositional Logic

Introduction Propositional Logic

3.2: Compound Statements and Connective Notes

ARTIFICIAL INTELLIGENCE

AI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic and Predicate Logic

ICS141: Discrete Mathematics for Computer Science I

Announcements. CS311H: Discrete Mathematics. Propositional Logic II. Inverse of an Implication. Converse of a Implication

2. The Logic of Compound Statements Summary. Aaron Tan August 2017

TRUTH TABLES LOGIC (CONTINUED) Philosophical Methods

CSCE 222 Discrete Structures for Computing. Propositional Logic. Dr. Hyunyoung Lee. !!!!!! Based on slides by Andreas Klappenecker

Mathematical Logic Part One

A statement is a sentence that is definitely either true or false but not both.

Lecture 02: Propositional Logic

Introduc)on. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari 1

Truth-Functional Logic

DISCRETE STRUCTURES WEEK5 LECTURE1

Discrete Structures. Introduc:on. Examples of problems solved using discrete structures. What is discrete about Discrete Structures?

1.1 Language and Logic

Logic and Truth Tables

Propositional Logic. Spring Propositional Logic Spring / 32

2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional Logic

LOGIC CONNECTIVES. Students who have an ACT score of at least 30 OR a GPA of at least 3.5 can receive a college scholarship.

Numbers that are divisible by 2 are even. The above statement could also be written in other logically equivalent ways, such as:

Section 3.1 Statements, Negations, and Quantified Statements

n logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional)

Logic Overview, I. and T T T T F F F T F F F F

software design & management Gachon University Chulyun Kim

MAT2345 Discrete Math

1.1 Language and Logic

Overview. 1. Introduction to Propositional Logic. 2. Operations on Propositions. 3. Truth Tables. 4. Translating Sentences into Logical Expressions

Logic and Proof. Aiichiro Nakano

It is not the case that ϕ. p = It is not the case that it is snowing = It is not. r = It is not the case that Mary will go to the party =

Propositions. Frequently, we will use the word statement instead of proposition.

A Statement; Logical Operations

Logic and Propositional Calculus

AMTH140 Lecture 8. Symbolic Logic

Introduction to Sets and Logic (MATH 1190)

THE LOGIC OF COMPOUND STATEMENTS

ECOM Discrete Mathematics

1 Propositional Logic

DERIVATIONS AND TRUTH TABLES

Functions. Lecture 4: Truth functions, evaluating compound statements. Arithmetic Functions. x y x+y

Unit 1. Propositional Logic Reading do all quick-checks Propositional Logic: Ch. 2.intro, 2.2, 2.3, 2.4. Review 2.9

Sec$on Summary. Mathematical Proofs Forms of Theorems Trivial & Vacuous Proofs Direct Proofs Indirect Proofs

Propositional Logic. Propositional Equivalences. Agenda. Yutaka HATA, IEEE Fellow. Ch1.1 Propositional Logic. Ch1.2 Propositional Equivalences

Chapter 3: Logic. Diana Pell. A statement is a declarative sentence that is either true or false, but not both.

The statement calculus and logic

Exercises DEFINITION 7 EXAMPLE 12 EXAMPLE 13. TABLE 9 Table for the Bit Operators OR, AND, and XOR.

Formal Logic. Critical Thinking

Logical Operators. Conjunction Disjunction Negation Exclusive Or Implication Biconditional

Propositional Equivalence

Chapter 1: The Logic of Compound Statements. January 7, 2008

CSE 20 DISCRETE MATH. Fall

Transcription:

Section 1.1

Sec$on Summary Propositions Connectives Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional ruth ables 2

Proposi$ons A proposition is a declarative sentence that is either true or false. Examples of propositions: he Moon is made of green cheese. renton is the capital of New Jersey. oronto is the capital of Canada. 1 + 0 = 1 0 + 0 = 2 Examples that are not propositions. Sit down! What time is it? x + 1 = 2 x + y = z 3

Examples: Is it a proposi$on? Do your homework. NO! It s a command, not a declarative sentence that s either true or false. Pigs can fly. YES! he proposition is false. x is greater than y. NO! Until we know the values of x and y, we can t say whether the statement is true or false. 4

Proposi$onal Logic Constructing Propositions Propositional variables: p, q, r, s, Compound Propositions: constructed from logical connectives and other propositions Negation Conjunction Disjunction Implication Biconditional he proposition that is always true is denoted by and the proposition that is always false is denoted by. 5

Compound Proposi$ons: Nega$on he negation of a proposition p is denoted by p and has this truth table: p p Example: p : he earth is round. p denotes It is not the case that the earth is round, or more simply he earth is not round. 6

Conjunc$on (AND) he conjunction of propositions p and q is denoted by p q and has this truth table: p q p q Example: p : I am at home. q: It is raining. p q denotes I am at home and it is raining. 7

Disjunc$on (inclusive OR) he disjunction of propositions p and q is denoted by p q and has this truth table: p q p q Example: p: I am at home. q: It is raining. p q: I am at home or it is raining. 8

he Connec$ve Or in English In English or has two distinct meanings. Inclusive Or - Students who have taken CS202 or Math120 may take this class. We assume that students need to have taken one of the prerequisites, but may have taken both. his is the meaning of disjunction. or p q to be true, either one or both of p and q must be true. Exclusive Or - Soup or salad comes with this entrée, we do not expect to be able to get both soup and salad. his is the meaning of Exclusive Or (Xor). In p q, one of p and q must be true, but not both. he truth table for is: p q p q 9

Implica$on If p and q are propositions, then p q is a conditional statement or implication which is read as if p, then q and has this truth table: p q p q Example: p : I am at home. q: It is raining. p q: If I am at home, then it is raining. In p q, p is the hypothesis (antecedent or premise) and q is the conclusion (or consequence). 10

Understanding Implica$on In p q there doesn t need to be any connection between the antecedent or the consequent. he meaning of p q depends only on the truth values of p and q. hese implications are valid (and true!): If the moon is made of green cheese, then I have more money than Bill Gates. If the moon is made of green cheese, then I m in Kent. If 1 + 1 = 3, then your grandma wears combat boots. 11

Understanding Implica$on (cont) One way to view the logical conditional is to think of an obligation or contract. If I am elected, then I will lower taxes. If you get 100% on the final, then you will get an A. If the politician is elected and does not lower taxes, then the voters can say that he or she has broken the campaign pledge. Something similar holds for the professor. his corresponds to the case where p is true and q is false. 12

Different Ways of Expressing p q if p, then q if p, q q unless p q if p q whenever p q follows from p p implies q p only if q q when p 13

Different Ways of Expressing p q Necessity vs. Sufficiency Necessity q is necessary for p. A necessary condition for p is q. It s necessary to q to p. We say q is necessary, because if p is true, it s necessary that q must also be true. Sufficiency p is sufficient for q. A sufficient condition for q is p. It s sufficient to p to q. We say that p is sufficient, because it s enough for p to be true in order to q to be true. 14

Ex: Express in the form if p, then q It is necessary to do the boss s laundry to get promoted. If you get promoted, then you ve washed the boss s laundry. John gets caught whenever he cheats. If John cheats, then he gets caught. he apple trees will bloom if it stays warm for a week. If it stays warm for a week, then the apple trees will bloom. o get tenure as a professor, it is sufficient to be world-famous. If you world-famous, then you will get tenure as a professor. 15

Converse, Contraposi$ve, and Inverse rom p q we can form new conditional statements. p q is the inverse of p q q p is the converse of p q q p is the contrapositive of p q Example: ind the converse, inverse, and contrapositive of It is raining is a sufficient condition for me not going to town. Solution: inverse: If it is not raining, then I will go to town. converse: If I do not go to town, then it is raining. contrapositive: If I go to town, then it is not raining. 16

Bicondi$onal If p and q are propositions, then we can form the biconditional proposition p q, read as p if and only if q. he biconditional p q denotes the proposition with this truth table: p q p q If p denotes I am at home. and q denotes It is raining. then p q denotes I am at home if and only if it is raining. 17

Expressing the Bicondi$onal Some alternative ways p if and only if q is expressed in English: p is necessary and sufficient for q if p then q, and conversely p iff q 18

Examples p: It s raining q: I carry my umbrella What s the negation of p? p: It s not raining. What s the disjunction? p q: It s raining or I carry my umbrella. What s the conjunction? p q: It s raining and I carry my umbrella. What s the implication, using p as the hypothesis? p q: If it s raining, then I carry my umbrella. What s the biconditional? p q: It rains if and only if I carry my umbrella. 19

Examples Use the implication p q, where p: It s raining q: I carry my umbrella What s the converse? q p: If I carry my umbrella, then it s raining. What s the contrapositive? q p: If I don t carry my umbrella, then it s not raining. What s the inverse? p q: If it s not raining, then I don t carry my umbrella. 20

ruth ables or Compound Proposi$ons Construction of a truth table: Rows Need a row for every possible combination of values for the atomic propositions. Columns Need a column for the compound proposition (usually at far right) Need a column for the truth value of each expression that occurs in the compound proposition as it is built up. 21

Example ruth able Construct a truth table for p q r r p q p q r 22

Equivalent Proposi$ons wo propositions are equivalent if they always have the same truth value. Example: Show using a truth table that the implication is equivalent to the contrapositive. Solution: p q p q p q q p 23

Using a ruth able to Show Non- Equivalence Example: Show using truth tables that neither the converse nor inverse of an implication are equivalent to the implication. (i.e., neither p q nor q p is equivalent to p q) p q p q p q p q q p 24

Problem How many rows are there in a truth table with n propositional variables? Solution: 2 n We will see how to do this in Chapter 6. Note that this means that with n propositional variables, we can construct 2 n distinct (i.e., not equivalent) propositions. 25

Precedence of Logical Operators Operator 1 Precedence 2 3 4 5 p q r is equivalent to (p q) r If the intended meaning is p (q r ) then parentheses must be used. 26

Example: Construct a truth table for ((p q) (p q)) r p q r q p q p q (p q) (p q) ((p q) (p q)) r 27