MA103 STATEMENTS, PROOF, LOGIC

Size: px
Start display at page:

Download "MA103 STATEMENTS, PROOF, LOGIC"

Transcription

1 MA103 STATEMENTS, PROOF, LOGIC

2 Abstract Mathematics is about making precise mathematical statements and establishing, by proof or disproof, whether these statements are true or false. We start by looking at what this means, concentrating on fairly simple types of mathematical statement, in order to emphasise techniques of proof. Throughout the rest of the course we will use these proof techniques extensively.

3 Some of the things we ll prove to start with are very obvious, but proving even obvious statements can be quite tricky. Need to start by understanding what we mean by statements, and how to prove them, and we need some basic logic.

4 Here are some of the example mathematical statements listed in Section of the notes. (Natural numbers are positive integers). (a) 20 is divisible by 4. (b) 21 is not divisible by 7. (d) 21 is divisible by 3 or 5. (g) For every natural number n, the number n 2 + n is even. (h) There is a natural number n such that 2n = 2 n. (i) If n is even, then n 2 is even. (l) There are no natural numbers m and n such that 2 = m/n. These are all mathematical statements, of different sorts.

5 (a) 20 is divisible by 4. (b) 21 is not divisible by 7. (d) 21 is divisible by 3 or 5. These are straightforward propositions about certain numbers, and these are either true or false. Statement (d) is an example of a compound statement. It s true precisely when either one (or both) of the statements 21 is divisible by 3 and 21 is divisible by 5 is true.

6 (g) For every natural number n, the number n 2 + n is even. This makes an assertion about all natural numbers and is an example of a universal statement.

7 (h) There is a natural number n such that 2n = 2 n. This asserts the existence of a particular number and is an example of an existential statement.

8 (i) If n is even, then n 2 is even. This is as an assertion about all even numbers, and so it is a universal statement, where the universe is all even numbers. But it can also be considered as an implication, asserting that if n happens to be even, then n 2 is even.

9 (l) There are no natural numbers m and n such that 2 = m/n. This asserts the non-existence of a certain pair of numbers (m, n). It says that for all choices of (m, n), it is not the case that m/n = 2. (This is an example of the general rule that a non-existence statement can be thought of as a universal statement, something to be discussed later in more detail.)

10 Can we prove or disproof (show false) these statements at this stage of the course? Well, all except the last one. Let s look at a few of them.

11 (a) 20 is divisible by 4. This is true. Yes, it s obvious! But how do you give a proper proof? Need first to understand exactly what divisible means. For natural numbers n and d, to say that n is divisible by d means precisely that there is some natural number m for which n = md. Since 20 = 5 4, we see that 20 is divisible by 4. And that s a proof! Utterly convincing, watertight, and not open to debate (though not especially exciting).

12 That was easy. But if we didn t know what divisible means, we d have been lost. Definitions are important. We can t prove or disprove statements if we don t know what they mean.

13 Consider the statement 6 is a nice number. Is it true or false? Daft question, since we have no definition of nice.

14 (b) 21 is not divisible by 7. This is FALSE, because 21 is divisible by 7, since 21 = 3 7.

15 (d) 21 is divisible by 3 or 5. Will be true precisely if one (or both) of the following statements is true: (i) 21 is divisible by 3 (ii) 21 is divisible by 5. Statement (i) is true, because 21 = 7 3. Statement (ii) is false. But because at least one of these two statements is true, statement (d) is true.

16 (g) For every natural number n, the number n 2 + n is even. Bit more interesting, this one. How can we prove this, if it is true, or disprove it, if it is false? Think about that...

17 If For every natural number n, the number n 2 + n is even is false, then to prove that it s false all you d need to do is somehow find a natural number N for which N 2 + N is odd, not even. That d be the end of it.

18 But suppose the statement is true. How could you prove it? You could prove it for n = 1, then n = 2, then n = 3, and so on, but at some point we d all be dead and there would still be numbers n that you hadn t yet proved it for. And that simply wouldn t do. So what you need is a more sophisticated, general argument that shows the statement is true for any arbitrary n. That might be difficult.

19 But, actually, the statement is TRUE and it s not so hard to prove. Lots of ways of doing so. We can note that n 2 + n = n(n + 1). The numbers n and n + 1 are consecutive natural numbers. So one of them is odd and one of them is even. When you multiply any odd number and any even number together, you get an even number, so n 2 + n is even. Convinced?

20 If not, let s be more explicit. Let n be a natural number. Either it is even or it is odd. Let s consider each of these cases separately.

21 Suppose n is even. What that means is that, for some integer k, n = 2k. Then n + 1 = 2k + 1 and n(n + 1) = 2k(2k + 1) = 2 (k(2k + 1)). Because k(2k + 1) is an integer, this shows that n 2 + n = n(n + 1) is divisible by 2; that is, it is even.

22 Suppose n is odd. That means we have n = 2k + 1 for some integer k. Then n(n + 1) = (2k + 1)(2k + 2) = 2 ((2k + 1)(k + 1)), which is, again, even, because (2k + 1)(k + 1) is an integer.

23 We ve proved something about infinitely many numbers is a finite amount of time.

24 See the lecture notes for more examples of simple statements and comments on how to prove or disprove them.

25 One thing should come out very clearly from these examples: To prove a mathematical statement, you need to know precisely what it means. That sounds obvious, but you can see how detailed we had to be about the meanings (that is, the definitions) of the terms divisible, even and odd. Definitions are very important.

26 Some basic logic Mathematical statements can be true or false Let s denote true by T and false by F. Given statements, it is possible to form other statements. A technique known as the use of truth tables enables us to define logical operations on statements, and to determine when such statements are true.

27 Negation The negation of a statement P is the statement P (sometimes just denoted not P ), which is defined to be true exactly when P is false. This can be described in the very simple truth table: P P T F F T What does the table signify? Quite simply, it tells us that if P is true then P is false and if P is false then P is true.

28 Example If P is 20 is divisible by 3 then P is 20 is not divisible by 3. Here, P is false and P is true.

29 Conjunction and disjunction There are two very basic ways of combining propositions: and (known as conjunction) and or (known as disjunction). Suppose P and Q are two mathematical statements. Then P and Q, also denoted P Q, and called the conjunction of P and Q, is the statement that is true precisely when both P and Q are true.

30 Example The statement 50 is divisible by 2 and 5 is the conjunction of the two statements 50 is divisible by 2 50 is divisible by 5. It is true because both of these two statements are true.

31 Truth table for the conjunction of P and Q: P Q P Q T T T T F F F T F F F F

32 P or Q, also denoted P Q, called the disjunction of P and Q, is the statement that is true precisely when P, or Q, or both, are true.

33 For example, statement (d) above, which is 21 is divisible by 3 or 5 is the disjunction of the two statements 21 is divisible by 3 21 is divisible by 5. Statement (d) is true because at least one (namely the first) of these two statements is true.

34 Important thing about the mathematical interpretation of the word or. It is always inclusive-or. So P Q is true in the case when P is true, or Q is true, or both. Contrasts with a common use of or in everyday language, where it is often used to specify a choice between mutually exclusive alternatives. (For example You re either with us or against us.)

35 Truth table for the disjunction of P and Q: P Q P Q T T T T F T F T T F F F

36 If-then statements Very important to understand the formal meaning of the word if in mathematics. It is often used sloppily in everyday life, but has a very precise mathematical meaning. Example If it rains, then I wear a raincoat. Suppose this is true. What if it rains? Then you can conclude I will wear a raincoat. What if it does not rain? Well, you can t conclude anything.

37 An if-then statement only tells you about what follows if something particular happens.

38 Suppose P and Q are mathematical statements (each of which can therefore be either true or false). Then the statement denoted P Q ( P implies Q or, equivalently, if P, then Q ), has the following truth table.

39 P Q P Q T T T T F F F T T F F T

40 (This type of statement is known as an if-then statement or an implication.)

41 If you re not sure of the meaning of P Q, might be easier to think about when it is false. It s false when P is true and Q isn t, and only then.

42 The statement P Q can also be written as Q P. There are different ways of describing P Q, such as: if P then Q P implies Q P is sufficient for Q Q if P P only if Q Q whenever P Q is necessary for P.

43 If P Q and Q P then this means that Q will be true precisely when P is. That is, Q is true if and only if P is. We use the single piece of notation P Q.

44 There are several phrases for describing what P Q means, such as: P if and only if Q (sometimes abbreviated to P iff Q ) P is equivalent to Q P is necessary and sufficient for Q Q is necessary and sufficient for P.

45 We have the following truth table for P Q. We ve shown the truth or falsity of P Q and Q P to emphasise that P Q is the same as the conjunction (P Q) (Q P ).

46 P Q P Q Q P P Q T T T T T T F F T F F T T F F F F T T T

47 What the table shows is that P Q is true precisely when P and Q are either both true or both false.

48 Logical equivalence Two statements are logically equivalent if when either one is true, so is the other, and if either one is false, so is the other.

49 Example (P Q) and P Q are logically equivalent. We can see this from the following truth table which shows that, in all cases, the two statements take the same logical value T or F. P Q P Q (P Q) P Q P Q T T T F F F F T F T F F T F F T T F T F F F F F T T T T

50 Logical equivalence of (P Q) and P Q is quite easy to understand. P Q is true means at least one of P, Q is true. So it s therefore false precisely when both P and Q are false. This means P and Q are both true. This means P Q is true.

51 This is common sense! If I tell you I will eat an apple or a banana then this is a false statement (so its negation holds true) when I do not eat an apple and I do not eat a banana.

52 Now that we know the meaning of, we can see that to say that (P Q) and P Q are logically equivalent is to say that (P Q) P Q.

53 Example Let p, q and r be statements. Prove, using a truth table, that if S 1 is the statement (p q) (q r) (r p) and if S 2 is the statement (p q) (q r) (r p), then S 1 and S 2 are logically equivalent.

54 We have the following truth table. p q r p q q r r p S 1 p q q r r p S 2 T T T T T T T T T T T T T F T T T T T F F T T F T T T T T F F T T F T T T T T T F T F T T F F T F T F F F F F F T F T T F F F F F F F F T F T T F F F F F F F F F F F F F F F F As can be seen from the table, the two statements S 1 and S 2 are logically equivalent.

55 Converse statements Given an implication P Q, the reverse implication Q P is known as its converse. Generally, there is no reason why the converse should be true just because the implication is.

56 Example Consider If it is Tuesday, then I buy the Guardian newspaper. The converse is If I buy the Guardian newspaper, then it is Tuesday. Well, I might buy that newspaper on other days too, in which case the implication can be true but the converse false. Or maybe the converse is true. We don t know. It doesn t follow from the initial statement.

57 The truth or falsity of the converse Q P has to be determined separately from that of the implication P Q.

58 Example What s the converse of the statement if the natural number n divides 4 then n divides 12? Is the converse true? Is the original statement true? Here, the statement is P Q where P is n divides 4 and Q is n divides 12. Converse is Q P : if n divides 12 then n divides 4. This is false. The original statement is true, however.

59 Contrapositive statements The contrapositive of P Q is the statement Q P. The contrapositive is logically equivalent to the implication, as the following truth table shows.

60 P Q P Q P Q Q P T T T F F T T F F F T F F T T T F T F F T T T T

61 This is common sense! For, Q P says that if Q is false, P is false also. So, we cannot have Q false and P true. That s exactly the same information as P Q.

62 What s the point of this? Well, sometimes you might want to prove P Q and it will, in fact, be easier to prove instead the equivalent (contrapositive) statement Q P.

63 Example (from Biggs) We ll prove: if n 4 and n is a prime number, then n + 1 is not a perfect square. (A perfect square is a number of the form m 2 for some positive integer m.)

64 Statement is P Q, where P is n 4 and n is prime Q is n + 1 is not a perfect square We prove the statement by proving its contrapositive Q P (which, remember, is logically equivalent). Q: (n + 1 is not a perfect square), which is n + 1 is a perfect square. P : (n 4 and n is prime), which is n < 4 or n is not prime.

65 So we prove: If n + 1 is a perfect square, then n < 4 or n is not prime. Suppose n + 1 is a perfect square. Then n + 1 = m 2 for some positive integer m. So n = m 2 1 = (m 1)(m + 1). If m 1 > 1, this shows that n has factors other than 1 and itself. So it is not prime. If m 1 = 1 then m = 2 and n = = 3, so n < 4. We re done!

66 Example Is the following statement about natural numbers n true or false? Justify your answer by giving a proof or a counterexample: If n is divisible by 6 then n is divisible by 3. What are the converse and contrapositive of this statement? Is the converse true? Is the contrapositive true?

67 If n is divisible by 6 then n is divisible by 3. Statement is true. For, suppose n is divisible by 6. Then for some m N, n = 6m, so n = 3(2m) and since 2m N, n is divisible by 3. The converse is If n is divisible by 3 then n is divisible by 6. This is false. For example, n = 3 is a counterexample: it is divisible by 3, but not by 6. The contrapositive is If n is not divisible by 3 then n is not divisible by 6. This is true, because it is logically equivalent to the initial statement, which we have proved to be true. (No need to do any more.)

68 Note, by the way, that these proofs were written in English.

69 Working backwards to obtain a proof Some statements are difficult to prove directly. It is sometimes easier to work backwards. Example Prove: if a, b are real numbers and a b, then ab < (a 2 + b 2 )/2. Let s start with what we want to prove. This is ab < (a 2 + b 2 )/2, which can be rewritten as a 2 + b 2 2ab > 0. Now, this is (a b) 2 > 0 and now you can see why it is true: a b means a b 0 and so (a b) 2 > 0

70 A nice proof is a reverse of this argument, as follows: Proof Since a b, a b 0 and, hence, (a b) 2 > 0. But (a b) 2 = a 2 + b 2 2ab. So we have a 2 + b 2 > 2ab and, therefore, ab < (a 2 + b 2 )/2, as required. But you might have wondered where on earth this had come from if I hadn t shown you how we get it by working backwards.

71 Trade secret: Behind many lovely, succinct, proofs lies hours of agony, frustration and disappointment, followed by a Eureka moment and a sense of elation and accomplishment. (And there will also be lots of scrap paper.)

72 Writing Mathematics Mathematics is a language and what you write has to make good sense. The words used in proofs, and the punctuation, should make it easy to read and give it a structure and an argument. Don t overuse symbols. You should be using words like so, hence, therefore, since, because, and so on.

73 Don t over-use notation. Use words. Don t start sentences with symbols Write in sentences, and grammatically Be clear. Tell the reader what you re doing. If you can find a shorter, snappier, proof, then do

74 I m sorry this letter is so long; I didn t have time to make it shorter. George Bernard Shaw (or Mark Twain or Blaise Pascal??)

Introducing Proof 1. hsn.uk.net. Contents

Introducing Proof 1. hsn.uk.net. Contents Contents 1 1 Introduction 1 What is proof? 1 Statements, Definitions and Euler Diagrams 1 Statements 1 Definitions Our first proof Euler diagrams 4 3 Logical Connectives 5 Negation 6 Conjunction 7 Disjunction

More information

Proofs. Joe Patten August 10, 2018

Proofs. Joe Patten August 10, 2018 Proofs Joe Patten August 10, 2018 1 Statements and Open Sentences 1.1 Statements A statement is a declarative sentence or assertion that is either true or false. They are often labelled with a capital

More information

Foundation of proofs. Jim Hefferon.

Foundation of proofs. Jim Hefferon. Foundation of proofs Jim Hefferon http://joshua.smcvt.edu/proofs The need to prove In Mathematics we prove things To a person with a mathematical turn of mind, the base angles of an isoceles triangle are

More information

Writing Mathematical Proofs

Writing Mathematical Proofs Writing Mathematical Proofs Dr. Steffi Zegowitz The main resources for this course are the two following books: Mathematical Proofs by Chartrand, Polimeni, and Zhang How to Think Like a Mathematician by

More information

3 The language of proof

3 The language of proof 3 The language of proof After working through this section, you should be able to: (a) understand what is asserted by various types of mathematical statements, in particular implications and equivalences;

More information

Section 3.1: Direct Proof and Counterexample 1

Section 3.1: Direct Proof and Counterexample 1 Section 3.1: Direct Proof and Counterexample 1 In this chapter, we introduce the notion of proof in mathematics. A mathematical proof is valid logical argument in mathematics which shows that a given conclusion

More information

LECTURE 1. Logic and Proofs

LECTURE 1. Logic and Proofs LECTURE 1 Logic and Proofs The primary purpose of this course is to introduce you, most of whom are mathematics majors, to the most fundamental skills of a mathematician; the ability to read, write, and

More information

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 1

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 1 EECS 70 Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 1 Getting Started In order to be fluent in mathematical statements, you need to understand the basic framework of the language

More information

Basic Logic and Proof Techniques

Basic Logic and Proof Techniques Chapter 3 Basic Logic and Proof Techniques Now that we have introduced a number of mathematical objects to study and have a few proof techniques at our disposal, we pause to look a little more closely

More information

Topic 1: Propositional logic

Topic 1: Propositional logic Topic 1: Propositional logic Guy McCusker 1 1 University of Bath Logic! This lecture is about the simplest kind of mathematical logic: propositional calculus. We discuss propositions, which are statements

More information

Before you get started, make sure you ve read Chapter 1, which sets the tone for the work we will begin doing here.

Before you get started, make sure you ve read Chapter 1, which sets the tone for the work we will begin doing here. Chapter 2 Mathematics and Logic Before you get started, make sure you ve read Chapter 1, which sets the tone for the work we will begin doing here. 2.1 A Taste of Number Theory In this section, we will

More information

Some Review Problems for Exam 1: Solutions

Some Review Problems for Exam 1: Solutions Math 3355 Fall 2018 Some Review Problems for Exam 1: Solutions Here is my quick review of proof techniques. I will focus exclusively on propositions of the form p q, or more properly, x P (x) Q(x) or x

More information

1.1 Statements and Compound Statements

1.1 Statements and Compound Statements Chapter 1 Propositional Logic 1.1 Statements and Compound Statements A statement or proposition is an assertion which is either true or false, though you may not know which. That is, a statement is something

More information

CS70 is a course about on Discrete Mathematics for Computer Scientists. The purpose of the course is to teach you about:

CS70 is a course about on Discrete Mathematics for Computer Scientists. The purpose of the course is to teach you about: CS 70 Discrete Mathematics for CS Fall 2006 Papadimitriou & Vazirani Lecture 1 Course Outline CS70 is a course about on Discrete Mathematics for Computer Scientists. The purpose of the course is to teach

More information

The statement calculus and logic

The statement calculus and logic Chapter 2 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 You will have encountered several languages

More information

PHIL 422 Advanced Logic Inductive Proof

PHIL 422 Advanced Logic Inductive Proof PHIL 422 Advanced Logic Inductive Proof 1. Preamble: One of the most powerful tools in your meta-logical toolkit will be proof by induction. Just about every significant meta-logical result relies upon

More information

Basics of Proofs. 1 The Basics. 2 Proof Strategies. 2.1 Understand What s Going On

Basics of Proofs. 1 The Basics. 2 Proof Strategies. 2.1 Understand What s Going On Basics of Proofs The Putnam is a proof based exam and will expect you to write proofs in your solutions Similarly, Math 96 will also require you to write proofs in your homework solutions If you ve seen

More information

Examples: P: it is not the case that P. P Q: P or Q P Q: P implies Q (if P then Q) Typical formula:

Examples: P: it is not the case that P. P Q: P or Q P Q: P implies Q (if P then Q) Typical formula: Logic: The Big Picture Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about time (and

More information

Logic, Sets, and Proofs

Logic, Sets, and Proofs Logic, Sets, and Proofs David A. Cox and Catherine C. McGeoch Amherst College 1 Logic Logical Operators. A logical statement is a mathematical statement that can be assigned a value either true or false.

More information

Inference and Proofs (1.6 & 1.7)

Inference and Proofs (1.6 & 1.7) EECS 203 Spring 2016 Lecture 4 Page 1 of 9 Introductory problem: Inference and Proofs (1.6 & 1.7) As is commonly the case in mathematics, it is often best to start with some definitions. An argument for

More information

Discrete Mathematics and Probability Theory Fall 2012 Vazirani Note 1

Discrete Mathematics and Probability Theory Fall 2012 Vazirani Note 1 CS 70 Discrete Mathematics and Probability Theory Fall 2012 Vazirani Note 1 Course Outline CS70 is a course on "Discrete Mathematics and Probability for Computer Scientists." The purpose of the course

More information

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

Theorem. For every positive integer n, the sum of the positive integers from 1 to n is n(n+1) Week 1: Logic Lecture 1, 8/1 (Sections 1.1 and 1.3) Examples of theorems and proofs Theorem (Pythagoras). Let ABC be a right triangle, with legs of lengths a and b, and hypotenuse of length c. Then a +

More information

Writing proofs for MATH 51H Section 2: Set theory, proofs of existential statements, proofs of uniqueness statements, proof by cases

Writing proofs for MATH 51H Section 2: Set theory, proofs of existential statements, proofs of uniqueness statements, proof by cases Writing proofs for MATH 51H Section 2: Set theory, proofs of existential statements, proofs of uniqueness statements, proof by cases September 22, 2018 Recall from last week that the purpose of a proof

More information

cis32-ai lecture # 18 mon-3-apr-2006

cis32-ai lecture # 18 mon-3-apr-2006 cis32-ai lecture # 18 mon-3-apr-2006 today s topics: propositional logic cis32-spring2006-sklar-lec18 1 Introduction Weak (search-based) problem-solving does not scale to real problems. To succeed, problem

More information

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

Connectives Name Symbol OR Disjunction And Conjunction If then Implication/ conditional If and only if Bi-implication / biconditional Class XI Mathematics Ch. 14 Mathematical Reasoning 1. Statement: A sentence which is either TRUE or FALSE but not both is known as a statement. eg. i) 2 + 2 = 4 ( it is a statement which is true) ii) 2

More information

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

Conjunction: p q is true if both p, q are true, and false if at least one of p, q is false. The truth table for conjunction is as follows. Chapter 1 Logic 1.1 Introduction and Definitions Definitions. A sentence (statement, proposition) is an utterance (that is, a string of characters) which is either true (T) or false (F). A predicate is

More information

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

Unit 1. Propositional Logic Reading do all quick-checks Propositional Logic: Ch. 2.intro, 2.2, 2.3, 2.4. Review 2.9 Unit 1. Propositional Logic Reading do all quick-checks Propositional Logic: Ch. 2.intro, 2.2, 2.3, 2.4. Review 2.9 Typeset September 23, 2005 1 Statements or propositions Defn: A statement is an assertion

More information

Math 38: Graph Theory Spring 2004 Dartmouth College. On Writing Proofs. 1 Introduction. 2 Finding A Solution

Math 38: Graph Theory Spring 2004 Dartmouth College. On Writing Proofs. 1 Introduction. 2 Finding A Solution Math 38: Graph Theory Spring 2004 Dartmouth College 1 Introduction On Writing Proofs What constitutes a well-written proof? A simple but rather vague answer is that a well-written proof is both clear and

More information

Mathematical Logic Part One

Mathematical Logic Part One Mathematical Logic Part One Question: How do we formalize the defnitions and reasoning we use in our proofs? Where We're Going Propositional Logic (Today) Basic logical connectives. Truth tables. Logical

More information

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

3/29/2017. Logic. Propositions and logical operations. Main concepts: propositions truth values propositional variables logical operations Logic Propositions and logical operations Main concepts: propositions truth values propositional variables logical operations 1 Propositions and logical operations A proposition is the most basic element

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

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

Mathematical Reasoning. The Foundation of Algorithmics

Mathematical Reasoning. The Foundation of Algorithmics Mathematical Reasoning The Foundation of Algorithmics The Nature of Truth In mathematics, we deal with statements that are True or False This is known as The Law of the Excluded Middle Despite the fact

More information

Logic and Proofs. (A brief summary)

Logic and Proofs. (A brief summary) Logic and Proofs (A brief summary) Why Study Logic: To learn to prove claims/statements rigorously To be able to judge better the soundness and consistency of (others ) arguments To gain the foundations

More information

Math 300 Introduction to Mathematical Reasoning Autumn 2017 Proof Templates 1

Math 300 Introduction to Mathematical Reasoning Autumn 2017 Proof Templates 1 Math 300 Introduction to Mathematical Reasoning Autumn 2017 Proof Templates 1 In its most basic form, a mathematical proof is just a sequence of mathematical statements, connected to each other by strict

More information

Math Real Analysis

Math Real Analysis 1 / 28 Math 370 - Real Analysis G.Pugh Sep 3 2013 Real Analysis 2 / 28 3 / 28 What is Real Analysis? Wikipedia: Real analysis... has its beginnings in the rigorous formulation of calculus. It is a branch

More information

HOW TO CREATE A PROOF. Writing proofs is typically not a straightforward, algorithmic process such as calculating

HOW TO CREATE A PROOF. Writing proofs is typically not a straightforward, algorithmic process such as calculating HOW TO CREATE A PROOF ALLAN YASHINSKI Abstract We discuss how to structure a proof based on the statement being proved Writing proofs is typically not a straightforward, algorithmic process such as calculating

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

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

CMPSCI 250: Introduction to Computation. Lecture 11: Proof Techniques David Mix Barrington 5 March 2013

CMPSCI 250: Introduction to Computation. Lecture 11: Proof Techniques David Mix Barrington 5 March 2013 CMPSCI 250: Introduction to Computation Lecture 11: Proof Techniques David Mix Barrington 5 March 2013 Proof Techniques Review: The General Setting for Proofs Types of Proof: Direct, Contraposition, Contradiction

More information

THE LOGIC OF QUANTIFIED STATEMENTS. Predicates and Quantified Statements I. Predicates and Quantified Statements I CHAPTER 3 SECTION 3.

THE LOGIC OF QUANTIFIED STATEMENTS. Predicates and Quantified Statements I. Predicates and Quantified Statements I CHAPTER 3 SECTION 3. CHAPTER 3 THE LOGIC OF QUANTIFIED STATEMENTS SECTION 3.1 Predicates and Quantified Statements I Copyright Cengage Learning. All rights reserved. Copyright Cengage Learning. All rights reserved. Predicates

More information

Mathematical Logic Part One

Mathematical Logic Part One Mathematical Logic Part One Question: How do we formalize the definitions and reasoning we use in our proofs? Where We're Going Propositional Logic (oday) Basic logical connectives. ruth tables. Logical

More information

Writing proofs for MATH 61CM, 61DM Week 1: basic logic, proof by contradiction, proof by induction

Writing proofs for MATH 61CM, 61DM Week 1: basic logic, proof by contradiction, proof by induction Writing proofs for MATH 61CM, 61DM Week 1: basic logic, proof by contradiction, proof by induction written by Sarah Peluse, revised by Evangelie Zachos and Lisa Sauermann September 27, 2016 1 Introduction

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

MCS-236: Graph Theory Handout #A4 San Skulrattanakulchai Gustavus Adolphus College Sep 15, Methods of Proof

MCS-236: Graph Theory Handout #A4 San Skulrattanakulchai Gustavus Adolphus College Sep 15, Methods of Proof MCS-36: Graph Theory Handout #A4 San Skulrattanakulchai Gustavus Adolphus College Sep 15, 010 Methods of Proof Consider a set of mathematical objects having a certain number of operations and relations

More information

Logic. Propositional Logic: Syntax

Logic. Propositional Logic: Syntax Logic Propositional Logic: Syntax Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about

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

Direct Proof and Counterexample I:Introduction

Direct Proof and Counterexample I:Introduction Direct Proof and Counterexample I:Introduction Copyright Cengage Learning. All rights reserved. Goal Importance of proof Building up logic thinking and reasoning reading/using definition interpreting :

More information

Manual of Logical Style (fresh version 2018)

Manual of Logical Style (fresh version 2018) Manual of Logical Style (fresh version 2018) Randall Holmes 9/5/2018 1 Introduction This is a fresh version of a document I have been working on with my classes at various levels for years. The idea that

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

Direct Proof and Counterexample I:Introduction. Copyright Cengage Learning. All rights reserved.

Direct Proof and Counterexample I:Introduction. Copyright Cengage Learning. All rights reserved. Direct Proof and Counterexample I:Introduction Copyright Cengage Learning. All rights reserved. Goal Importance of proof Building up logic thinking and reasoning reading/using definition interpreting statement:

More information

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

Contradiction MATH Contradiction. Benjamin V.C. Collins, James A. Swenson MATH 2730 MATH 2730 Contradiction Benjamin V.C. Collins James A. Swenson Contrapositive The contrapositive of the statement If A, then B is the statement If not B, then not A. A statement and its contrapositive

More information

Proof Techniques (Review of Math 271)

Proof Techniques (Review of Math 271) Chapter 2 Proof Techniques (Review of Math 271) 2.1 Overview This chapter reviews proof techniques that were probably introduced in Math 271 and that may also have been used in a different way in Phil

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

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

Numbers that are divisible by 2 are even. The above statement could also be written in other logically equivalent ways, such as: 3.4 THE CONDITIONAL & BICONDITIONAL Definition. Any statement that can be put in the form If p, then q, where p and q are basic statements, is called a conditional statement and is written symbolically

More information

Foundations of Advanced Mathematics, version 0.8. Jonathan J. White

Foundations of Advanced Mathematics, version 0.8. Jonathan J. White Foundations of Advanced Mathematics, version 0.8 Jonathan J. White 1/4/17 2 Chapter 1 Basic Number Theory and Logic Forward These notes are intended to provide a solid background for the study of abstract

More information

Truth-Functional Logic

Truth-Functional Logic Truth-Functional Logic Syntax Every atomic sentence (A, B, C, ) is a sentence and are sentences With ϕ a sentence, the negation ϕ is a sentence With ϕ and ψ sentences, the conjunction ϕ ψ is a sentence

More information

Logic. Quantifiers. (real numbers understood). x [x is rotten in Denmark]. x<x+x 2 +1

Logic. Quantifiers. (real numbers understood). x [x is rotten in Denmark]. x<x+x 2 +1 Logic One reason for studying logic is that we need a better notation than ordinary English for expressing relationships among various assertions or hypothetical states of affairs. A solid grounding in

More information

Discrete Structures for Computer Science

Discrete Structures for Computer Science Discrete Structures for Computer Science William Garrison bill@cs.pitt.edu 6311 Sennott Square Lecture #2: Propositional Logic Based on materials developed by Dr. Adam Lee Today s Topic: Propositional

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

Chapter 1 Elementary Logic

Chapter 1 Elementary Logic 2017-2018 Chapter 1 Elementary Logic The study of logic is the study of the principles and methods used in distinguishing valid arguments from those that are not valid. The aim of this chapter is to help

More information

CS1021. Why logic? Logic about inference or argument. Start from assumptions or axioms. Make deductions according to rules of reasoning.

CS1021. Why logic? Logic about inference or argument. Start from assumptions or axioms. Make deductions according to rules of reasoning. 3: Logic Why logic? Logic about inference or argument Start from assumptions or axioms Make deductions according to rules of reasoning Logic 3-1 Why logic? (continued) If I don t buy a lottery ticket on

More information

CS 360, Winter Morphology of Proof: An introduction to rigorous proof techniques

CS 360, Winter Morphology of Proof: An introduction to rigorous proof techniques CS 30, Winter 2011 Morphology of Proof: An introduction to rigorous proof techniques 1 Methodology of Proof An example Deep down, all theorems are of the form If A then B, though they may be expressed

More information

Introduction to Logic and Axiomatic Set Theory

Introduction to Logic and Axiomatic Set Theory Introduction to Logic and Axiomatic Set Theory 1 Introduction In mathematics, we seek absolute rigor in our arguments, and a solid foundation for all of the structures we consider. Here, we will see some

More information

Preparing for the CS 173 (A) Fall 2018 Midterm 1

Preparing for the CS 173 (A) Fall 2018 Midterm 1 Preparing for the CS 173 (A) Fall 2018 Midterm 1 1 Basic information Midterm 1 is scheduled from 7:15-8:30 PM. We recommend you arrive early so that you can start exactly at 7:15. Exams will be collected

More information

Proofs: A General How To II. Rules of Inference. Rules of Inference Modus Ponens. Rules of Inference Addition. Rules of Inference Conjunction

Proofs: A General How To II. Rules of Inference. Rules of Inference Modus Ponens. Rules of Inference Addition. Rules of Inference Conjunction Introduction I Proofs Computer Science & Engineering 235 Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu A proof is a proof. What kind of a proof? It s a proof. A proof is a proof. And when

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

Proofs. Introduction II. Notes. Notes. Notes. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Fall 2007

Proofs. Introduction II. Notes. Notes. Notes. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Fall 2007 Proofs Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Fall 2007 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 1.5, 1.6, and 1.7 of Rosen cse235@cse.unl.edu

More information

For all For every For each For any There exists at least one There exists There is Some

For all For every For each For any There exists at least one There exists There is Some Section 1.3 Predicates and Quantifiers Assume universe of discourse is all the people who are participating in this course. Also let us assume that we know each person in the course. Consider the following

More information

Test of Mathematics for University Admission. Notes on Logic and Proof. October 2018

Test of Mathematics for University Admission. Notes on Logic and Proof. October 2018 Test of Mathematics for University Admission Notes on Logic and Proof October 2018 Version 1.1 July 2017 Notes for Paper 2 of The Test of Mathematics for University Admission You should check the website

More information

Supplementary Logic Notes CSE 321 Winter 2009

Supplementary Logic Notes CSE 321 Winter 2009 1 Propositional Logic Supplementary Logic Notes CSE 321 Winter 2009 1.1 More efficient truth table methods The method of using truth tables to prove facts about propositional formulas can be a very tedious

More information

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

Logic Overview, I. and T T T T F F F T F F F F Logic Overview, I DEFINITIONS A statement (proposition) is a declarative sentence that can be assigned a truth value T or F, but not both. Statements are denoted by letters p, q, r, s,... The 5 basic logical

More information

Direct Proofs. the product of two consecutive integers plus the larger of the two integers

Direct Proofs. the product of two consecutive integers plus the larger of the two integers Direct Proofs A direct proof uses the facts of mathematics and the rules of inference to draw a conclusion. Since direct proofs often start with premises (given information that goes beyond the facts of

More information

MATH CSE20 Homework 5 Due Monday November 4

MATH CSE20 Homework 5 Due Monday November 4 MATH CSE20 Homework 5 Due Monday November 4 Assigned reading: NT Section 1 (1) Prove the statement if true, otherwise find a counterexample. (a) For all natural numbers x and y, x + y is odd if one of

More information

A Little Deductive Logic

A Little Deductive Logic A Little Deductive Logic In propositional or sentential deductive logic, we begin by specifying that we will use capital letters (like A, B, C, D, and so on) to stand in for sentences, and we assume that

More information

Math 13, Spring 2013, Lecture B: Midterm

Math 13, Spring 2013, Lecture B: Midterm Math 13, Spring 2013, Lecture B: Midterm Name Signature UCI ID # E-mail address Each numbered problem is worth 12 points, for a total of 84 points. Present your work, especially proofs, as clearly as possible.

More information

One-to-one functions and onto functions

One-to-one functions and onto functions MA 3362 Lecture 7 - One-to-one and Onto Wednesday, October 22, 2008. Objectives: Formalize definitions of one-to-one and onto One-to-one functions and onto functions At the level of set theory, there are

More information

Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand Note 2

Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand Note 2 CS 70 Discrete Mathematics and Probability Theory Fall 016 Seshia and Walrand Note 1 Proofs In science, evidence is accumulated through experiments to assert the validity of a statement. Mathematics, in

More information

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

Section 1.3. Let I be a set. When I is used in the following context, Section 1.3. Let I be a set. When I is used in the following context, {B i } i I, we call I the index set. The set {B i } i I is the family of sets of the form B i where i I. One could also use set builder

More information

1 Propositional Logic

1 Propositional Logic 1 Propositional Logic Required reading: Foundations of Computation. Sections 1.1 and 1.2. 1. Introduction to Logic a. Logical consequences. If you know all humans are mortal, and you know that you are

More information

Proof. Theorems. Theorems. Example. Example. Example. Part 4. The Big Bang Theory

Proof. Theorems. Theorems. Example. Example. Example. Part 4. The Big Bang Theory Proof Theorems Part 4 The Big Bang Theory Theorems A theorem is a statement we intend to prove using existing known facts (called axioms or lemmas) Used extensively in all mathematical proofs which should

More information

Intermediate Logic. Natural Deduction for TFL

Intermediate Logic. Natural Deduction for TFL Intermediate Logic Lecture Two Natural Deduction for TFL Rob Trueman rob.trueman@york.ac.uk University of York The Trouble with Truth Tables Natural Deduction for TFL The Trouble with Truth Tables The

More information

MATH10040: Chapter 0 Mathematics, Logic and Reasoning

MATH10040: Chapter 0 Mathematics, Logic and Reasoning MATH10040: Chapter 0 Mathematics, Logic and Reasoning 1. What is Mathematics? There is no definitive answer to this question. 1 Indeed, the answer given by a 21st-century mathematician would differ greatly

More information

Logic. Propositional Logic: Syntax. Wffs

Logic. Propositional Logic: Syntax. Wffs Logic Propositional Logic: Syntax Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about

More information

COMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University

COMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University COMP 182 Algorithmic Thinking Proofs Luay Nakhleh Computer Science Rice University 1 Reading Material Chapter 1, Section 3, 6, 7, 8 Propositional Equivalences The compound propositions p and q are called

More information

A Little Deductive Logic

A Little Deductive Logic A Little Deductive Logic In propositional or sentential deductive logic, we begin by specifying that we will use capital letters (like A, B, C, D, and so on) to stand in for sentences, and we assume that

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

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

Propositional Logic: Syntax

Propositional Logic: Syntax Logic Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about time (and programs) epistemic

More information

1 Implication and induction

1 Implication and induction 1 Implication and induction This chapter is about various kinds of argument which are used in mathematical proofs. When you have completed it, you should know what is meant by implication and equivalence,

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 III. Basic Proof Techniques. Proving the obvious has never been easy. Marty Rubin

Chapter III. Basic Proof Techniques. Proving the obvious has never been easy. Marty Rubin Chapter III Basic Proof Techniques Proving the obvious has never been easy. Marty Rubin The last two chapters were an introduction to the language of mathematics. Knowing the definitions and concepts of

More information

Logic and Mathematics:

Logic and Mathematics: Logic and Mathematics: Mathematicians in Schools Program Lashi Bandara Mathematical Sciences Institute, Australian National University April 21, 2011 Contents 1 Russell s Paradox 1 2 Propositional Logic

More information

Section 1.1: Logical Form and Logical Equivalence

Section 1.1: Logical Form and Logical Equivalence Section 1.1: Logical Form and Logical Equivalence An argument is a sequence of statements aimed at demonstrating the truth of an assertion. The assertion at the end of an argument is called the conclusion,

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

Logic and Proofs. (A brief summary)

Logic and Proofs. (A brief summary) Logic and Proofs (A brief summary) Why Study Logic: To learn to prove claims/statements rigorously To be able to judge better the soundness and consistency of (others ) arguments To gain the foundations

More information

Section 1.1 Propositions

Section 1.1 Propositions Set Theory & Logic Section 1.1 Propositions Fall, 2009 Section 1.1 Propositions In Chapter 1, our main goals are to prove sentences about numbers, equations or functions and to write the proofs. Definition.

More information

irst we need to know that there are many ways to indicate multiplication; for example the product of 5 and 7 can be written in a variety of ways:

irst we need to know that there are many ways to indicate multiplication; for example the product of 5 and 7 can be written in a variety of ways: CH 2 VARIABLES INTRODUCTION F irst we need to know that there are many ways to indicate multiplication; for example the product of 5 and 7 can be written in a variety of ways: 5 7 5 7 5(7) (5)7 (5)(7)

More information

Chapter 2. Mathematical Reasoning. 2.1 Mathematical Models

Chapter 2. Mathematical Reasoning. 2.1 Mathematical Models Contents Mathematical Reasoning 3.1 Mathematical Models........................... 3. Mathematical Proof............................ 4..1 Structure of Proofs........................ 4.. Direct Method..........................

More information

Mat 243 Exam 1 Review

Mat 243 Exam 1 Review OBJECTIVES (Review problems: on next page) 1.1 Distinguish between propositions and non-propositions. Know the truth tables (i.e., the definitions) of the logical operators,,,, and Write truth tables for

More information