Conditional Statements

Size: px
Start display at page:

Download "Conditional Statements"

Transcription

1 Conditional Statements Lecture 3 Section 2.2 Robb T. Koether Hampden-Sydney College Fri, Jan 17, 2014 Robb T. Koether (Hampden-Sydney College) Conditional Statements Fri, Jan 17, / 26

2 1 Conditional Statements 2 The Contrapositive 3 Other Operators The Biconditional The Exclusive-Or The NAND Operator The NOR Operator 4 Assignment Robb T. Koether (Hampden-Sydney College) Conditional Statements Fri, Jan 17, / 26

3 Outline 1 Conditional Statements 2 The Contrapositive 3 Other Operators The Biconditional The Exclusive-Or The NAND Operator The NOR Operator 4 Assignment Robb T. Koether (Hampden-Sydney College) Conditional Statements Fri, Jan 17, / 26

4 Conditional Statements A conditional statement is a statement of the form p q. p is the hypothesis. q is the conclusion. Read p q as p implies q or if p, then q. The idea is that the truth of p implies the truth of q (but nothing more). Robb T. Koether (Hampden-Sydney College) Conditional Statements Fri, Jan 17, / 26

5 Example: Conditional Statements Which of the following scenarios are consistent with the statement If I win the lottery, then I will buy a Mercedes Benz. Robb T. Koether (Hampden-Sydney College) Conditional Statements Fri, Jan 17, / 26

6 Example: Conditional Statements Which of the following scenarios are consistent with the statement If I win the lottery, then I will buy a Mercedes Benz. Scenario 1: I win the lottery and I buy a Mercedes Benz. Robb T. Koether (Hampden-Sydney College) Conditional Statements Fri, Jan 17, / 26

7 Example: Conditional Statements Which of the following scenarios are consistent with the statement If I win the lottery, then I will buy a Mercedes Benz. Scenario 1: I win the lottery and I buy a Mercedes Benz. Scenario 2: I win the lottery and I do not buy a Mercedes Benz. Robb T. Koether (Hampden-Sydney College) Conditional Statements Fri, Jan 17, / 26

8 Example: Conditional Statements Which of the following scenarios are consistent with the statement If I win the lottery, then I will buy a Mercedes Benz. Scenario 1: I win the lottery and I buy a Mercedes Benz. Scenario 2: I win the lottery and I do not buy a Mercedes Benz. Scenario 3: I do not win the lottery and I do not buy a Mercedes Benz. Robb T. Koether (Hampden-Sydney College) Conditional Statements Fri, Jan 17, / 26

9 Example: Conditional Statements Which of the following scenarios are consistent with the statement If I win the lottery, then I will buy a Mercedes Benz. Scenario 1: I win the lottery and I buy a Mercedes Benz. Scenario 2: I win the lottery and I do not buy a Mercedes Benz. Scenario 3: I do not win the lottery and I do not buy a Mercedes Benz. Scenario 4: I do not win the lottery and I buy a Mercedes Benz. Robb T. Koether (Hampden-Sydney College) Conditional Statements Fri, Jan 17, / 26

10 Truth Table for the Conditional p q p q T T T T F F F T T F F T p q is true if p is false or q is true. p q is false if p is true and q is false. Thus, p q is logically equivalent to p q. Robb T. Koether (Hampden-Sydney College) Conditional Statements Fri, Jan 17, / 26

11 Outline 1 Conditional Statements 2 The Contrapositive 3 Other Operators The Biconditional The Exclusive-Or The NAND Operator The NOR Operator 4 Assignment Robb T. Koether (Hampden-Sydney College) Conditional Statements Fri, Jan 17, / 26

12 The Contrapositive The contrapositive of p q is q p. The statements p q and q p are logically equivalent. (Prove it!) Robb T. Koether (Hampden-Sydney College) Conditional Statements Fri, Jan 17, / 26

13 The Converse and the Inverse p q q p p q q p Four conditionals. Robb T. Koether (Hampden-Sydney College) Conditional Statements Fri, Jan 17, / 26

14 The Converse and the Inverse p q Converses q p p q Converses q p The converse of p q is q p Robb T. Koether (Hampden-Sydney College) Conditional Statements Fri, Jan 17, / 26

15 The Converse and the Inverse p q q p Inverses Inverses p q q p The inverse of p q is p q Robb T. Koether (Hampden-Sydney College) Conditional Statements Fri, Jan 17, / 26

16 The Converse and the Inverse p q q p Contrapositives p q q p The contrapositive of p q is q p Robb T. Koether (Hampden-Sydney College) Conditional Statements Fri, Jan 17, / 26

17 Outline 1 Conditional Statements 2 The Contrapositive 3 Other Operators The Biconditional The Exclusive-Or The NAND Operator The NOR Operator 4 Assignment Robb T. Koether (Hampden-Sydney College) Conditional Statements Fri, Jan 17, / 26

18 Outline 1 Conditional Statements 2 The Contrapositive 3 Other Operators The Biconditional The Exclusive-Or The NAND Operator The NOR Operator 4 Assignment Robb T. Koether (Hampden-Sydney College) Conditional Statements Fri, Jan 17, / 26

19 The Biconditional The biconditional of p and q is denoted p q. Read p q as p if and only if q. p q is logically equivalent to (p q) (q p). It is also logically equivalent to ( p q) ( q p) and (p q) ( p q). Robb T. Koether (Hampden-Sydney College) Conditional Statements Fri, Jan 17, / 26

20 The Biconditional p q p q T T T T F F F T F F F T Robb T. Koether (Hampden-Sydney College) Conditional Statements Fri, Jan 17, / 26

21 Outline 1 Conditional Statements 2 The Contrapositive 3 Other Operators The Biconditional The Exclusive-Or The NAND Operator The NOR Operator 4 Assignment Robb T. Koether (Hampden-Sydney College) Conditional Statements Fri, Jan 17, / 26

22 Exclusive-Or The exclusive-or of p and q is denoted p q. p q means one or the other, but not both. p q is logically equivalent to (p q) (p q) and and (p q) ( p q) (p q). Robb T. Koether (Hampden-Sydney College) Conditional Statements Fri, Jan 17, / 26

23 Exclusive-Or p q p q T T F T F T F T T F F F Robb T. Koether (Hampden-Sydney College) Conditional Statements Fri, Jan 17, / 26

24 Outline 1 Conditional Statements 2 The Contrapositive 3 Other Operators The Biconditional The Exclusive-Or The NAND Operator The NOR Operator 4 Assignment Robb T. Koether (Hampden-Sydney College) Conditional Statements Fri, Jan 17, / 26

25 The NAND Operator p q p q T T F T F T F T T F F T The NAND of p and q is denoted p q. The operator is also called the Scheffer stroke. Robb T. Koether (Hampden-Sydney College) Conditional Statements Fri, Jan 17, / 26

26 The NAND Operator The statement p q means not both p and q. p q is logically equivalent to (p q). Robb T. Koether (Hampden-Sydney College) Conditional Statements Fri, Jan 17, / 26

27 The NAND Operator The three basic operators (and, or, not) may be defined in terms of NAND. p p p. p q (p q) (p q). p q (p p) (q q). Prove it! Robb T. Koether (Hampden-Sydney College) Conditional Statements Fri, Jan 17, / 26

28 Outline 1 Conditional Statements 2 The Contrapositive 3 Other Operators The Biconditional The Exclusive-Or The NAND Operator The NOR Operator 4 Assignment Robb T. Koether (Hampden-Sydney College) Conditional Statements Fri, Jan 17, / 26

29 The NOR Operator p q p q T T F T F F F T F F F T The NOR of p and q is denoted p q. The operator is also called the Pierce arrow. Robb T. Koether (Hampden-Sydney College) Conditional Statements Fri, Jan 17, / 26

30 The NOR Operator The statement p q means neither p nor q. p q is logically equivalent to (p q). Robb T. Koether (Hampden-Sydney College) Conditional Statements Fri, Jan 17, / 26

31 The NOR Operator The three basic operators (and, or, not) may be defined in terms of NOR. p p p. p q (p q) (p q). p q (p p) (q q). Prove it! Robb T. Koether (Hampden-Sydney College) Conditional Statements Fri, Jan 17, / 26

32 Outline 1 Conditional Statements 2 The Contrapositive 3 Other Operators The Biconditional The Exclusive-Or The NAND Operator The NOR Operator 4 Assignment Robb T. Koether (Hampden-Sydney College) Conditional Statements Fri, Jan 17, / 26

33 Assignment Assignment Read Section 2.2, pages Exercises 2, 5, 6, 12, 13, 17, 18, 37, 41, 42, 46, page 49. Robb T. Koether (Hampden-Sydney College) Conditional Statements Fri, Jan 17, / 26

Direct Proof Divisibility

Direct Proof Divisibility Direct Proof Divisibility Lecture 15 Section 4.3 Robb T. Koether Hampden-Sydney College Fri, Feb 8, 2013 Robb T. Koether (Hampden-Sydney College) Direct Proof Divisibility Fri, Feb 8, 2013 1 / 20 1 Divisibility

More information

Direct Proof Divisibility

Direct Proof Divisibility Direct Proof Divisibility Lecture 15 Section 4.3 Robb T. Koether Hampden-Sydney College Fri, Feb 7, 2014 Robb T. Koether (Hampden-Sydney College) Direct Proof Divisibility Fri, Feb 7, 2014 1 / 23 1 Divisibility

More information

Predicates and Quantifiers

Predicates and Quantifiers Predicates and Quantifiers Lecture 9 Section 3.1 Robb T. Koether Hampden-Sydney College Wed, Jan 29, 2014 Robb T. Koether (Hampden-Sydney College) Predicates and Quantifiers Wed, Jan 29, 2014 1 / 32 1

More information

Direct Proof Universal Statements

Direct Proof Universal Statements Direct Proof Universal Statements Lecture 13 Section 4.1 Robb T. Koether Hampden-Sydney College Wed, Feb 6, 2013 Robb T. Koether (Hampden-Sydney College) Direct Proof Universal Statements Wed, Feb 6, 2013

More information

Composition of Functions

Composition of Functions Composition of Functions Lecture 34 Section 7.3 Robb T. Koether Hampden-Sydney College Mon, Mar 25, 2013 Robb T. Koether (Hampden-Sydney College) Composition of Functions Mon, Mar 25, 2013 1 / 29 1 Composition

More information

Negations of Quantifiers

Negations of Quantifiers Negations of Quantifiers Lecture 10 Section 3.2 Robb T. Koether Hampden-Sydney College Thu, Jan 31, 2013 Robb T. Koether (Hampden-Sydney College) Negations of Quantifiers Thu, Jan 31, 2013 1 / 20 1 Negations

More information

Elementary Logic and Proof

Elementary Logic and Proof Elementary Logic and Proof Lecture 5 Robb T. Koether Hampden-Sydney College Mon, Feb 6, 2017 Robb T. Koether (Hampden-Sydney College) Elementary Logic and Proof Mon, Feb 6, 2017 1 / 33 Outline 1 Statements

More information

Direct Proof Division into Cases

Direct Proof Division into Cases Direct Proof Division into Cases Lecture 16 Section 4.4 Robb T. Koether Hampden-Sydney College Mon, Feb 10, 2014 Robb T. Koether (Hampden-Sydney College) Direct Proof Division into Cases Mon, Feb 10, 2014

More information

Direct Proof Floor and Ceiling

Direct Proof Floor and Ceiling Direct Proof Floor and Ceiling Lecture 17 Section 4.5 Robb T. Koether Hampden-Sydney College Wed, Feb 12, 2014 Robb T. Koether (Hampden-Sydney College) Direct Proof Floor and Ceiling Wed, Feb 12, 2014

More information

The Pairwise-Comparison Method

The Pairwise-Comparison Method The Pairwise-Comparison Method Lecture 12 Section 1.5 Robb T. Koether Hampden-Sydney College Mon, Sep 19, 2016 Robb T. Koether (Hampden-Sydney College) The Pairwise-Comparison Method Mon, Sep 19, 2016

More information

Maximums and Minimums

Maximums and Minimums Maximums and Minimums Lecture 25 Section 3.1 Robb T. Koether Hampden-Sydney College Mon, Mar 6, 2017 Robb T. Koether (Hampden-Sydney College) Maximums and Minimums Mon, Mar 6, 2017 1 / 9 Objectives Objectives

More information

Paired Samples. Lecture 37 Sections 11.1, 11.2, Robb T. Koether. Hampden-Sydney College. Mon, Apr 2, 2012

Paired Samples. Lecture 37 Sections 11.1, 11.2, Robb T. Koether. Hampden-Sydney College. Mon, Apr 2, 2012 Paired Samples Lecture 37 Sections 11.1, 11.2, 11.3 Robb T. Koether Hampden-Sydney College Mon, Apr 2, 2012 Robb T. Koether (Hampden-Sydney College) Paired Samples Mon, Apr 2, 2012 1 / 17 Outline 1 Dependent

More information

Confidence Intervals for Proportions Sections 22.2, 22.3

Confidence Intervals for Proportions Sections 22.2, 22.3 Confidence Intervals for Proportions Sections 22.2, 22.3 Lecture 41 Robb T. Koether Hampden-Sydney College Mon, Apr 4, 2016 Robb T. Koether (Hampden-Sydney College)Confidence Intervals for ProportionsSections

More information

Compound Interest. Lecture 34 Section 4.1. Robb T. Koether. Hampden-Sydney College. Tue, Mar 28, 2017

Compound Interest. Lecture 34 Section 4.1. Robb T. Koether. Hampden-Sydney College. Tue, Mar 28, 2017 Compound Interest Lecture 34 Section 4.1 Robb T. Koether Hampden-Sydney College Tue, Mar 28, 2017 Robb T. Koether (Hampden-Sydney College) Compound Interest Tue, Mar 28, 2017 1 / 8 Reminder Reminder Test

More information

Direct Proof Rational Numbers

Direct Proof Rational Numbers Direct Proof Rational Numbers Lecture 14 Section 4.2 Robb T. Koether Hampden-Sydney College Thu, Feb 7, 2013 Robb T. Koether (Hampden-Sydney College) Direct Proof Rational Numbers Thu, Feb 7, 2013 1 /

More information

Instantaneous Rate of Change

Instantaneous Rate of Change Instantaneous Rate of Change Lecture 13 Section 2.1 Robb T. Koether Hampden-Sydney College Wed, Feb 8, 2017 Robb T. Koether (Hampden-Sydney College) Instantaneous Rate of Change Wed, Feb 8, 2017 1 / 11

More information

Independent Samples: Comparing Means

Independent Samples: Comparing Means Independent Samples: Comparing Means Lecture 38 Section 11.4 Robb T. Koether Hampden-Sydney College Fri, Nov 4, 2011 Robb T. Koether (Hampden-Sydney College) Independent Samples:Comparing Means Fri, Nov

More information

Nondeterministic Finite Automata

Nondeterministic Finite Automata Nondeterministic Finite Automata Lecture 6 Section 2.2 Robb T. Koether Hampden-Sydney College Mon, Sep 5, 2016 Robb T. Koether (Hampden-Sydney College) Nondeterministic Finite Automata Mon, Sep 5, 2016

More information

Sampling Distribution of a Sample Proportion

Sampling Distribution of a Sample Proportion Sampling Distribution of a Sample Proportion Lecture 26 Section 8.4 Robb T. Koether Hampden-Sydney College Mon, Mar 1, 2010 Robb T. Koether (Hampden-Sydney College) Sampling Distribution of a Sample Proportion

More information

Strong Mathematical Induction

Strong Mathematical Induction Strong Mathematical Induction Lecture 23 Section 5.4 Robb T. Koether Hampden-Sydney College Mon, Feb 24, 2014 Robb T. Koether (Hampden-Sydney College) Strong Mathematical Induction Mon, Feb 24, 2014 1

More information

Closure Properties of Regular Languages

Closure Properties of Regular Languages Closure Properties of Regular Languages Lecture 13 Section 4.1 Robb T. Koether Hampden-Sydney College Wed, Sep 21, 2016 Robb T. Koether (Hampden-Sydney College) Closure Properties of Regular Languages

More information

CSC Discrete Math I, Spring Propositional Logic

CSC Discrete Math I, Spring Propositional Logic CSC 125 - Discrete Math I, Spring 2017 Propositional Logic Propositions A proposition is a declarative sentence that is either true or false Propositional Variables A propositional variable (p, q, r, s,...)

More information

Sampling Distribution of a Sample Proportion

Sampling Distribution of a Sample Proportion Sampling Distribution of a Sample Proportion Lecture 26 Section 8.4 Robb T. Koether Hampden-Sydney College Mon, Oct 10, 2011 Robb T. Koether (Hampden-Sydney College) Sampling Distribution of a Sample Proportion

More information

The Interpretation of λ

The Interpretation of λ The Interpretation of λ Lecture 49 Section 7.5 Robb T. Koether Hampden-Sydney College Wed, Apr 26, 2017 Robb T. Koether (Hampden-Sydney College) The Interpretation of λ Wed, Apr 26, 2017 1 / 6 Objectives

More information

Vector Operations. Lecture 19. Robb T. Koether. Hampden-Sydney College. Wed, Oct 7, 2015

Vector Operations. Lecture 19. Robb T. Koether. Hampden-Sydney College. Wed, Oct 7, 2015 Vector Operations Lecture 19 Robb T. Koether Hampden-Sydney College Wed, Oct 7, 2015 Robb T. Koether (Hampden-Sydney College) Vector Operations Wed, Oct 7, 2015 1 / 23 Outline 1 Magnitude 2 Dot Product

More information

Binary Search Trees. Lecture 29 Section Robb T. Koether. Hampden-Sydney College. Fri, Apr 8, 2016

Binary Search Trees. Lecture 29 Section Robb T. Koether. Hampden-Sydney College. Fri, Apr 8, 2016 Binary Search Trees Lecture 29 Section 19.2 Robb T. Koether Hampden-Sydney College Fri, Apr 8, 2016 Robb T. Koether (Hampden-Sydney College) Binary Search Trees Fri, Apr 8, 2016 1 / 40 1 Binary Search

More information

The Cobb-Douglas Production Functions

The Cobb-Douglas Production Functions The Cobb-Douglas Production Functions Lecture 40 Section 7.1 Robb T. Koether Hampden-Sydney College Mon, Apr 10, 2017 Robb T. Koether (Hampden-Sydney College) The Cobb-Douglas Production Functions Mon,

More information

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS 1.1 - Logical Form and Logical Equivalence Definition. A statement or proposition is a sentence that is either true or false, but not both. ex. 1 + 2 = 3 IS a statement

More information

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

A statement is a sentence that is definitely either true or false but not both. 5 Logic In this part of the course we consider logic. Logic is used in many places in computer science including digital circuit design, relational databases, automata theory and computability, and artificial

More information

Mathematics 220 Homework 4 - Solutions. Solution: We must prove the two statements: (1) if A = B, then A B = A B, and (2) if A B = A B, then A = B.

Mathematics 220 Homework 4 - Solutions. Solution: We must prove the two statements: (1) if A = B, then A B = A B, and (2) if A B = A B, then A = B. 1. (4.46) Let A and B be sets. Prove that A B = A B if and only if A = B. Solution: We must prove the two statements: (1) if A = B, then A B = A B, and (2) if A B = A B, then A = B. Proof of (1): Suppose

More information

AMTH140 Lecture 8. Symbolic Logic

AMTH140 Lecture 8. Symbolic Logic AMTH140 Lecture 8 Slide 1 Symbolic Logic March 10, 2006 Reading: Lecture Notes 6.2, 6.3; Epp 1.1, 1.2 Logical Connectives Let p and q denote propositions, then: 1. p q is conjunction of p and q, meaning

More information

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

Section 1.1 Propositional Logic. proposition : true = T (or 1) or false = F (or 0) (binary logic) the moon is made of green cheese 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

More information

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.

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. LOGIC In mathematical and everyday English language, we frequently use logic to express our thoughts verbally and in writing. We also use logic in numerous other areas such as computer coding, probability,

More information

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

Lecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook) Lecture 2 Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits Reading (Epp s textbook) 2.1-2.4 1 Logic Logic is a system based on statements. A statement (or

More information

PROPOSITIONAL CALCULUS

PROPOSITIONAL CALCULUS PROPOSITIONAL CALCULUS A proposition is a complete declarative sentence that is either TRUE (truth value T or 1) or FALSE (truth value F or 0), but not both. These are not propositions! Connectives and

More information

Propositional Logic Introduction and Basics. 2.2 Conditional Statements. 2.3 Inferencing. mjarrar 2015

Propositional Logic Introduction and Basics. 2.2 Conditional Statements. 2.3 Inferencing. mjarrar 2015 9/18/17 Mustafa Jarrar: Lecture Notes in Discrete Mathematics. Birzeit University Palestine 2017 Propositional Logic 2.1. Introduction and Basics 2.2 Conditional Statements 2.3 Inferencing mjarrar 2015

More information

Compound Propositions

Compound Propositions Discrete Structures Compound Propositions Producing new propositions from existing propositions. Logical Operators or Connectives 1. Not 2. And 3. Or 4. Exclusive or 5. Implication 6. Biconditional Truth

More information

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

Propositional Calculus. Problems. Propositional Calculus 3&4. 1&2 Propositional Calculus. Johnson will leave the cabinet, and we ll lose the election. 1&2 Propositional Calculus Propositional Calculus Problems Jim Woodcock University of York October 2008 1. Let p be it s cold and let q be it s raining. Give a simple verbal sentence which describes each

More information

Introduction. Applications of discrete mathematics:

Introduction. Applications of discrete mathematics: Introduction Applications of discrete mathematics: Formal Languages (computer languages) Compiler Design Data Structures Computability Automata Theory Algorithm Design Relational Database Theory Complexity

More information

CSCI Homework Set 1 Due: September 11, 2018 at the beginning of class

CSCI Homework Set 1 Due: September 11, 2018 at the beginning of class CSCI 3310 - Homework Set 1 Due: September 11, 2018 at the beginning of class ANSWERS Please write your name and student ID number clearly at the top of your homework. If you have multiple pages, please

More information

Lecture 02: Propositional Logic

Lecture 02: Propositional Logic Lecture 02: Propositional Logic CSCI 358 Discrete Mathematics, Spring 2016 Hua Wang, Ph.D. Department of Electrical Engineering and Computer Science January 19, 2015 Propositional logic Propositional logic

More information

a. See the textbook for examples of proving logical equivalence using truth tables. b. There is a real number x for which f (x) < 0. (x 1) 2 > 0.

a. See the textbook for examples of proving logical equivalence using truth tables. b. There is a real number x for which f (x) < 0. (x 1) 2 > 0. For some problems, several sample proofs are given here. Problem 1. a. See the textbook for examples of proving logical equivalence using truth tables. b. There is a real number x for which f (x) < 0.

More information

2 Truth Tables, Equivalences and the Contrapositive

2 Truth Tables, Equivalences and the Contrapositive 2 Truth Tables, Equivalences and the Contrapositive 12 2 Truth Tables, Equivalences and the Contrapositive 2.1 Truth Tables In a mathematical system, true and false statements are the statements of the

More information

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

Logic. Def. A Proposition is a statement that is either true or false. 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

More information

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

Chapter 1: The Logic of Compound Statements. January 7, 2008 Chapter 1: The Logic of Compound Statements January 7, 2008 Outline 1 1.1 Logical Form and Logical Equivalence 2 1.2 Conditional Statements 3 1.3 Valid and Invalid Arguments Central notion of deductive

More information

5. Use a truth table to determine whether the two statements are equivalent. Let t be a tautology and c be a contradiction.

5. Use a truth table to determine whether the two statements are equivalent. Let t be a tautology and c be a contradiction. Statements Compounds and Truth Tables. Statements, Negations, Compounds, Conjunctions, Disjunctions, Truth Tables, Logical Equivalence, De Morgan s Law, Tautology, Contradictions, Proofs with Logical Equivalent

More information

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

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 Geometry Week 9 Sec 5.3 and 5.4 section 5.3 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 T F p F

More information

Lecture : Set Theory and Logic

Lecture : Set Theory and Logic Lecture : Dr. Department of Mathematics Lovely Professional University Punjab, India October 18, 2014 Outline Contrapositive and Converse 1 Contrapositive and Converse 2 3 4 5 Contrapositive and Converse

More information

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

The following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof Ch. 1.6 Introduction to Proofs The following techniques for methods of proofs are discussed in our text - Vacuous proof - Trivial proof - Direct proof - Indirect proof (our book calls this by contraposition)

More information

ANALYSIS EXERCISE 1 SOLUTIONS

ANALYSIS EXERCISE 1 SOLUTIONS ANALYSIS EXERCISE 1 SOLUTIONS 1. (a) Let B The main course will be beef. F The main course will be fish. P The vegetable will be peas. C The vegetable will be corn. The logical form of the argument is

More information

Propositional Equivalence

Propositional Equivalence Propositional Equivalence Tautologies and contradictions A compound proposition that is always true, regardless of the truth values of the individual propositions involved, is called a tautology. Example:

More information

Computer Science 280 Spring 2002 Homework 2 Solutions by Omar Nayeem

Computer Science 280 Spring 2002 Homework 2 Solutions by Omar Nayeem Computer Science 280 Spring 2002 Homework 2 Solutions by Omar Nayeem Part A 1. (a) Some dog does not have his day. (b) Some action has no equal and opposite reaction. (c) Some golfer will never be eated

More information

Geometry: Notes

Geometry: Notes Geometry: 2.1-2.3 Notes NAME 2.1 Be able to write all types of conditional statements. Date: Define Vocabulary: conditional statement if-then form hypothesis conclusion negation converse inverse contrapositive

More information

CSE 311: Foundations of Computing. Lecture 3: Digital Circuits & Equivalence

CSE 311: Foundations of Computing. Lecture 3: Digital Circuits & Equivalence CSE 311: Foundations of Computing Lecture 3: Digital Circuits & Equivalence Homework #1 You should have received An e-mail from [cse311a/cse311b] with information pointing you to look at Canvas to submit

More information

Proportion. Lecture 25 Sections Fri, Oct 10, Hampden-Sydney College. Sampling Distribution of a Sample. Proportion. Robb T.

Proportion. Lecture 25 Sections Fri, Oct 10, Hampden-Sydney College. Sampling Distribution of a Sample. Proportion. Robb T. PDFs n = s Lecture 25 Sections 8.1-8.2 Hampden-Sydney College Fri, Oct 10, 2008 Outline PDFs n = s 1 2 3 PDFs n = 4 5 s 6 7 PDFs n = s The of the In our experiment, we collected a total of 100 samples,

More information

EGC221: Digital Logic Lab

EGC221: Digital Logic Lab Division of Engineering Programs EGC221: Digital Logic Lab Experiment #1 Basic Logic Gate Simulation Student s Name: Student s Name: Reg. no.: Reg. no.: Semester: Fall 2016 Date: 07 September 2016 Assessment:

More information

software design & management Gachon University Chulyun Kim

software design & management Gachon University Chulyun Kim Gachon University Chulyun Kim 2 Outline Propositional Logic Propositional Equivalences Predicates and Quantifiers Nested Quantifiers Rules of Inference Introduction to Proofs 3 1.1 Propositional Logic

More information

Full file at

Full file at 1 Logic and Proofs 1.1 Propositions and Connectives 1. (a) true (b) false (c) true (d) false (e) false (f) false (g) false (h) false 2. (a) Not a proposition (b) False proposition (c) Not a proposition.

More information

Unit 2: Logic and Reasoning. start of unit

Unit 2: Logic and Reasoning. start of unit Unit 2: Logic and Reasoning Prior Unit: Introduction to Geometry Next Unit: Transversals By the end of this unit I will be able to: Skill Self-Rating start of unit Date(s) covered Self-Rating end of unit

More information

Discrete Mathematics and Its Applications

Discrete Mathematics and Its Applications Discrete Mathematics and Its Applications Lecture 1: Proposition logic MING GAO DASE @ ECNU (for course related communications) mgao@dase.ecnu.edu.cn Sep. 12, 2017 Outline 1 Propositions 2 Connectives

More information

EECS 1028 M: Discrete Mathematics for Engineers

EECS 1028 M: Discrete Mathematics for Engineers EECS 1028 M: Discrete Mathematics for Engineers Suprakash Datta Office: LAS 3043 Course page: http://www.eecs.yorku.ca/course/1028 Also on Moodle S. Datta (York Univ.) EECS 1028 W 18 1 / 26 Why Study Logic?

More information

DISCRETE STRUCTURES WEEK5 LECTURE1

DISCRETE STRUCTURES WEEK5 LECTURE1 DISCRETE STRUCTURES WEEK5 LECTURE1 Let s get started with... Logic! Spring 2010 CPCS 222 - Discrete Structures 2 Logic Crucial for mathematical reasoning Important for program design Used for designing

More information

FUNDAMENTALS OF MATHEMATICS HANDOUT 1.3 DR. MCLOUGHLIN

FUNDAMENTALS OF MATHEMATICS HANDOUT 1.3 DR. MCLOUGHLIN 021 McLoughlin Handout 1.3, page 1 of 6 FUNDAMENTALS OF MATHEMATICS HANDOUT 1.3 DR. MCLOUGHLIN Truth Table for Not K K T F F T Truth Table for And B M B M T F F F T F F F F Truth Table for Or R S R S T

More information

More examples of mathematical. Lecture 4 ICOM 4075

More examples of mathematical. Lecture 4 ICOM 4075 More examples of mathematical proofs Lecture 4 ICOM 4075 Proofs by construction A proof by construction is one in which anobjectthat proves the truth value of an statement is built, or found There are

More information

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

Overview. 1. Introduction to Propositional Logic. 2. Operations on Propositions. 3. Truth Tables. 4. Translating Sentences into Logical Expressions Note 01 Propositional Logic 1 / 10-1 Overview 1. Introduction to Propositional Logic 2. Operations on Propositions 3. Truth Tables 4. Translating Sentences into Logical Expressions 5. Preview: Propositional

More information

COMP Intro to Logic for Computer Scientists. Lecture 3

COMP Intro to Logic for Computer Scientists. Lecture 3 COMP 1002 Intro to Logic for Computer Scientists Lecture 3 B 5 2 J Admin stuff Make-up lecture next Monday, Jan 14 10am to 12pm in C 3033 Knights and knaves On a mystical island, there are two kinds of

More information

. T SHREE MAHAPRABHU PUBLIC SCHOOL & COLLEGE NOTES FOR BOARD EXAMINATION SUBJECT COMPUTER SCIENCE (Code: 083) Boolean Algebra

. T SHREE MAHAPRABHU PUBLIC SCHOOL & COLLEGE NOTES FOR BOARD EXAMINATION SUBJECT COMPUTER SCIENCE (Code: 083) Boolean Algebra . T SHREE MAHAPRABHU PUBLIC SCHOOL & COLLEGE NOTES FOR BOARD EXAMINATION 2016-17 SUBJECT COMPUTER SCIENCE (Code: 083) Boolean Algebra Introduction to Boolean Algebra Boolean algebra which deals with two-valued

More information

1. Propositions: Contrapositives and Converses

1. Propositions: Contrapositives and Converses Preliminaries 1 1. Propositions: Contrapositives and Converses Given two propositions P and Q, the statement If P, then Q is interpreted as the statement that if the proposition P is true, then the statement

More information

- 1.2 Implication P. Danziger. Implication

- 1.2 Implication P. Danziger. Implication Implication There is another fundamental type of connectives between statements, that of implication or more properly conditional statements. In English these are statements of the form If p then q or

More information

2 Conditional and Biconditional Propositions

2 Conditional and Biconditional Propositions 18 FUNDAMENTALS OF MATHEMATICAL LOGIC 2 Conditional and Biconditional Propositions Let p and q be propositions. The implication p! q is the proposition that is false only when p is true and q is false;

More information

Artificial Intelligence

Artificial Intelligence Artificial Intelligence Propositional Logic [1] Boolean algebras by examples U X U U = {a} U = {a, b} U = {a, b, c} {a} {b} {a, b} {a, c} {b, c}... {a} {b} {c} {a, b} {a} The arrows represents proper inclusion

More information

DERIVATIONS AND TRUTH TABLES

DERIVATIONS AND TRUTH TABLES DERIVATIONS AND TRUTH TABLES Tomoya Sato Department of Philosophy University of California, San Diego Phil120: Symbolic Logic Summer 2014 TOMOYA SATO LECTURE 3: DERIVATIONS AND TRUTH TABLES 1 / 65 WHAT

More information

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

2. The Logic of Compound Statements Summary. Aaron Tan August 2017 2. The Logic of Compound Statements Summary Aaron Tan 21 25 August 2017 1 2. The Logic of Compound Statements 2.1 Logical Form and Logical Equivalence Statements; Compound Statements; Statement Form (Propositional

More information

Lecture 45 Sections Wed, Nov 19, 2008

Lecture 45 Sections Wed, Nov 19, 2008 The Lecture 45 Sections 14.5 Hampden-Sydney College Wed, Nov 19, 2008 Outline The 1 2 3 The 4 5 The Exercise 14.20, page 949. A certain job in a car assembly plant involves a great deal of stress. A study

More information

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

Note: The area of logic that deals with propositions is called the propositional calculus or propositional logic. Ch. 1.1 Logic Logic 1 Def. A Proposition is a statement that is either true or false. Example 1: Which of the following are propositions? Statement Proposition (yes or no) UHD is a University 1 + 3 = 0

More information

Midterm: Sample 3. ECS20 (Fall 2017) 1) Using truth tables, establish for each of the two propositions below if it is a tautology, a contradiction

Midterm: Sample 3. ECS20 (Fall 2017) 1) Using truth tables, establish for each of the two propositions below if it is a tautology, a contradiction Midterm: Sample 3 ECS20 (Fall 2017) Part I: logic 1) Using truth tables, establish for each of the two propositions below if it is a tautology, a contradiction or neither. 1) [p (q r)] [((r p) q) q] Let

More information

1. Grab board/marker for your group 2. Do WarmUp below

1. Grab board/marker for your group 2. Do WarmUp below 1. Grab board/marker for your group 2. Do WarmUp below TP bisects VS and MR. VM is congruent to SR. MP = 9, VT = 6 Perimeter of MRSV = 62 V T S Find VM. M P R Paragraph Proof D (2x) x 60 A B C Given: Diagram

More information

Section 1.2: Conditional Statements

Section 1.2: Conditional Statements Section 1.2: Conditional Statements In this section, we study one of the most important tools in logic - conditional statements. Loosely speaking, conditional statements are statements of the form if p

More information

Introduction Propositional Logic. Discrete Mathematics Andrei Bulatov

Introduction Propositional Logic. Discrete Mathematics Andrei Bulatov Introduction Propositional Logic Discrete Mathematics Andrei Bulatov Discrete Mathematics Propositional Logic 2-2 What is Logic? Computer science is a mere continuation of logic by other means Georg Gottlob

More information

CS 173: Discrete Mathematical Structures, Spring 2008 Homework 1 Solutions

CS 173: Discrete Mathematical Structures, Spring 2008 Homework 1 Solutions CS 173: Discrete Mathematical Structures, Spring 2008 Homework 1 Solutions 1. [10 points] Translate the following sentences into propositional logic, making the meaning of your propositional variables

More information

Packet #1: Logic & Proofs. Applied Discrete Mathematics

Packet #1: Logic & Proofs. Applied Discrete Mathematics Packet #1: Logic & Proofs Applied Discrete Mathematics Table of Contents Course Objectives Page 2 Propositional Calculus Information Pages 3-13 Course Objectives At the conclusion of this course, you should

More information

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

CS100: DISCRETE STRUCTURES. Lecture 5: Logic (Ch1) CS100: DISCREE SRUCURES Lecture 5: Logic (Ch1) Lecture Overview 2 Statement Logical Connectives Conjunction Disjunction Propositions Conditional Bio-conditional Converse Inverse Contrapositive Laws of

More information

Lecture 26 Section 8.4. Wed, Oct 14, 2009

Lecture 26 Section 8.4. Wed, Oct 14, 2009 PDFs n = Lecture 26 Section 8.4 Hampden-Sydney College Wed, Oct 14, 2009 Outline PDFs n = 1 2 PDFs n = 3 4 5 6 Outline PDFs n = 1 2 PDFs n = 3 4 5 6 PDFs n = Exercise 8.12, page 528. Suppose that 60% of

More information

Discrete Mathematical Structures. Chapter 1 The Foundation: Logic

Discrete Mathematical Structures. Chapter 1 The Foundation: Logic Discrete Mathematical Structures Chapter 1 he oundation: Logic 1 Lecture Overview 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Quantifiers l l l l l Statement Logical Connectives Conjunction

More information

Direct Proof and Proof by Contrapositive

Direct Proof and Proof by Contrapositive Dr. Nahid Sultana October 14, 2012 Consider an implication: p q. Then p q p q T T T T F F F T T F F T Consider an implication: p q. Then p q p q T T T T F F F T T F F T Consider x D, p(x) q(x). It can

More information

Deductive and Inductive Logic

Deductive and Inductive Logic Deductive Logic Overview (1) Distinguishing Deductive and Inductive Logic (2) Validity and Soundness (3) A Few Practice Deductive Arguments (4) Testing for Invalidity (5) Practice Exercises Deductive and

More information

DISCRETE MATHEMATICS BA202

DISCRETE MATHEMATICS BA202 TOPIC 1 BASIC LOGIC This topic deals with propositional logic, logical connectives and truth tables and validity. Predicate logic, universal and existential quantification are discussed 1.1 PROPOSITION

More information

Introduction Propositional Logic

Introduction Propositional Logic Discrete Mathematics for CSE of KU Introduction Propositional Logic Instructor: Kangil Kim (CSE) E-mail: kikim01@konkuk.ac.kr Tel. : 02-450-3493 Room : New Milenium Bldg. 1103 Lab : New Engineering Bldg.

More information

ANS: If you are in Kwangju then you are in South Korea but not in Seoul.

ANS: If you are in Kwangju then you are in South Korea but not in Seoul. Math 15 - Spring 2017 - Homework 1.1 and 1.2 Solutions 1. (1.1#1) Let the following statements be given. p = There is water in the cylinders. q = The head gasket is blown. r = The car will start. (a) Translate

More information

Geometry - Chapter 2 Corrective 1

Geometry - Chapter 2 Corrective 1 Name: Class: Date: Geometry - Chapter 2 Corrective 1 Multiple Choice Identify the choice that best completes the statement or answers the question. 1. Make a table of values for the rule x 2 16x + 64 when

More information

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

HW1 graded review form? HW2 released CSE 20 DISCRETE MATH. Fall CSE 20 HW1 graded review form? HW2 released DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Translate sentences from English to propositional logic using appropriate

More information

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

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

More information

2.2 Analyze Conditional

2.2 Analyze Conditional 2.2 Analyze Conditional Statements Goal p Write definitions as conditional statements. Your Notes VOCABULARY Conditional statement If-then form Hypothesis Conclusion Negation Converse Inverse Contrapositive

More information

Maryam Al-Towailb (KSU) Discrete Mathematics and Its Applications Math. Rules Math. of1101 Inference 1 / 13

Maryam Al-Towailb (KSU) Discrete Mathematics and Its Applications Math. Rules Math. of1101 Inference 1 / 13 Maryam Al-Towailb (KSU) Discrete Mathematics and Its Applications Math. Rules 151 - Math. of1101 Inference 1 / 13 Maryam Al-Towailb (KSU) Discrete Mathematics and Its Applications Math. Rules 151 - Math.

More information

Equations and Solutions

Equations and Solutions Section 2.1 Solving Equations: The Addition Principle 1 Equations and Solutions ESSENTIALS An equation is a number sentence that says that the expressions on either side of the equals sign, =, represent

More information

Outline. Logical Agents. Logical Reasoning. Knowledge Representation. Logical reasoning Propositional Logic Wumpus World Inference

Outline. Logical Agents. Logical Reasoning. Knowledge Representation. Logical reasoning Propositional Logic Wumpus World Inference Outline Logical Agents ECE57 Applied Artificial Intelligence Spring 008 Lecture #6 Logical reasoning Propositional Logic Wumpus World Inference Russell & Norvig, chapter 7 ECE57 Applied Artificial Intelligence

More information

Today s Topic: Propositional Logic

Today s Topic: Propositional Logic Today s Topic: Propositional Logic What is a proposition? Logical connectives and truth tables Translating between English and propositional logic Logic is the basis of all mathematical and analytical

More information

Proof strategies, or, a manual of logical style

Proof strategies, or, a manual of logical style Proof strategies, or, a manual of logical style Dr Holmes September 27, 2017 This is yet another version of the manual of logical style I have been working on for many years This semester, instead of posting

More information

1.1 Language and Logic

1.1 Language and Logic c Oksana Shatalov, Spring 2018 1 1.1 Language and Logic Mathematical Statements DEFINITION 1. A proposition is any declarative sentence (i.e. it has both a subject and a verb) that is either true or false,

More information

What is a proof? Proofing as a social process, a communication art.

What is a proof? Proofing as a social process, a communication art. Proof Methods What is a proof? Proofing as a social process, a communication art. Theoretically, a proof of a mathematical statement is no different than a logically valid argument starting with some premises

More information