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

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

Discrete Mathematics

Compound Propositions

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

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

CSC Discrete Math I, Spring Propositional Logic

Today s Topic: Propositional Logic

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

AMTH140 Lecture 8. Symbolic Logic

Discrete Structures for Computer Science

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

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

PROPOSITIONAL CALCULUS

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

EECS 1028 M: Discrete Mathematics for Engineers

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

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

DISCRETE STRUCTURES WEEK5 LECTURE1

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

Discrete Mathematical Structures. Chapter 1 The Foundation: Logic

Proofs. Joe Patten August 10, 2018

TRUTH TABLES LOGIC (CONTINUED) Philosophical Methods

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

Intro to Logic and Proofs

Boolean Logic. CS 231 Dianna Xu

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

Lecture 02: Propositional Logic

Introduction. Applications of discrete mathematics:

Basic Logic and Proof Techniques

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

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

1.1 Language and Logic

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

Propositional Logic 1

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

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

CSE 20 DISCRETE MATH. Fall

Steinhardt School of Culture, Education, and Human Development Department of Teaching and Learning. Mathematical Proof and Proving (MPP)

The following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof

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

We last time we began introducing equivalency laws.

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

1.1 Language and Logic

Recall that the expression x > 3 is not a proposition. Why?

ECOM Discrete Mathematics

Connectives Name Symbol OR Disjunction And Conjunction If then Implication/ conditional If and only if Bi-implication / biconditional

Introduction Propositional Logic

DERIVATIONS AND TRUTH TABLES

Solutions to Homework I (1.1)

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

Introduction Propositional Logic. Discrete Mathematics Andrei Bulatov

Chapter 1, Section 1.1 Propositional Logic

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

software design & management Gachon University Chulyun Kim

Logic, Sets, and Proofs

Homework 4 Solutions

Section 3.1. Statements and Logical Connectives. Copyright 2013, 2010, 2007, Pearson, Education, Inc.

DISCRETE MATHEMATICS BA202

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

CSE 20: Discrete Mathematics

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

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

The statement calculus and logic

Mathematical Reasoning (Part I) 1

2.2: Logical Equivalence: The Laws of Logic

Section L.1- Introduction to 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.

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

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

Propositional Equivalence

Discrete Mathematics and Its Applications

Why Learning Logic? Logic. Propositional Logic. Compound Propositions

Section A (not in the text) Which of the following are statements? Explain. 3. The President of the United States in 2089 will be a woman.

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

COT 2104 Homework Assignment 1 (Answers)

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 =

1 The Foundation: Logic and Proofs

3.2: Compound Statements and Connective Notes

Elementary Logic and Proof

Mat 243 Exam 1 Review

Statements and Quantifiers

Chapter 4, Logic using Propositional Calculus Handout

Logic. Logic is a discipline that studies the principles and methods used in correct reasoning. It includes:

ANALYSIS EXERCISE 1 SOLUTIONS

1 The Foundation: Logic and Proofs

Section 1.3. Let I be a set. When I is used in the following context,

1.1 Statements and Compound Statements

DeMorgan s Laws and the Biconditional. Philosophy and Logic Sections 2.3, 2.4 ( Some difficult combinations )

- 1.2 Implication P. Danziger. Implication

Definition 2. Conjunction of p and q

STRATEGIES OF PROBLEM SOLVING

AN INTRODUCTION TO MATHEMATICAL PROOFS NOTES FOR MATH Jimmy T. Arnold

Packet #1: Logic & Proofs. Applied Discrete Mathematics

Equivalence and Implication

Tools for reasoning: Logic. Ch. 1: Introduction to Propositional Logic Truth values, truth tables Boolean logic: Implications:

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

CSE 240 Logic and Discrete Mathematics

15414/614 Optional Lecture 1: Propositional Logic

Math.3336: Discrete Mathematics. Applications of Propositional Logic

ARTIFICIAL INTELLIGENCE

Transcription:

Logic Logic 1 Def. A Proposition is a statement that is either true or false. Examples: Which of the following are propositions? Statement Proposition (yes or no) If yes, then determine if it is true or false. UHD has a brick exterior 1 + 3 = 0 2 + 3 x + 7 = 18 x+7=18 for x = 9 x+7=18 for every real number x Notation: We use lower case letters to denote propositions. Def. Compound propositions are new propositions formed from existing propositions using logical operators. Note: We will discuss the following logical operators (also called connectives) - Negation operator, (Other books use ~ ) - Conjunction operator, - Disjunction operator, - Exclusive or, - Implication, - Biconditional, Def. Let p be a proposition. The statement " it is not the case that p" is a proposition formed from p and the negation operator, called the negation of p, which we denote by p. This proposition is read as "not p". The truthvalue of p is true when p is false and false when p is true. p p

Examples: 1. Let p be the statement "7 + 1 = 6". a. Write the statement p as an English statement. Logic 2 b. What is the truth-value of p? 2. Let p be the statement "Bill Clinton was the president of the U.S in 2006". a. Write the statement p as an English statement. b. What is the truth-value of p? Def. Let p and q be propositions. The statement "p and q" is a proposition formed from p, q and the conjunction operator, called the conjunction of p and q, which we denote by p q. The truth-value of p q is true when both p and q are true, otherwise p q is false. p q p q Def. Let p and q be propositions. The statement "p or q" is a proposition formed from p, q and the disjunction operator, called the disjunction of p and q, which we denote by p q. The truth-value of p q is false when both p and q are false, otherwise p q is true. p q p q Examples: Let p be the statement "Houston is the capital of Texas" and let q be the statement "Houston is a city in Texas". Determine the following: a. The truth-value for p q. b. The truth-value for p q. c. The truth value for p q d. The truth value for (p q) e. The truth value for p q

Logic 3 Def. Let p and q be propositions. The statement "p or q exclusively" is a proposition formed from p, q and the exclusive or operator, called the exclusive or of p and q, which we denote by p q. The truth-value of p q is true when exactly one of p or q is true, otherwise p q is false. p q p q Comparison: A familiar example of the use of an "exclusive or" is a restaurant menu. "Price of the entree includes soup or salad". Note that one or the other is included in the price but not both. A familiar example of the use of inclusive or is the prerequisite for this course. "Students who have taken calculus or computer science, can take this course." Note that if a student has taken both courses, then the student may still take this course. Def. An implication (or conditional statement) is statement of the form "if p then q", denoted p q. Such propositions are also read as "p implies q". The "if part" is called the hypothesis (or premise), and the "then part" is called the conclusion (or consequence). The implication if p then q is false only when the hypothesis is true and the conclusion is false. p q p q Terminology: An implication p q may be worded in several different ways: If p, then q If p, q q if p p only if q p is sufficient for q q is necessary for p

Examples: a. True or False : If 2 is an even integer, then today is Friday. Logic 4 b. Write the statement in the form if p, then q and determine the truthvalue. 1 + 1 =2 if 3 + 3 =7. c. Write the statement in the form if p, then q and determine the truthvalue. 1 + 1 = 2 only if 3 + 3 = 7. Def. Given the implication p q: q p is the converse of the implication p q. p q is the inverse of implication p q. q p is the contrapositive of implication p q. Example: Write the converse, the inverse, and the contrapositive of the given implication: If cows eat grass, then 2 + 3 = 4. Proposition True or False? Converse True or False? Inverse True or False? Contrapositive True or False? Def. The biconditional proposition denoted by p q is the conjunction of p q and q p. The proposition p q is read as p if and only if q. The biconditional proposition is true when both p and q have the same truthvalues and is false otherwise. p q p q Examples: Determine the truth-values for the following: a. The number 2 is an odd integer if and only if today is Friday. b. If 3 + 3 = 7, 1 + 1 = 2 and conversely if 1 + 1 = 2, 3 + 3 = 7.

Logic 5 Exercise. Let p and q be the propositions p: It is below freezing. q: It is snowing Write the following propositions using the symbols p and q and any appropriate logical connectives. Use the following (a) (d) to fill in the blank for i) and ii) (a) p q (b) p q (c) p q (d) q p (e) none of these i) It is below freezing and snowing. ii) It is below freezing if it is snowing Use the following (a) (d) to fill in the blank for iii) - vi) (a) p q (b) p q (c) p q (d) none of these iii) It is not below freezing and it is not snowing. iv) It is either below freezing or snowing (or both). v) It is either below freezing or snowing (but not both). vi) It is below freezing if and only if it is snowing. Exercise Construct a truth table for each of the following compound propositions. Note: your truth-table will require 2 n rows, where n is the number of simple propositions in the compound proposition. a) ( p q) q b) ( p q) r