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

Similar documents
Introduction. Applications of discrete mathematics:

Full file at

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

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

Compound Propositions

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

CSC Discrete Math I, Spring Propositional Logic

Chapter 1, Section 1.1 Propositional Logic

Propositional Logic 1

Section 1.2 Propositional Equivalences. A tautology is a proposition which is always true. A contradiction is a proposition which is always false.

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

AMTH140 Lecture 8. Symbolic Logic

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

PROPOSITIONAL CALCULUS

The Foundations: Logic and Proofs. Part I

Introduction Propositional Logic. Discrete Mathematics Andrei Bulatov

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

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

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

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

Discrete Structures of Computer Science Propositional Logic I

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

Section 1.1: Logical Form and Logical Equivalence

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

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

Chapter 4: Classical Propositional Semantics

Lecture 02: Propositional Logic

Proofs. Joe Patten August 10, 2018

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

Discrete Mathematics and Applications COT3100

DISCRETE STRUCTURES WEEK5 LECTURE1

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

ARTIFICIAL INTELLIGENCE

3.2: Compound Statements and Connective Notes

TRUTH TABLES LOGIC (CONTINUED) Philosophical Methods

Discrete Mathematics

Today s Topic: Propositional Logic

Propositional logic ( ): Review from Mat 1348

Propositional Logic. Spring Propositional Logic Spring / 32

Discrete Mathematical Structures. Chapter 1 The Foundation: Logic

Discrete Structures & Algorithms. Propositional Logic EECE 320 // UBC

Section 2.2 Set Operations. Propositional calculus and set theory are both instances of an algebraic system called a. Boolean Algebra.

The statement calculus and logic

ICS141: Discrete Mathematics for Computer Science I

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

1.1 Language and Logic

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

1.1 Language and Logic

We last time we began introducing equivalency laws.

Packet #1: Logic & Proofs. Applied Discrete Mathematics

MAT2345 Discrete Math

Propositional Logic. Fall () Propositional Logic Fall / 30

Truth-Functional Logic

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

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

Propositional Calculus. Problems. Propositional Calculus 3&4. 1&2 Propositional Calculus. Johnson will leave the cabinet, and we ll lose the election.

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

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

A Statement; Logical Operations

1.1 Statements and Compound Statements

Chapter 1: Formal Logic

02 Propositional Logic

Definition 2. Conjunction of p and q

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

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

Unit I LOGIC AND PROOFS. B. Thilaka Applied Mathematics

Conditional Statements

Introduction Propositional Logic

Boolean Logic. CS 231 Dianna Xu

More Propositional Logic Algebra: Expressive Completeness and Completeness of Equivalences. Computability and Logic

- 1.2 Implication P. Danziger. Implication

DISCRETE MATHEMATICS BA202

Propositional Logic. Yimei Xiang 11 February format strictly follow the laws and never skip any step.

Discrete Structures for Computer Science

15414/614 Optional Lecture 1: Propositional Logic

Logic and Proof. Aiichiro Nakano

CSE20: Discrete Mathematics for Computer Science. Lecture Unit 2: Boolan Functions, Logic Circuits, and Implication

2.2: Logical Equivalence: The Laws of Logic

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

Proposition logic and argument. CISC2100, Spring 2017 X.Zhang

Where are my glasses?

Propositional Equivalence

Knowledge representation DATA INFORMATION KNOWLEDGE WISDOM. Figure Relation ship between data, information knowledge and wisdom.

Conjunction: p q is true if both p, q are true, and false if at least one of p, q is false. The truth table for conjunction is as follows.

1 Propositional Logic

CSE 311: Foundations of Computing. Lecture 2: More Logic, Equivalence & Digital Circuits

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

Truth Functions, 6.2 T T T T F F F F T F F F. Note that we need 4 lines to explore all the possibilities: When both are true (row 1),

ANALYSIS EXERCISE 1 SOLUTIONS

CISC-102 Winter 2016 Lecture 17

THE LOGIC OF COMPOUND STATEMENTS

Equivalence and Implication

Logic and Propositional Calculus

Discrete Mathematics and Its Applications

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

Unary negation: T F F T

LING 106. Knowledge of Meaning Lecture 3-1 Yimei Xiang Feb 6, Propositional logic

THE LOGIC OF COMPOUND STATEMENTS

To reason to a correct conclusion, we must build our arguments on true statements. Sometimes it is helpful to use truth tables. Simple Truth Table p

Propositional natural deduction

Transcription:

Section 1.1 Propositional Logic proposition : true = T (or 1) or false = F (or 0) (binary logic) the moon is made of green cheese go to town! X - imperative What time is it? X - interrogative propositional variables: P, Q, R, S,... New Propositions from old: calculus of propositions - relate new propositions to old using TRUTH TABLES logical operators: unary, binary Unary Negation not Symbol: Prepared by: David F. McAllister TP 1 1999, 2007 McGraw-Hill

P: I am going to town P: I am not going to town; It is not the case that I am going to town; I ain t goin. P P F (0) T (1) T (1) F (0) _ Binary Conjunction and Symbol: P - I am going to town Q - It is going to rain Prepared by: David F. McAllister TP 2 1999, 2007 McGraw-Hill

P Q: I am going to town and it is going to rain. P Q P Q 0 0 0 0 1 0 1 0 0 1 1 1 Note: Both P and Q must be true!!!!! Disjunction inclusive or Symbol: P - I am going to town Q - It is going to rain P Q: I am going to town or it is going to rain. Prepared by: David F. McAllister TP 3 1999, 2007 McGraw-Hill

P Q P Q 0 0 0 0 1 1 1 0 1 1 1 1 Note: Only one of P, Q need be true. Hence, the inclusive nature. Exclusive OR Symbol: _ P - I am going to town Q - It is going to rain P Q: Either I am going to town or it is going to rain. Prepared by: David F. McAllister TP 4 1999, 2007 McGraw-Hill

P Q P Q 0 0 0 0 1 1 1 0 1 1 1 0 Note: Only one of P and Q must be true. Implication If...then... Symbol: P - I am going to town Q - It is going to rain P Q: If I am going to town then it is going to rain. Prepared by: David F. McAllister TP 5 1999, 2007 McGraw-Hill

Equivalent forms: P Q P Q 0 0 1 0 1 1 1 0 0 1 1 1 If P, then Q P implies Q If P, Q P only if Q P is a sufficient condition for Q Q if P Q whenever P Q is a necessary condition for P Note: The implication is false only when P is true and Q is false! There is no causality implied here! If the moon is made of green cheese then I have more money than Bill Gates (T) If the moon is made of green cheese then I m on welfare (T) If 1+1=3 then your grandma wears combat boots (T) Prepared by: David F. McAllister TP 6 1999, 2007 McGraw-Hill

If I m wealthy then the moon is not made of green cheese. (T) If I m not wealthy then the moon is not made of green cheese. (T) Terminology: P = premise, hypothesis, antecedent Q = conclusion, consequence More terminology: Q P is the CONVERSE of P Q Q P is the CONTRAPOSITIVE of P Q Find the converse and contrapositive of the following statement: R: Raining tomorrow is a sufficient condition for my not going to town. Step 1: Assign propositional variables to component propositions P: It will rain tomorrow Q: I will not go to town Prepared by: David F. McAllister TP 7 1999, 2007 McGraw-Hill

Step 2: Symbolize the assertion R: P Q Step 3: Symbolize the converse Q P Step 4: Convert the symbols back into words If I don t go to town then it will rain tomorrow or Raining tomorrow is a necessary condition for my not going to town. or My not going to town is a sufficient condition for it raining tomorrow. Biconditional if and only if, iff Symbol: P - I am going to town, Q - It is going to rain P Q: I am going to town if and only if it is going to rain. Prepared by: David F. McAllister TP 8 1999, 2007 McGraw-Hill

P Q P Q 0 0 1 0 1 0 1 0 0 1 1 1 Note: Both P and Q must have the same truth value. Others: NAND ( ) Sheffer Stroke; NOR ( ) Peirce Arrow (see problems) Breaking assertions into component propositions - look for the logical operators! If I go to Harry s or go to the country I will not go shopping. P: I go to Harry s Q: I go to the country R: I will go shopping If...P...or...Q...then...not...R Prepared by: David F. McAllister TP 9 1999, 2007 McGraw-Hill

Constructing a truth table: (P Q) R - one column for each propositional variable - one for the compound proposition - count in binary - n propositional variables = 2 n rows You may find it easier to include columns for propositions which themselves are component propositions. Prepared by: David F. McAllister TP 10 1999, 2007 McGraw-Hill

P Q R (P Q) R 0 0 0 1 0 0 1 1 0 1 0 1 0 1 1 0 1 0 0 1 1 0 1 0 1 1 0 1 1 1 1 0 Question: _ How many different propositions can be constructed from n propositional variables? Prepared by: David F. McAllister TP 11 1999, 2007 McGraw-Hill