Lecture : Set Theory and Logic

Similar documents
2 Truth Tables, Equivalences and the Contrapositive

Quantifiers. P. Danziger

WUCT121. Discrete Mathematics. Logic. Tutorial Exercises

Chapter 2: The Logic of Quantified Statements

Packet #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics

Equivalence of Propositions

18.S097 Introduction to Proofs IAP 2015 Lecture Notes 1 (1/5/2015)

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

3. The Logic of Quantified Statements Summary. Aaron Tan August 2017

CSE 20 DISCRETE MATH. Winter

Elementary Logic and Proof

cse 311: foundations of computing Fall 2015 Lecture 6: Predicate Logic, Logical Inference

AMTH140 Lecture 8. Symbolic Logic

2-4: The Use of Quantifiers

- 1.2 Implication P. Danziger. Implication

Phil Introductory Formal Logic

Logic and Proof. On my first day of school my parents dropped me off at the wrong nursery. There I was...surrounded by trees and bushes!

CA320 - Computability & Complexity

On my first day of school my parents dropped me off at the wrong nursery. There I was...surrounded by trees and bushes! 26-Aug-2011 MA

Mathematics 220 Midterm Practice problems from old exams Page 1 of 8

Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics Lecture notes in progress (27 March 2010)

LECTURE 1. Logic and Proofs

Discrete Mathematics. (c) Marcin Sydow. Sets. Set operations. Sets. Set identities Number sets. Pair. Power Set. Venn diagrams

1. (B) The union of sets A and B is the set whose elements belong to at least one of A

2.2: Logical Equivalence: The Laws of Logic

A set is an unordered collection of objects.

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

Equivalence and Implication

Negations of Quantifiers

2.3 Exercises. (a) F P(A). (Solution)

Chapter 0 Preliminaries

Statements and Quantifiers

Lecture : Tietze Extension Theorem

Introduction to Decision Sciences Lecture 2

MAT 243 Test 1 SOLUTIONS, FORM A

Exclusive Disjunction

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes

Logic, Sets, and Proofs

Lecture Notes 1 Basic Concepts of Mathematics MATH 352

Review CHAPTER. 2.1 Definitions in Chapter Sample Exam Questions. 2.1 Set; Element; Member; Universal Set Partition. 2.

Math Assignment 2 Solutions - Spring Jaimos F Skriletz Provide definitions for the following:

Proofs. Joe Patten August 10, 2018

Proving simple set properties...

Welcome to MAT 137! Course website:

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.

Chapter 1 : The language of mathematics.

Packet #1: Logic & Proofs. Applied Discrete Mathematics

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

MATH10040: Chapter 0 Mathematics, Logic and Reasoning

Mathematics Review for Business PhD Students

1 Direct Proofs Technique Outlines Example Implication Proofs Technique Outlines Examples...

The Tychonoff Theorem

Final Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is

Discrete Mathematics. W. Ethan Duckworth. Fall 2017, Loyola University Maryland

Mathematical Reasoning & Proofs

CHAPTER 1. Preliminaries. 1 Set Theory

MATHEMATICAL REASONING

Math 105A HW 1 Solutions

Chapter 2: The Logic of Quantified Statements. January 22, 2010

Theorem. For every positive integer n, the sum of the positive integers from 1 to n is n(n+1)

The proposition p is called the hypothesis or antecedent. The proposition q is called the conclusion or consequence.

Background for Discrete Mathematics

Theory of Computation

ANALYSIS EXERCISE 1 SOLUTIONS

Predicate Logic. CSE 191, Class Note 02: Predicate Logic Computer Sci & Eng Dept SUNY Buffalo

Conditional Statements

More examples of mathematical. Lecture 4 ICOM 4075

Mat 243 Exam 1 Review

Introduction to Proofs

1. Propositions: Contrapositives and Converses

7.11 A proof involving composition Variation in terminology... 88

Digital Logic Design: a rigorous approach c

Carmen s Core Concepts (Math 135)

HANDOUT AND SET THEORY. Ariyadi Wijaya

Contradiction MATH Contradiction. Benjamin V.C. Collins, James A. Swenson MATH 2730

Discrete Mathematical Structures: Theory and Applications

Section 2.3: Statements Containing Multiple Quantifiers

Mathematical Preliminaries. Sipser pages 1-28

With Question/Answer Animations. Chapter 2

Proof by Contradiction

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

Direct Proof and Proof by Contrapositive

MATH 271 Summer 2016 Practice problem solutions Week 1

Sets McGraw-Hill Education

CSC Discrete Math I, Spring Propositional Logic

Unit 2: Logic and Reasoning. start of unit

CS Module 1. Ben Harsha Apr 12, 2017

Practice Midterm Exam Solutions

Predicate Calculus lecture 1

Basic Proof Examples

Some Review Problems for Exam 1: Solutions

CSE 20 DISCRETE MATH WINTER

Math 10850, fall 2017, University of Notre Dame

CSE 20 DISCRETE MATH SPRING

5. Partitions and Relations Ch.22 of PJE.

Day 5. Friday May 25, 2012

Logic and Set Notation

Elementary Point-Set Topology

CSCE 222 Discrete Structures for Computing. Review for Exam 1. Dr. Hyunyoung Lee !!!

Analysis 1. Lecture Notes 2013/2014. The original version of these Notes was written by. Vitali Liskevich

Transcription:

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 I Our discission of the if... then construction leads to us to consider another point of elementary logic that some times causes difficulty. It concern the relation between a statement, its contrapositive, and its converse. Given a statement of the form If P, then Q, its contrapositive is defined to the statement If Q is not true. For example, the contrapositive of the statement If x > 0, then x 3 0 is the statement If x 3 = 0, then it is not true that x > 0 Here both the statement and its contrapositive are true.

Contrapositive and Converse II The statement If x 2 < 0, then x = 23 has as its contrapositive the statement If x = 23, then it is not true that x 2 < 0 Again, both are true statements about real numbers.

Contrapositive and Converse III From these two example one question aries that Question : There is some ration between a statement and its contrapositive? Answer : These two ways of saying precisely same thing. Each is true if an only if other is true. They are logically equivalent. Now how you will show that both are same.

Contrapositive and Converse IV Let us introduce some notation If P, then Q will be write as P Q The contrapositive can then be expressed in the form (not Q) (not P )

Contrapositive and Converse V There is another statement that can be formed from the statement P Q. It is the statement Q P Which is called the converse of P Q. Remark Careful about the difference between a statement s converse and contrapositive. Whereas a statement and its contrapositive are logically equivalent, the truth of a statment say noting at all about the truth or falsity of its converse.

Contrapositive and Converse VI The true statement If x > 0, then x 3 0 has as its converse the statement which is false. Similarly, the true statement has as its converse the statement If x 3 0, then x > 0 If x 2 < 0, then x = 23 If x = 23, then x 2 < 0 which is false.

Contrapositive and Converse VII Remark Both the statement P Q and its converse Q P are true, we express this fact by the notation P Q

I Definition If one wishes to form the contrapositive of the statement P Q, one has to know how to form the statement not P, which is called the negation of P. Consider an example, suppose that X is a set, A is a subset of X, and P is a statement about the general element of X. Consider the following statement For every x A, statement P holds (1) Then negation of the statement will be For at least one x A, statement P does not hold (2)

II Therefore, to form the negation of the statement, one replace the quantifier for every by quantifier for at least, and one replaces statement P by its negation. The process works in reverse just as well the negation of the statement is the statement For at least one x A, statement Q holds (3) For every x A, statement Q does not hold (4)

I When we have a set whose elements are sets often refer to it as a collection of sets and denote it by a script letter such that as A of B. Take care on this, if A is the set {a, b, c}, then the statments are all true. a A, {a} A and {a} P(A)

I Given a collection A of sets, the union of the elements of A is defined by the equation A A A = {x: x A for at least one A A} (5) The intersection of the elements of A is defined by the equation A A A = {x: x A for every A A} (6)

I If A and B are two sets, the their cartesian product is defined as A B = {(a, b): a A and b B}