DISCRETE MATHEMATICS W W L CHEN

Save this PDF as:

Size: px
Start display at page:

Transcription

1 DISCRETE MATHEMATICS W W L CHEN c W W L Chen, 1982, This chapter originates from material used by the author at Imperial College, University of London, between 1981 and It is available free to all individuals, on the understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied, with or without permission from the author. However, this document may not be kept on any information storage and retrieval system without permission from the author, unless such system is not accessible to any individuals other than its owners. Chapter 1 LOGIC AND SETS 1.1. Sentences In this section, we look at sentences, their truth or falsity, and ways of combining or connecting sentences to produce new sentences. A sentence (or proposition) is an expression which is either true or false. The sentence = 4 is true, while the sentence π is rational is false. It is, however, not the task of logic to decide whether any particular sentence is true or false. In fact, there are many sentences whose truth or falsity nobody has yet managed to establish; for example, the famous Goldbach conjecture that every even number greater than 2 is a sum of two primes. There is a defect in our definition. It is sometimes very difficult, under our definition, to determine whether or not a given expression is a sentence. Consider, for example, the expression I am telling a lie ; am I? Since there are expressions which are sentences under our definition, we proceed to discuss ways of connecting sentences to form new sentences. Let p and q denote sentences. Definition. (CONJUNCTION) We say that the sentence p q (p and q) is true if the two sentences p, q are both true, and is false otherwise. Example The sentence = 4 and = 5 is true. Example The sentence = 4 and π is rational is false. Chapter 1 : Logic and Sets page 1 of 9

2 Definition. (DISJUNCTION) We say that the sentence p q (p or q) is true if at least one of two sentences p, q is true, and is false otherwise. Example The sentence = 2 or = 5 is false. Example The sentence = 4 or π is rational is true. Remark. To prove that a sentence p q is true, we may assume that the sentence p is false and use this to deduce that the sentence q is true in this case. For if the sentence p is true, our argument is already complete, never mind the truth or falsity of the sentence q. Definition. (NEGATION) We say that the sentence p (not p) is true if the sentence p is false, and is false if the sentence p is true. Example The negation of the sentence = 4 is the sentence Example The negation of the sentence π is rational is the sentence π is irrational. Definition. (CONDITIONAL) We say that the sentence p q (if p, then q) is true if the sentence p is false or if the sentence q is true or both, and is false otherwise. Remark. It is convenient to realize that the sentence p q is false precisely when the sentence p is true and the sentence q is false. To understand this, note that if we draw a false conclusion from a true assumption, then our argument must be faulty. On the other hand, if our assumption is false or if our conclusion is true, then our argument may still be acceptable. Example The sentence if = 2, then = 5 is true, because the sentence = 2 is false. Example The sentence if = 4, then π is rational is false. Example The sentence if π is rational, then = 4 is true. Definition. (DOUBLE CONDITIONAL) We say that the sentence p q (p if and only if q) is true if the two sentences p, q are both true or both false, and is false otherwise. Example The sentence = 4 if and only if π is irrational is true. Example The sentence if and only if π is rational is also true. If we use the letter T to denote true and the letter F to denote false, then the above five definitions can be summarized in the following truth table : p q p q p q p p q p q T T T T F T T T F F T F F F F T F T T T F F F F F T T T Remark. Note that in logic, or can mean both. If you ask a logician whether he likes tea or coffee, do not be surprised if he wants both! Chapter 1 : Logic and Sets page 2 of 9

3 Example The sentence (p q) (p q) is true if exactly one of the two sentences p, q is true, and is false otherwise; we have the following truth table : p q p q p q p q (p q) (p q) T T T T F F T F F T T T F T F T T T F F F F T F 1.2. Tautologies and Logical Equivalence Definition. A tautology is a sentence which is true on logical ground only. Example The sentences (p (q r)) ((p q) r) and (p q) (q p) are both tautologies. This enables us to generalize the definition of conjunction to more than two sentences, and write, for example, p q r without causing any ambiguity. Example The sentences (p (q r)) ((p q) r) and (p q) (q p) are both tautologies. This enables us to generalize the definition of disjunction to more than two sentences, and write, for example, p q r without causing any ambiguity. Example The sentence p p is a tautology. Example The sentence (p q) (q p) is a tautology. Example The sentence (p q) (p q) is a tautology. Example The sentence (p q) ((p q) (p q)) is a tautology; we have the following truth table : p q p q (p q) (p q) (p q) (p q) ((p q) (p q)) T T T F F T T F F T T T F T F T T T F F T F F T The following are tautologies which are commonly used. Let p, q and r denote sentences. DISTRIBUTIVE LAW. The following sentences are tautologies: (a) (p (q r)) ((p q) (p r)); (b) (p (q r)) ((p q) (p r)). DE MORGAN LAW. The following sentences are tautologies: (a) (p q) (p q); (b) (p q) (p q). INFERENCE LAW. The following sentences are tautologies: (a) (MODUS PONENS) (p (p q)) q; (b) (MODUS TOLLENS) ((p q) q) p; (c) (LAW OF SYLLOGISM) ((p q) (q r)) (p r). Chapter 1 : Logic and Sets page 3 of 9

4 These tautologies can all be demonstrated by truth tables. Distributive law here. However, let us try to prove the first Suppose first of all that the sentence p (q r) is true. Then the two sentences p, q r are both true. Since the sentence q r is true, at least one of the two sentences q, r is true. Without loss of generality, assume that the sentence q is true. Then the sentence p q is true. It follows that the sentence (p q) (p r) is true. Suppose now that the sentence (p q) (p r) is true. Then at least one of the two sentences (p q), (p r) is true. Without loss of generality, assume that the sentence p q is true. Then the two sentences p, q are both true. It follows that the sentence q r is true, and so the sentence p (q r) is true. It now follows that the two sentences p (q r) and (p q) (p r) are either both true or both false, as the truth of one implies the truth of the other. It follows that the double conditional (p (q r)) ((p q) (p r)) is a tautology. Definition. We say that two sentences p and q are logically equivalent if the sentence p q is a tautology. Example The sentences p q and q p are logically equivalent. The latter is known as the contrapositive of the former. Remark. The sentences p q and q p are not logically equivalent. The latter is known as the converse of the former Sentential Functions and Sets In many instances, we have sentences, such as x is even, which contains one or more variables. We shall call them sentential functions (or propositional functions). Let us concentrate on our example x is even. This sentence is true for certain values of x, and is false for others. Various questions arise: What values of x do we permit? Is the statement true for all such values of x in question? Is the statement true for some such values of x in question? To answer the first of these questions, we need the notion of a universe. We therefore need to consider sets. We shall treat the word set as a word whose meaning everybody knows. Sometimes we use the synonyms class or collection. However, note that in some books, these words may have different meanings! The important thing about a set is what it contains. In other words, what are its members? Does it have any? If P is a set and x is an element of P, we write x P. A set is usually described in one of the two following ways: By enumeration, e.g. {1, 2, 3} denotes the set consisting of the numbers 1, 2, 3 and nothing else; By a defining property (sentential function) p(x). Here it is important to define a universe U to which all the x have to belong. We then write P = {x : x U and p(x) is true} or, simply, P = {x : p(x)}. The set with no elements is called the empty set and denoted by. Chapter 1 : Logic and Sets page 4 of 9

5 Example N = {1, 2, 3, 4, 5,...} is called the set of natural numbers. Example Z = {..., 2, 1, 0, 1, 2,...} is called the set of integers. Example {x : x N and 2 < x < 2} = {1}. Example {x : x Z and 2 < x < 2} = { 1, 0, 1}. Example {x : x N and 1 < x < 1} = Set Functions Suppose that the sentential functions p(x), q(x) are related to sets P, Q with respect to a given universe, i.e. P = {x : p(x)} and Q = {x : q(x)}. We define the intersection P Q = {x : p(x) q(x)}; the union P Q = {x : p(x) q(x)}; the complement P = {x : p(x)}; and the difference P \ Q = {x : p(x) q(x)}. The above are also sets. It is not difficult to see that P Q = {x : x P and x Q}; P Q = {x : x P or x Q}; P = {x : x P }; and P \ Q = {x : x P and x Q}. We say that the set P is a subset of the set Q, denoted by P Q or by Q P, if every element of P is an element of Q. In other words, if we have P = {x : p(x)} and Q = {x : q(x)} with respect to some universe U, then we have P Q if and only if the sentence p(x) q(x) is true for all x U. We say that two sets P and Q are equal, denoted by P = Q, if they contain the same elements, i.e. if each is a subset of the other, i.e. if P Q and Q P. Furthermore, we say that P is a proper subset of Q, denoted by P Q or by Q P, if P Q and P Q. The following results on set functions can be deduced from their analogues in logic. DISTRIBUTIVE LAW. If P, Q, R are sets, then (a) P (Q R) = (P Q) (P R); (b) P (Q R) = (P Q) (P R). DE MORGAN LAW. If P, Q are sets, then with respect to a universe U, (a) (P Q) = P Q; (b) (P Q) = P Q. We now try to deduce the first Distributive law for set functions from the first Distributive law for sentential functions. Suppose that the sentential functions p(x), q(x), r(x) are related to sets P, Q, R with respect to a given universe, i.e. P = {x : p(x)}, Q = {x : q(x)} and R = {x : r(x)}. Then and P (Q R) = {x : p(x) (q(x) r(x))} (P Q) (P R) = {x : (p(x) q(x)) (p(x) r(x))}. Chapter 1 : Logic and Sets page 5 of 9

6 Suppose that x P (Q R). Then p(x) (q(x) r(x)) is true. By the first Distributive law for sentential functions, we have that (p(x) (q(x) r(x))) ((p(x) q(x)) (p(x) r(x))) is a tautology. It follows that (p(x) q(x)) (p(x) r(x)) is true, so that x (P Q) (P R). This gives P (Q R) (P Q) (P R). (1) Suppose now that x (P Q) (P R). Then (p(x) q(x)) (p(x) r(x)) is true. It follows from the first Distributive law for sentential functions that p(x) (q(x) r(x)) is true, so that x P (Q R). This gives The result now follows on combining (1) and (2). (P Q) (P R) P (Q R). (2) 1.5. Quantifier Logic Let us return to the example x is even at the beginning of Section 1.3. Suppose now that we restrict x to lie in the set Z of all integers. Then the sentence x is even is only true for some x in Z. It follows that the sentence some x Z are even is true, while the sentence all x Z are even is false. In general, consider a sentential function of the form p(x), where the variable x lies in some clearly stated set. We can then consider the following two sentences: x, p(x) (for all x, p(x) is true); and x, p(x) (for some x, p(x) is true). Definition. The symbols (for all) and (for some) are called the universal quantifier and the existential quantifier respectively. Note that the variable x is a dummy variable. There is no difference between writing x, p(x) or writing y, p(y). Example (LAGRANGE S THEOREM) Every natural number is the sum of the squares of four integers. This can be written, in logical notation, as n N, a, b, c, d Z, n = a 2 + b 2 + c 2 + d 2. Example (GOLDBACH CONJECTURE) Every even natural number greater than 2 is the sum of two primes. This can be written, in logical notation, as n N \ {1}, p, q prime, 2n = p + q. It is not yet known whether this is true or not. mathematics. This is one of the greatest unsolved problems in 1.6. Negation Our main concern is to develop a rule for negating sentences with quantifiers. Let me start by saying that you are all fools. Naturally, you will disagree, and some of you will complain. So it is natural to suspect that the negation of the sentence x, p(x) is the sentence x, p(x). Chapter 1 : Logic and Sets page 6 of 9

7 There is another way to look at this. Let U be the universe for all the x. Let P = {x : p(x)}. Suppose first of all that the sentence x, p(x) is true. Then P = U, so P =. But P = {x : p(x)}, so that if the sentence x, p(x) were true, then P, a contradiction. On the other hand, suppose now that the sentence x, p(x) is false. Then P U, so that P. It follows that the sentence x, p(x) is true. Now let me moderate a bit and say that some of you are fools. You will still complain, so perhaps none of you are fools. It is then natural to suspect that the negation of the sentence x, p(x) is the sentence x, p(x). To summarize, we simply change the quantifier to the other type and negate the sentential function. Suppose now that we have something more complicated. Let us apply bit by bit our simple rule. For example, the negation of is which is which is which is x, y, z, w, p(x, y, z, w) x, ( y, z, w, p(x, y, z, w)), x, y, ( z, w, p(x, y, z, w)), x, y, z, ( w, p(x, y, z, w)), x, y, z, w, p(x, y, z, w). It is clear that the rule is the following: Keep the variables in their original order. Then, alter all the quantifiers. Finally, negate the sentential function. Example The negation of the Goldbach conjecture is, in logical notation, n N \ {1}, p, q prime, 2n p + q. In other words, there is an even natural number greater than 2 which is not the sum of two primes. In summary, to disprove the Goldbach conjecture, we simply need one counterexample! Chapter 1 : Logic and Sets page 7 of 9

8 Problems for Chapter 1 1. Using truth tables or otherwise, check that each of the following is a tautology: a) p (p q) b) ((p q) q) (p q) c) p (q p) d) (p (p q)) p e) (p q) (q p) 2. Decide (and justify) whether each of the following is a tautology: a) (p q) (q (p q)) b) (p (q r)) ((p q) (p r)) c) ((p q) r) (p (q r)) d) (p q r) (s t) e) (p q) (p q) f) p q (p q) g) (p q r) (p q (p r)) h) ((r s) (p q)) (p (q (r s))) i) p (q (r s)) j) (p q (r s)) (t u) k) (p q) r ((p q) r) l) (p q) (q p). m) (p (q (r s))) ((p q) (p r s)) 3. For each of the following, decide whether the statement is true or false, and justify your assertion: a) If p is true and q is false, then p q is true. b) If p is true, q is false and r is false, then p (q r) is true. c) The sentence (p q) (q p) is a tautology. d) The sentences p (q r) and (p q) (p r) are logically equivalent. 4. List the elements of each of the following sets: a) {x N : x 2 < 45} b) {x Z : x 2 < 45} c) {x R : x 2 + 2x = 0} d) {x Q : x = 6} e) {x Z : x 4 = 1} f) {x N : x 4 = 1} 5. How many elements are there in each of the following sets? Are the sets all different? a) b) { } c) {{ }} d) {, { }} e) {, } 6. Let U = {a, b, c, d}, P = {a, b} and Q = {a, c, d}. Write down the elements of the following sets: a) P Q b) P Q c) P d) Q 7. Let U = R, A = {x R : x > 0}, B = {x R : x > 1} and C = {x R : x < 2}. Find each of the following sets: a) A B b) A C c) B C d) A B e) A C f) B C g) A h) B i) C j) A \ B k) B \ C 8. List all the subsets of the set {1, 2, 3}. How many subsets are there? 9. A, B, C, D are sets such that A B = C D, and both A B and C D are empty. a) Show by examples that A C and B D can be empty. b) Show that if C A, then B D. 10. Suppose that P, Q and R are subsets of N. For each of the following, state whether or not the statement is true, and justify your assertion by studying the analogous sentences in logic: a) P (Q R) = (P Q) (P R). b) P Q if and only if Q P. c) If P Q and Q R, then P R. Chapter 1 : Logic and Sets page 8 of 9

9 11. For each of the following sentences, write down the sentence in logical notation, negate the sentence, and say whether the sentence or its negation is true: a) Given any integer, there is a larger integer. b) There is an integer greater than all other integers. c) Every even number is a sum of two odd numbers. d) Every odd number is a sum of two even numbers. e) The distance between any two complex numbers is positive. f) All natural numbers divisible by 2 and by 3 are divisible by 6. [Notation: Write x y if x divides y.] g) Every integer is a sum of the squares of two integers. h) There is no greatest natural number. 12. For each of the following sentences, express the sentence in words, negate the sentence, and say whether the sentence or its negation is true: a) z N, z 2 N b) x Z, y Z, z Z, z 2 = x 2 + y 2 c) x Z, y Z, (x > y) (x y) d) x, y, z R, w R, x 2 + y 2 + z 2 = 8w 13. Let p(x, y) be a sentential function with variables x and y. Discuss whether each of the following is true on logical grounds only: a) ( x, y, p(x, y)) ( y, x, p(x, y)) b) ( y, x, p(x, y)) ( x, y, p(x, y)) Chapter 1 : Logic and Sets page 9 of 9

Chapter I Logic and Proofs

MATH 1130 1 Discrete Structures Chapter I Logic and Proofs Propositions A proposition is a statement that is either true (T) or false (F), but or both. s Propositions: 1. I am a man.. I am taller than

Logic, Sets, and Proofs

Logic, Sets, and Proofs David A. Cox and Catherine C. McGeoch Amherst College 1 Logic Logical Statements. A logical statement is a mathematical statement that is either true or false. Here we denote logical

DISCRETE MATHEMATICS W W L CHEN. c W W L Chen, 1982.

DISCRETE MATHEMATICS W W L CHEN c W W L Chen, 982. This work is available free, in the hope that it will be useful. Any part of this work may be reproduced or transmitted in any form or by any means, electronic

CS 2336 Discrete Mathematics

CS 2336 Discrete Mathematics Lecture 2 Logic: Predicate Calculus 1 Outline Predicates Quantifiers Binding Applications Logical Equivalences 2 Predicates In mathematics arguments, we will often see sentences

Even Number: An integer n is said to be even if it has the form n = 2k for some integer k. That is, n is even if and only if n divisible by 2.

MATH 337 Proofs Dr. Neal, WKU This entire course requires you to write proper mathematical proofs. All proofs should be written elegantly in a formal mathematical style. Complete sentences of explanation

The Foundations: Logic and Proofs. Chapter 1, Part III: Proofs

The Foundations: Logic and Proofs Chapter 1, Part III: Proofs Rules of Inference Section 1.6 Section Summary Valid Arguments Inference Rules for Propositional Logic Using Rules of Inference to Build Arguments

31 is a prime number is a mathematical statement (which happens to be true).

Chapter 1 Mathematical Logic In its most basic form, Mathematics is the practice of assigning truth to welldefined statements. In this course, we will develop the skills to use known true statements to

CS 441 Discrete Mathematics for CS Lecture 5. Predicate logic. CS 441 Discrete mathematics for CS. Negation of quantifiers

CS 441 Discrete Mathematics for CS Lecture 5 Predicate logic Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Negation of quantifiers English statement: Nothing is perfect. Translation: x Perfect(x)

2.1.1 Examples of Sets and their Elements

Chapter 2 Set Theory 2.1 Sets The most basic object in Mathematics is called a set. As rudimentary as it is, the exact, formal definition of a set is highly complex. For our purposes, we will simply define

DISCRETE MATH: LECTURE 4

DISCRETE MATH: LECTURE 4 DR. DANIEL FREEMAN 1. Chapter 3.1 Predicates and Quantified Statements I A predicate is a sentence that contains a finite number of variables and becomes a statement when specific

1 Proposition, Logical connectives and compound statements

Discrete Mathematics: Lecture 4 Introduction to Logic Instructor: Arijit Bishnu Date: July 27, 2009 1 Proposition, Logical connectives and compound statements Logic is the discipline that deals with the

3.3. INFERENCE 105. Table 3.5: Another look at implication. p q p q T T T T F F F T T F F T

3.3. INFERENCE 105 3.3 Inference Direct Inference (Modus Ponens) and Proofs We concluded our last section with a proof that the sum of two even numbers is even. That proof contained several crucial ingredients.

LOGICAL INFERENCE & PROOFs Debdeep Mukhopadhyay Dept of CSE, IIT Madras Defn A theorem is a mathematical assertion which can be shown to be true. A proof is an argument which establishes the truth of a

Math 3000 Running Glossary

Math 3000 Running Glossary Last Updated on: July 15, 2014 The definition of items marked with a must be known precisely. Chapter 1: 1. A set: A collection of objects called elements. 2. The empty set (

Proof: A logical argument establishing the truth of the theorem given the truth of the axioms and any previously proven theorems.

Math 232 - Discrete Math 2.1 Direct Proofs and Counterexamples Notes Axiom: Proposition that is assumed to be true. Proof: A logical argument establishing the truth of the theorem given the truth of the

Review Name Rule of Inference

CS311H: Discrete Mathematics Review Name Rule of Inference Modus ponens φ 2 φ 2 Modus tollens φ 2 φ 2 Inference Rules for Quantifiers Işıl Dillig Hypothetical syllogism Or introduction Or elimination And

Discrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof. Harper Langston New York University

Discrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof Harper Langston New York University Proof and Counterexample Discovery and proof Even and odd numbers number n from Z is called

Handout #1: Mathematical Reasoning

Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or

Discrete Mathematics Lecture 1 Logic of Compound Statements. Harper Langston New York University

Discrete Mathematics Lecture 1 Logic of Compound Statements Harper Langston New York University Administration Class Web Site http://cs.nyu.edu/courses/summer05/g22.2340-001/ Mailing List Subscribe at

MAT2400 Analysis I. A brief introduction to proofs, sets, and functions

MAT2400 Analysis I A brief introduction to proofs, sets, and functions In Analysis I there is a lot of manipulations with sets and functions. It is probably also the first course where you have to take

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us

Likewise, we have contradictions: formulas that can only be false, e.g. (p p).

CHAPTER 4. STATEMENT LOGIC 59 The rightmost column of this truth table contains instances of T and instances of F. Notice that there are no degrees of contingency. If both values are possible, the formula

CSI 2101 / Rules of Inference ( 1.5)

CSI 2101 / Rules of Inference ( 1.5) Introduction what is a proof? Valid arguments in Propositional Logic equivalence of quantified expressions Rules of Inference in Propositional Logic the rules using

What is logic? Propositional Logic. Negation. Propositions. This is a contentious question! We will play it safe, and stick to:

Propositional Logic This lecture marks the start of a new section of the course. In the last few lectures, we have had to reason formally about concepts. This lecture introduces the mathematical language

CHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs

CHAPTER 3 Methods of Proofs 1. Logical Arguments and Formal Proofs 1.1. Basic Terminology. An axiom is a statement that is given to be true. A rule of inference is a logical rule that is used to deduce

2. Propositional Equivalences

2. PROPOSITIONAL EQUIVALENCES 33 2. Propositional Equivalences 2.1. Tautology/Contradiction/Contingency. Definition 2.1.1. A tautology is a proposition that is always true. Example 2.1.1. p p Definition

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

Discrete Math Review Discrete Math Review (Rosen, Chapter 1.1 1.6) TOPICS Propositional Logic Logical Operators Truth Tables Implication Logical Equivalence Inference Rules What you should know about propositional

INTRODUCTION TO PROOFS: HOMEWORK SOLUTIONS

INTRODUCTION TO PROOFS: HOMEWORK SOLUTIONS STEVEN HEILMAN Contents 1. Homework 1 1 2. Homework 2 6 3. Homework 3 10 4. Homework 4 16 5. Homework 5 19 6. Homework 6 21 7. Homework 7 25 8. Homework 8 28

Section 1. Statements and Truth Tables. Definition 1.1: A mathematical statement is a declarative sentence that is true or false, but not both.

M3210 Supplemental Notes: Basic Logic Concepts In this course we will examine statements about mathematical concepts and relationships between these concepts (definitions, theorems). We will also consider

1.3 Induction and Other Proof Techniques

4CHAPTER 1. INTRODUCTORY MATERIAL: SETS, FUNCTIONS AND MATHEMATICAL INDU 1.3 Induction and Other Proof Techniques The purpose of this section is to study the proof technique known as mathematical induction.

Section 1.3: Predicate Logic

1 Section 1.3: Purpose of Section: To introduce predicate logic (or first-order logic) which the language of mathematics. We see how predicate logic extends the language of sentential calculus studied

Logic will get you from A to B. Imagination will take you everywhere.

Chapter 3 Predicate Logic Logic will get you from A to B. Imagination will take you everywhere. A. Einstein In the previous chapter, we studied propositional logic. This chapter is dedicated to another

Chapter 1 LOGIC AND PROOF

Chapter 1 LOGIC AND PROOF To be able to understand mathematics and mathematical arguments, it is necessary to have a solid understanding of logic and the way in which known facts can be combined to prove

Problems on Discrete Mathematics 1

Problems on Discrete Mathematics 1 Chung-Chih Li 2 Kishan Mehrotra 3 Syracuse University, New York L A TEX at January 11, 2007 (Part I) 1 No part of this book can be reproduced without permission from

Inference Rules and Proof Methods

Inference Rules and Proof Methods Winter 2010 Introduction Rules of Inference and Formal Proofs Proofs in mathematics are valid arguments that establish the truth of mathematical statements. An argument

2. Methods of Proof Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try.

2. METHODS OF PROOF 69 2. Methods of Proof 2.1. Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try. Trivial Proof: If we know q is true then

def: An axiom is a statement that is assumed to be true, or in the case of a mathematical system, is used to specify the system.

Section 1.5 Methods of Proof 1.5.1 1.5 METHODS OF PROOF Some forms of argument ( valid ) never lead from correct statements to an incorrect. Some other forms of argument ( fallacies ) can lead from true

1.5 Methods of Proof INTRODUCTION

1.5 Methods of Proof INTRODUCTION Icon 0049 Two important questions that arise in the study of mathematics are: (1) When is a mathematical argument correct? (2) What methods can be used to construct mathematical

Definition 10. A proposition is a statement either true or false, but not both.

Chapter 2 Propositional Logic Contrariwise, continued Tweedledee, if it was so, it might be; and if it were so, it would be; but as it isn t, it ain t. That s logic. (Lewis Carroll, Alice s Adventures

Midterm Examination 1 with Solutions - Math 574, Frank Thorne Thursday, February 9, 2012

Midterm Examination 1 with Solutions - Math 574, Frank Thorne (thorne@math.sc.edu) Thursday, February 9, 2012 1. (3 points each) For each sentence below, say whether it is logically equivalent to the sentence

Logical Inference and Mathematical Proof

Logical Inference and Mathematical Proof CSE 191, Class Note 03: Logical Inference and Mathematical Proof Computer Sci & Eng Dept SUNY Buffalo c Xin He (University at Buffalo) CSE 191 Discrete Structures

Mathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson

Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement

A set is a Many that allows itself to be thought of as a One. (Georg Cantor)

Chapter 4 Set Theory A set is a Many that allows itself to be thought of as a One. (Georg Cantor) In the previous chapters, we have often encountered sets, for example, prime numbers form a set, domains

Chapter 1. Logic and Proof

Chapter 1. Logic and Proof 1.1 Remark: A little over 100 years ago, it was found that some mathematical proofs contained paradoxes, and these paradoxes could be used to prove statements that were known

Propositional Logic. A proposition is a declarative sentence (a sentence that declares a fact) that is either true or false, but not both.

irst Order Logic Propositional Logic A proposition is a declarative sentence (a sentence that declares a fact) that is either true or false, but not both. Are the following sentences propositions? oronto

If f is a 1-1 correspondence between A and B then it has an inverse, and f 1 isa 1-1 correspondence between B and A.

Chapter 5 Cardinality of sets 51 1-1 Correspondences A 1-1 correspondence between sets A and B is another name for a function f : A B that is 1-1 and onto If f is a 1-1 correspondence between A and B,

Students in their first advanced mathematics classes are often surprised

CHAPTER 8 Proofs Involving Sets Students in their first advanced mathematics classes are often surprised by the extensive role that sets play and by the fact that most of the proofs they encounter are

Introduction to Proofs

Chapter 1 Introduction to Proofs 1.1 Preview of Proof This section previews many of the key ideas of proof and cites [in brackets] the sections where they are discussed thoroughly. All of these ideas are

3.3 Proofs Involving Quantifiers

3.3 Proofs Involving Quantifiers 1. In exercise 6 of Section 2.2 you use logical equivalences to show that x(p (x) Q(x)) is equivalent to xp (x) xq(x). Now use the methods of this section to prove that

1.5 Arguments & Rules of Inference

1.5 Arguments & Rules of Inference Tools for establishing the truth of statements Argument involving a seuence of propositions (premises followed by a conclusion) Premises 1. If you have a current password,

Math 3000 Section 003 Intro to Abstract Math Homework 2

Math 3000 Section 003 Intro to Abstract Math Homework 2 Department of Mathematical and Statistical Sciences University of Colorado Denver, Spring 2012 Solutions (February 13, 2012) Please note that these

CSE 191, Class Note 01 Propositional Logic Computer Sci & Eng Dept SUNY Buffalo

Propositional Logic CSE 191, Class Note 01 Propositional Logic Computer Sci & Eng Dept SUNY Buffalo c Xin He (University at Buffalo) CSE 191 Discrete Structures 1 / 37 Discrete Mathematics What is Discrete

Introduction to mathematical arguments

Introduction to mathematical arguments (background handout for courses requiring proofs) by Michael Hutchings A mathematical proof is an argument which convinces other people that something is true. Math

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics. Introductory Notes in Discrete Mathematics

Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics Introductory Notes in Discrete Mathematics Marcel B. Finan c All Rights Reserved Last Updated April 6, 2016 Preface

CHAPTER 1. Logic, Proofs Propositions

CHAPTER 1 Logic, Proofs 1.1. Propositions A proposition is a declarative sentence that is either true or false (but not both). For instance, the following are propositions: Paris is in France (true), London

Applications of Methods of Proof

CHAPTER 4 Applications of Methods of Proof 1. Set Operations 1.1. Set Operations. The set-theoretic operations, intersection, union, and complementation, defined in Chapter 1.1 Introduction to Sets are

LESSON 1 PRIME NUMBERS AND FACTORISATION

LESSON 1 PRIME NUMBERS AND FACTORISATION 1.1 FACTORS: The natural numbers are the numbers 1,, 3, 4,. The integers are the naturals numbers together with 0 and the negative integers. That is the integers

Elementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.

Elementary Number Theory and Methods of Proof CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 1 Number theory Properties: 2 Properties of integers (whole

vertex, 369 disjoint pairwise, 395 disjoint sets, 236 disjunction, 33, 36 distributive laws

Index absolute value, 135 141 additive identity, 254 additive inverse, 254 aleph, 466 algebra of sets, 245, 278 antisymmetric relation, 387 arcsine function, 349 arithmetic sequence, 208 arrow diagram,

1.5 Rules of Inference

1.5 Rules of Inference (Inference: decision/conclusion by evidence/reasoning) Introduction Proofs are valid arguments that establish the truth of statements. An argument is a sequence of statements that

Logic and Proof Solutions. Question 1

Logic and Proof Solutions Question 1 Which of the following are true, and which are false? For the ones which are true, give a proof. For the ones which are false, give a counterexample. (a) x is an odd

3. Mathematical Induction

3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)

Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products

Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing

Math 55: Discrete Mathematics

Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 1, due Wedneday, January 25 1.1.10 Let p and q be the propositions The election is decided and The votes have been counted, respectively.

Problems on Discrete Mathematics 1

Problems on Discrete Mathematics 1 Chung-Chih Li 2 Kishan Mehrotra 3 L A TEX at July 18, 2007 1 No part of this book can be reproduced without permission from the authors 2 Illinois State University, Normal,

The set consisting of all natural numbers that are in A and are in B is the set f1; 3; 5g;

Chapter 5 Set Theory 5.1 Sets and Operations on Sets Preview Activity 1 (Set Operations) Before beginning this section, it would be a good idea to review sets and set notation, including the roster method

We now explore a third method of proof: proof by contradiction.

CHAPTER 6 Proof by Contradiction We now explore a third method of proof: proof by contradiction. This method is not limited to proving just conditional statements it can be used to prove any kind of statement

Chapter 3. Proof. 3.1 The Nature of Proof

Chapter 3 Proof 3.1 The Nature of Proof We begin with a philosophical discussion on the nature of proof. When a person is arrested for a crime and brought to trial, it is assumed that the prosecution has

Exam 1 Answers: Logic and Proof

Q250 FALL 2012, INDIANA UNIVERSITY Exam 1 Answers: Logic and Proof September 17, 2012 Instructions: Please answer each question completely, and show all of your work. Partial credit will be awarded where

(Refer Slide Time: 1:41)

Discrete Mathematical Structures Dr. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture # 10 Sets Today we shall learn about sets. You must

Mathematical Induction

Mathematical Induction Victor Adamchik Fall of 2005 Lecture 2 (out of three) Plan 1. Strong Induction 2. Faulty Inductions 3. Induction and the Least Element Principal Strong Induction Fibonacci Numbers

INTRODUCTORY SET THEORY

M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H-1088 Budapest, Múzeum krt. 6-8. CONTENTS 1. SETS Set, equal sets, subset,

FIRST YEAR CALCULUS. Chapter 7 CONTINUITY. It is a parabola, and we can draw this parabola without lifting our pencil from the paper.

FIRST YEAR CALCULUS WWLCHENW L c WWWL W L Chen, 1982, 2008. 2006. This chapter originates from material used by the author at Imperial College, University of London, between 1981 and 1990. It It is is

Propositional Logic and Methods of Inference SEEM

Propositional Logic and Methods of Inference SEEM 5750 1 Logic Knowledge can also be represented by the symbols of logic, which is the study of the rules of exact reasoning. Logic is also of primary importance

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 1

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 1 Course Outline CS70 is a course on Discrete Mathematics and Probability for EECS Students. The purpose of the course

Predicate Logic. Lucia Moura. Winter Predicates and Quantifiers Nested Quantifiers Using Predicate Calculus

Predicate Logic Winter 2010 Predicates A Predicate is a declarative sentence whose true/false value depends on one or more variables. The statement x is greater than 3 has two parts: the subject: x is

CmSc 175 Discrete Mathematics Lesson 10: SETS A B, A B

CmSc 175 Discrete Mathematics Lesson 10: SETS Sets: finite, infinite, : empty set, U : universal set Describing a set: Enumeration = {a, b, c} Predicates = {x P(x)} Recursive definition, e.g. sequences

Chapter Three. Functions. In this section, we study what is undoubtedly the most fundamental type of relation used in mathematics.

Chapter Three Functions 3.1 INTRODUCTION In this section, we study what is undoubtedly the most fundamental type of relation used in mathematics. Definition 3.1: Given sets X and Y, a function from X to

MATH 55: HOMEWORK #2 SOLUTIONS

MATH 55: HOMEWORK # SOLUTIONS ERIC PETERSON * 1. SECTION 1.5: NESTED QUANTIFIERS 1.1. Problem 1.5.8. Determine the truth value of each of these statements if the domain of each variable consists of all

WOLLONGONG COLLEGE AUSTRALIA. Diploma in Information Technology

First Name: Family Name: Student Number: Class/Tutorial: WOLLONGONG COLLEGE AUSTRALIA A College of the University of Wollongong Diploma in Information Technology Mid-Session Test Summer Session 008-00

Foundations of Computing Discrete Mathematics Solutions to exercises for week 2

Foundations of Computing Discrete Mathematics Solutions to exercises for week 2 Agata Murawska (agmu@itu.dk) September 16, 2013 Note. The solutions presented here are usually one of many possiblities.

MAT Discrete Mathematics

RHODES UNIVERSITY Grahamstown 6140, South Africa Lecture Notes CCR MAT 102 - Discrete Mathematics Claudiu C. Remsing DEPT. of MATHEMATICS (Pure and Applied) 2005 Mathematics is not about calculations but

Logic and Incidence Geometry

Logic and Incidence Geometry February 27, 2013 1 Informal Logic Logic Rule 0. No unstated assumption may be used in a proof. 2 Theorems and Proofs If [hypothesis] then [conclusion]. LOGIC RULE 1. The following

Review for Final Exam

Review for Final Exam Note: Warning, this is probably not exhaustive and probably does contain typos (which I d like to hear about), but represents a review of most of the material covered in Chapters

Lecture Notes in Discrete Mathematics Marcel B. Finan Arkansas Tech University c All Rights Reserved 2 Preface This book is designed for a one semester course in discrete mathematics for sophomore or junior

Computing Science 272 Solutions to Midterm Examination I Tuesday February 8, 2005

Computing Science 272 Solutions to Midterm Examination I Tuesday February 8, 2005 Department of Computing Science University of Alberta Question 1. 8 = 2+2+2+2 pts (a) How many 16-bit strings contain exactly

Oh Yeah? Well, Prove It.

Oh Yeah? Well, Prove It. MT 43A - Abstract Algebra Fall 009 A large part of mathematics consists of building up a theoretical framework that allows us to solve problems. This theoretical framework is built

DISCRETE MATH: LECTURE 3

DISCRETE MATH: LECTURE 3 DR. DANIEL FREEMAN 1. Chapter 2.2 Conditional Statements If p and q are statement variables, the conditional of q by p is If p then q or p implies q and is denoted p q. It is false

Discrete Mathematics. Thomas Goller. July 2013

Discrete Mathematics Thomas Goller July 2013 Contents 1 Mathematics 1 1.1 Axioms..................................... 1 1.2 Definitions................................... 2 1.3 Theorems...................................

SETS. Chapter Overview

Chapter 1 SETS 1.1 Overview This chapter deals with the concept of a set, operations on sets.concept of sets will be useful in studying the relations and functions. 1.1.1 Set and their representations

Math 140a - HW 1 Solutions

Math 140a - HW 1 Solutions Problem 1 (WR Ch 1 #1). If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Given that r is rational, we can write r = a b for some

Axiom A.1. Lines, planes and space are sets of points. Space contains all points.

73 Appendix A.1 Basic Notions We take the terms point, line, plane, and space as undefined. We also use the concept of a set and a subset, belongs to or is an element of a set. In a formal axiomatic approach

Semantics for the Predicate Calculus: Part I

Semantics for the Predicate Calculus: Part I (Version 0.3, revised 6:15pm, April 14, 2005. Please report typos to hhalvors@princeton.edu.) The study of formal logic is based on the fact that the validity

WUCT121. Discrete Mathematics. Logic

WUCT121 Discrete Mathematics Logic 1. Logic 2. Predicate Logic 3. Proofs 4. Set Theory 5. Relations and Functions WUCT121 Logic 1 Section 1. Logic 1.1. Introduction. In developing a mathematical theory,

Clicker Question. Theorems/Proofs and Computational Problems/Algorithms MC215: MATHEMATICAL REASONING AND DISCRETE STRUCTURES

MC215: MATHEMATICAL REASONING AND DISCRETE STRUCTURES Tuesday, 1/21/14 General course Information Sets Reading: [J] 1.1 Optional: [H] 1.1-1.7 Exercises: Do before next class; not to hand in [J] pp. 12-14:

CHAPTER 1 The Foundations: Logic and Proof, Sets, and Functions

Section 1.5 Methods of Proof 1 CHAPTER 1 The Foundations: Logic and Proof, Sets, and Functions SECTION 1.5 Methods of Proof Learning to construct good mathematical proofs takes years. There is no algorithm

Gödel s Theorem: An Incomplete Guide to Its Use and Abuse

Gödel s Theorem: An Incomplete Guide to Its Use and Abuse by Torkel Franzén Summary by Xavier Noria August 2006 fxn@hashref.com This unique exposition of Kurt Gödel s stunning incompleteness theorems for

Section 7.1 First-Order Predicate Calculus predicate Existential Quantifier Universal Quantifier.

Section 7.1 First-Order Predicate Calculus Predicate calculus studies the internal structure of sentences where subjects are applied to predicates existentially or universally. A predicate describes a