# MATHS 315 Mathematical Logic

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 MATHS 315 Mathematical Logic Second Semester, 2006

2 Contents 2 Formal Statement Logic Post production systems The system L The Deduction Theorem for L Truth assignments Adequacy of L Countable sets The Adequacy Theorem for L

3 Chapter 2 Formal Statement Logic In our discussion so far we have seen two approaches to proof of logical equivalence. The first was a semantic approach, where we give meaning to the statement forms (via truth tables) and to what it means for the statement forms to be logically equivalent (that they have the same truth table). The second is to give a syntactic approach where we gave rules for manipulating the statement forms (the logical laws) and gave a syntactic meaning to logical equivalence (that it was possible to use the logical laws to transform one statement form into the other). This raises the question of whether the two approaches are equivalent: whether our syntactic method is sound and adequate to capture the semantic meaning. We will now push this syntactic approach a bit further. 2.1 Post production systems We will give what is called a Post production system for statement logic. To specify such a system S we must provide a set of symbols, called the alphabet of S; rules for deciding which strings of symbols from the alphabet are well-formed formulas of S (or wffs of S); a set of well-formed formulas, which are the axioms of S; and one or more rules of inference in S. Let Σ {A} be a set of wffs. A derivation of A from Σ is a sequence B 1, B 2,..., B n of wffs of S such that each B i is an axiom, an element of Σ, or follows from one or more earlier terms in the sequence by one of the rules of deduction, and such that B n = A. 1

4 If there exists such a derivation, we write Σ S A. If Σ =, we just write S A. In this case we say that A is a theorem of S. Examples of Post production systems 1. The formal system F is as follows: Alphabet: {A, U, B} Wff s: all strings Single axiom: U Rules: From x infer Ax From x infer xb. Then x is a theorem if and only if x is of the form AA }{{... A} U BB }{{... B}, i j which we abbreviate to A i UB j for some i, j N. Consider the derivation: U, AU, AAU,... A i U, A i UB,... A i UB j. Hence A i UB j is a theorem. Now suppose B 1,..., B n = x is a derivation. We show by induction that each B k, 1 k n is of the required form. For k = 1, B 1 is U. So it is of the required form where i = j = 0. For k > 1, if B k = U we are done. Otherwise, B k was obtained from B l, l < k via some rule. By inductive hypothesis B l = A r UB s. Then B k = A r+1 UB s if it was the first rule, and B k = A r UB s+1 if it was the second. Either way, B k has the required form. Describe the set of theorems of F. Prove your claim. 2. The MU puzzle The MU puzzle is from Douglas Hofstadter s Gödel, Escher, Bach: an Eternal Golden Braid. We will call this system M. The alphabet of M is {M, I, U}. The well-formed formulas are all strings of the form Mx where x is a non-empty string of Is and Us. The only axiom is MI. There are four rules of inference: here x and y represent any string (possibly empty) of symbols from the alphabet. Rule 1: From xi infer xiu. Rule 2: From Mx infer Mxx. MATHS 315 Lecture notes Page 2 of 31

5 Rule 3: From MxIIIy infer MxUy. Rule 4: From MxUUy infer Mxy. For example, MIUIU is a theorem of M. To see this, we provide the following derivation: Some observations: 1. MI Axiom 2. MII From 1 by rule MIIII From 2 by rule MIU From 1 by rule MIUIU From 4 by rule 2. Strictly speaking, the derivation is just the sequence MI, MII, MIIII, MIU, MIUIU. However, whenever we present a derivation we will also present the number and the justification for each term in this way. The derivation could be made shorter by omitting 2 and 3, which are not used later. In practice, we usually make sure that our derivations do not include any redundant steps like this. Example 2.1. Show that MIIIUII and MUIU are theorems of the post production system M. The MU puzzle is the following question: is the string MU a theorem of M? One important point is that there is no systematic way of finding a derivation of a particular wff which we hope might be a theorem. We can systematically consider all possible derivations, and if we ever find a derivation of our favourite wff then we know at once that it is a theorem. However, if we just keep trying to find a derivation, but have not yet succeeded, that does not tell us that we will never find a derivation if we keep trying for long enough. MATHS 315 Lecture notes Page 3 of 31

6 To show that a wff is not a theorem of M, we must find some property which every theorem of M has but which our wff does not have. For example, the following result shows us that MU is not a theorem of M. Theorem 2.2. Let x be a theorem of M. Then the number of Is in x is not a multiple of 3. Proof. For a wff A, let i(a) be the number of Is in A. Let B 1, B 2,..., B n be a derivation in M. We prove by induction on k that i(b k ) is congruent to 1 or 2 modulo 3. Base step: B 1 must be the axiom MI, so i(b 1 ) = 1 1 (mod 3). Inductive step: Suppose 1 < k n, and the result holds for each B j with 1 j < k. B k must be either the axiom MI (in which case the result holds as for the base step) or must follow from some B j for j < k by one of the four rules of inference. Case 1: If B k follows from B j by Rule 1, then i(b k ) = i(b j ), so the result holds for B k. Case 2: If B k follows from B j by Rule 2, then i(b k ) = 2i(B j ). If i(b j ) 1 (mod 3) then i(b k ) 2 (mod 3), and if i(b j ) 2 (mod 3) then i(b k ) 4 1 (mod 3), so either way the result holds for B k. Case 3: If B k follows from B j by Rule 3, then i(b k ) = i(b j ) 3, so i(b k ) i(b j ) (mod 3), and so the result holds for B k. Case 4: If B k follows from B j by Rule 4, then i(b k ) = i(b j ), so the result holds for B k. So in any case, i(b k ) is congruent to 1 or 2 modulo 3. Hence, by induction, i(b k ) is congruent to 1 or 2 modulo 3 for all k. In particular, i(b n ) is not a multiple of 3. Exercises 1. The formal system G is as follows: Alphabet: {A, B, M} Wff s: all strings Axiom: M Rule: From x infer AxB Prove that x is a theorem of G if and only if x is of the form A i UB i for some i N. 2. (a) If k is a power of 2, show that MI... I (k many I s) is a theorem in M. MATHS 315 Lecture notes Page 4 of 31

7 (b) Show that for each string x consisting of I s and U s only, {MxIII} M Mx. (c) Show that if 3 does not divide m, then MI... I (m many I s) is a theorem in M. (d) Use (a) to (c) to prove the following characterisation of the theorems in M: Let x be any string of symbols I, U. If 3 does not divide the number of I s in x, then Mx is a theorem. 2.2 The system L We will now consider a Post production system L which is a bit more relevant to our studies. The alphabet of L is {,, (, )} { p n n N }. We refer to the symbols p n as statement variables. The wffs are those strings of symbols which can be built using the following rules: for every n N, p n is a wff if A is a wff then so is A if A and B are wffs then so is (A B). The axioms are given by the following three schemes. Let A, B and C be wffs. Then L1 (A (B A)) is an axiom L2 ((A (B C)) ((A B) (A C))) is an axiom L3 (( A B) (( A B) A)) is an axiom The only rule of inference is modus ponens: from A and (A B) infer B. Example 2.3. Show that L1, L2 and L3 are tautologies. The following derivation establishes that L ((p 1 p 2 ) (p 1 p 1 )): 1. (p 1 (p 2 p 1 )) L1 2. ((p 1 (p 2 p 1 )) ((p 1 p 2 ) (p 1 p 1 ))) L2 3. ((p 1 p 2 ) (p 1 p 1 )) 1, 2, MP Line 1 states that (p 1 (p 2 p 1 )) is an instance of L1 (with p 1 as A and p 2 as B). Line 2 states that ((p 1 (p 2 p 1 ) ((p 1 p 2 ) (p 1 p 1 ))) is an instance of L2 (with p 1 as A, p 2 as B and p 1 as C). Line 3 states that ((p 1 p 2 ) (p 1 p 2 )) follows from lines 1 and 2 by the rule MP (with (p 1 (p 2 p 1 )) as A and ((p 1 p 2 ) (p 1 p 2 )) as B). MATHS 315 Lecture notes Page 5 of 31

8 Example 2.4. Show that for wffs A, B and C of L, {(B C)} L ((A B) (A C)). Solution. We have the following derivation: 1. Hyp. 2. L1 3. 1, 2, MP 4. L2 5. 3, 4, MP Example 2.5. Show that for any wff D of L, L (D D). Solution. We have the following derivation in L: 1. L1 2. L2 3. 1, 2, MP 4. L1 5. 3, 4, MP We have chosen an alphabet and wffs that reflect our discussion in Chapter 1. Keep in mind that these symbols and wffs have no presupposed meaning. All results must be derivable through the rules and axioms of L. Exercises 3. Prove the following results. (a) {p 2 } L ( p 1 p 2 ). (b) {( p 1 p 2 )} L (( p 1 p 2 ) p 1 ) 1. (c) {p 2, p 2 } L p 1. [Hint: your proof should fit the following template: 1. Hyp. 2. L1 3. 1, 2, MP 4. (( p 1 p 2 ) (( p 1 p 2 ) p 1 )) L3 5. 3, 4, MP 6. Hyp. 7. L , 5, MP] MATHS 315 Lecture notes Page 6 of 31

9 4. Show that {( p 1 p 2 ), p 2 } L p 1. [Hint: your proof should fit the following template: 1. Hyp. 2. (( p 1 p 2 ) (( p 1 p 2 ) p 1 )) L3 3. 1, 2, MP 4. Hyp. 5. L1 6. 4, 5, MP 7. 6, 3, MP] 5. Let A, B, C form(l). Complete the following derivation showing that {(A (B C)), B, A} L C: 1. Hyp 2. Hyp 3. 2, 1, MP 4. Hyp 5. 4, 3, MP 6. Show that {(F (G H)), G} L (F H). [Hint: the derivation has the form 1. Hyp. 2. L2 3. 1, 2, MP 4. Hyp 5. L1 6. 4, 5, MP 7. 6, 3 MP] 2.3 The Deduction Theorem for L In this section we will see some more examples of derivations in L, and learn about a tool called the Deduction Theorem which makes them easier to find. Example 2.6. Show that for any wffs A and B we have {A, A} L B. Solution. We have the derivation 1. Hyp. 2. L1 3. 1, 2, MP 4. (( B A) (( B A) B)) L3 5. 3, 4, MP 6. Hyp. 7. L1 8. 6, 7, MP 9. 8, 5, MP MATHS 315 Lecture notes Page 7 of 31

10 In contrast to the above derivation, here is a derivation of { A} L (A B): 1. A Hyp. 2. ( A ( B A)) L1 3. ( B A) 1, 2, MP. 4. (( B A) (A ( B A))) L1 5. (A ( B A)) 3, 4, MP 6. (( B A) (( B A) B)) L3 7. ((( B A) (( B A) B)) (A (( B A) (( B A) B))) L1 8. (A (( B A) (( B A) B)) 6, 7, MP 9. ((A ( B A) (( B A) B)) ((A ( B A)) (A (( B A) B))) L2 10. ((A ( B A)) (A (( B A) B))) 8, 9, MP 11. (A ( B A)) L1 12. (A (( B A) B)) 5, 10, MP 13. (A (( B A) B) ((A ( B A)) (A B))) L2 14. ((A ( B A)) (A B)) 12, 13, MP 15. (A B) 11, 14, MP Observe that derivations with more hypotheses tend to be much simpler and easier to find. The Deduction Theorem let s us exploit this idea. Theorem 2.7 (The Deduction Theorem for L). Let Σ {A, B} be a set of wffs of L. Then Σ {A} L B if and only if Σ L (A B). Proof. First, suppose that Σ L (A B). Then Σ {A} L (A B). We also have Σ {A} L A, so by modus ponens we have Σ {A} L B. Conversely, suppose that Σ {A} L B. Let B 1, B 2,..., B n be a derivation of B from Σ {A}. We prove by induction on k that Σ L (A B k ) for 1 k n. Base Step: B 1 must be an axiom or a hypothesis: in the latter case, B 1 could be either in Σ or could be A itself. Case 1: If B 1 is an axiom then Σ L B 1. We also have Σ L (B 1 (A B 1 )) since (B 1 (A B 1 )) is an instance of L1, so by modus ponens we have Σ L (A B 1 ). Case 2: If B 1 Σ then Σ L B 1, so as in Case 1 we have Σ L (A B 1 ). MATHS 315 Lecture notes Page 8 of 31

11 Case 3: If B 1 = A then we use our previous example to deduce that L (A B 1 ), and therefore Σ L (A B 1 ). Inductive Step: Suppose 1 < k n and Σ L (A B i ) for 1 i < k. There are four cases to consider: B k is an axiom, B k Σ, B k = A or B k follows from two earlier terms in the sequence by modus ponens. Cases 1 3: Exactly as for the Base Step. Case 4: Suppose that B k follows from two earlier terms by modus ponens. For this to happen, the two earlier terms must have the form C and (C B k ). In other words, there are 1 i, j < k such that B j is (B i B k ). By inductive hypothesis, Σ L (A B i ) and But we also have Σ L (A (B i B k )). Σ L ((A (B i B k )) ((A B i ) (A B k ))), since the latter is an axiom, so by modus ponens we have Σ L ((A B i ) (A B k )), and by modus ponens again we have Σ L (A B k ). Hence, in any case, Σ L (A B k ). Hence, by induction Σ L (A B k ) for all k, and in particular Σ L (A B n ), i.e. Σ L (A B). Example 2.8. Show that for any wffs A, B, C of L, L ((A (B C)) (B (A C))). Solution: We will first show that {(A (B C)), A, B} L C. We have the following derivation: From this we have 1. Hyp. 2. Hyp. 3. 2, 1, MP 4. Hyp. 5. 4, 3, MP {(A (B C)), A, B} L C, MATHS 315 Lecture notes Page 9 of 31

12 so by the Deduction Theorem we have {(A (B C)), B} L (A C). Hence, by the Deduction Theorem again we have {(A (B C))} L (B (A C)), and by the Deduction Theorem yet again we have as required. Here is another example: L ((A (B C)) (B (A C))), Example 2.9. Show that for any wffs A and B of L, L ((A (A B)) (A B)). Solution. We show first that {(A (A B)), A} L B. We have the derivation 1. Hyp. 2. Hyp. 3. 2, 1, MP 4. 2, 3, MP From this we have so by DT we have Hence by DT again we have {(A (A B)), A} L B, {(A (A B))} L {(A B). L ((A (A B)) (A B)). Compare the above proof with the following derivation, which is entirely within L: 1. (A ((A B) A)) L1 2. ((A ((A B) A)) ((A ((A B) (A A))) L2 3. ((A ((A B) (A A)) 1, 2, MP 4. ((A (A B)) ((A A) (A B))) L2 5. ((A (A B)) ((A A) (A B)) (((A (A B)) (A A)) (A (A B)) (A B)))) L2 6. (((A (A B)) (A A)) (A (A B)) (A B)) 4, 5, MP 7. ((A (A B)) (A B)) 3, 6, MP MATHS 315 Lecture notes Page 10 of 31

13 Of course, it is one thing to check that the above derivation stays within the rules of the game of L, but it is quite another to find a derivation like the one above. In fact, the proof of the Deduction Theorem actually gives us a method of finding the derivation, or to be precise a method of converting the derivation of B from {(A (A B)), A} into a derivation of ((A (A B)) (A B)) from. Exercises 7. Let A and B be wffs of L. (a) Complete the following derivation showing that {( A B), B} L A. 1. (( A B) (( A B) A)) L3 2. Hyp 3. 2, 1, MP 4. Hyp. 5. L1 6. 4, 5, MP 7. 6, 3, MP (b) Deduce that L (B (( A B) A)). 8. Let A be a wff of L. Show that L ( A A). 9. Let A and B be wffs of L. Use Example 2.6 and the Deduction Theorem to deduce that L ( B (B A)). 10. Let A, B and C be wffs of L. (a) Find a derivation showing that {(A B), (B C), A} L C. (b) Use the Deduction Theorem to deduce that L ((A B) ((B C) (A C))). (c) Find a derivation showing that {(A B), (B C)} L (A C). MATHS 315 Lecture notes Page 11 of 31

14 2.4 Truth assignments We now move onto the issue of the semantic interpretation of L. We know the definition of Σ L A, but what does it actually mean? Why do we care? We will show that, for statement forms A 1, A 2,..., A n and B, the argument form A 1, A 2,..., A n, B is valid if and only if {A 1, A 2,..., A n } L B. In fact we will extend our notion of valid arguments to allow arbitrary (possibly infinite) sets of premisses. We use form(l) to denote the set of all wffs of L. Definition A truth assignment is a function v : form(l) {0, 1} such that for any A, B form(l), v( A) = 1 v(a), and { 0 if v(a) = 1 and v(b) = 0 v((a B)) = 1 otherwise In other words, a truth assignment is a way of assigning truth values to the statement variables, and extending these truth values to all the wffs of L. Definition A wff A is a tautology if v(a) = 1 for every truth assignment v. Definition Let Σ {A} form(l). We say that Σ entails A, written Σ = A, if for every truth assignment v such that v(b) = 1 for all B Σ, v(a) = 1. Notice that the argument form A 1, A 2,..., A n, B is a valid argument form if and only if {A 1, A 2,..., A n } = B. Our goal now, in showing that our system L represents our intentions in terms of the meaning of all the symbols, is to show that for any Σ {A} form(l), Σ L A if and only if Σ = A. There are two parts to this. First, we must show that L is sound, in other words that if Σ L A then Σ = A. Secondly, we must show that it is adequate, in other words that if Σ = A then Σ L A. MATHS 315 Lecture notes Page 12 of 31

15 Lemma All the axioms of L are tautologies. Proof. Exercise. Theorem 2.14 (The Soundness Theorem for L). Let Σ {A} be a set of wffs of L. If Σ L A then Σ = A. Proof. Let B 1, B 2,..., B n be a derivation of A from Σ. We prove by induction on k that Σ = B k for 1 k n. Base step: B 1 must be either an axiom or an element of Σ. Let v be a truth assignment such that v(c) = 1 for all C Σ. If B 1 is an axiom then it is a tautology so v(b 1 ) = 1. Otherwise it is in Σ, so again we have v(b 1 ) = 1. Thus Σ = B 1. Inductive step Suppose 1 < k n and Σ = B i for 1 i < k. B k must be an axiom, in Σ or follow from two earlier terms by modus ponens. In the first two cases, we know that Σ = B k as in the base step. So suppose that B k follows from two earlier terms by modus ponens. In other words, there are i, j with 1 i, j < k such that B j = (B i B k ). Let v be a truth assignment with v(c) = 1 for all C Σ. By inductive hypothesis we know that Σ = B i and Σ = (B i B k ), so v(b i ) = 1 and v(b i B k ) = 1. Thus we must have v(b k ) = 1. Hence Σ = B k. Hence, by induction, Σ = B k for 1 k n, and in particular Σ = B n, i.e. Σ = A. Theorem Every theorem of L is a tautology. Proof. Let A be a theorem of L. Then L A, so = A. Let v be a truth assignment. Then, vacuously, v(b) = 1 for every B, so v(a) = 1. Thus A is a tautology, as claimed. Exercises 11. For Σ form(l), let E(Σ) = { A form(l) Σ = A }. Prove the following properties of E: (a) Σ E(Σ); (b) if Σ Π then E(Σ) E(Π); and (c) E(E(Σ)) = E(Σ). 12. For Σ form(l), let Con(Σ) = { A form(l) Σ L A }. Prove the following properties of Con: MATHS 315 Lecture notes Page 13 of 31

16 (a) Σ Con(Σ); [Note: this is not a trick question, just very easy.] (b) if Σ Π then Con(Σ) Con(Π); and (c) Con(Con(Σ)) = Con(Σ). 2.5 Adequacy of L Our next goal is to prove that the formal system L is adequate, in other words that if Σ {A} form(l) and Σ = A then Σ L A. To do this we will introduce two new properties that a set of wffs of L may or may not have: completeness and satisfiability. Definition Let Σ form(l). We say that Σ is consistent if there is no wff A such that Σ L A and Σ L A. We say that Σ is complete if for every A form(l) we have either A Σ or A Σ. Definition A set Σ form(l) is satisfied by a truth assignment v : form(l) {0, 1} if v(b) = 1 for all B Σ. Σ is satisfiable if there is some truth assignment v which satisfies Σ. We have two closely related notions here, a syntactic notion of consistency and a semantic notion of satisfiability. In fact, we will end up showing that they are equivalent: Σ is consistent if and only if it is satisfiable. The plan is to show that if Σ is both complete and consistent then the function f Σ : form(l) {0, 1} defined by { 1 if A Σ f Σ (A) = 0 if A / Σ is actually a truth assignment (so Σ is satisfiable because f Σ satisfies Σ). We will then show that if Σ L A then there is a complete consistent set Π with Σ { A} Π. But then f Π is a truth assignment with f Π (B) = 1 for all B Σ but f Π (A) = 0, which shows that Σ = A. Hence, by contraposition, if Σ = A then Σ L A. Lemma is consistent. Proof. Suppose not, i.e. suppose that there is some A such that L A and L A. Then, by the Soundness Theorem for L, both A and A would have to be tautologies, and this is impossible. MATHS 315 Lecture notes Page 14 of 31

17 In Exercise 2.7 we will see that there is a complete Σ which is not consistent. Also is consistent but certainly not complete. So the two notions are independent. Lemma Let Σ form(l). If Σ is not consistent then Σ L A for every A form(l). Proof. Suppose that Σ is inconsistent. Then there is some B such that Σ L B and Σ L B. Since Σ L B and (B ( A B)) is an axiom, Σ L ( A B). Similarly, since Σ L B we have Σ L ( A B). Now (( A B) (( A B) A)) is an axiom, so by modus ponens Σ L (( A B) A), and by modus ponens again we have Σ L A, as required. Note this is the argument used for Example 2.6. Lemma Let Σ {A} form(l). If Σ L A then Σ { A} is consistent. Proof. We prove the contrapositive: if Σ { A} is inconsistent then Σ L A. So suppose that Σ { A} is inconsistent. Then there is some B such that Σ { A} L B and Σ { A} L B. By the Deduction Theorem, we have Σ L ( A B) and Σ L ( A B). We also have Σ L (( A B) (( A B) A)), since the latter is an axiom. So, by modus ponens we have Σ L (( A B) A), and by modus ponens again we have Σ L A, as required. Lemma Let Σ form(l) be complete and consistent. For any A form(l), we have Σ L A iff A Σ. Proof. Suppose first that A Σ. Then certainly we have Σ L A. Conversely, suppose that Σ L A. We must show that A Σ, so suppose for a contradiction that A / Σ. Then, by completeness we have A Σ, so Σ L A, and thus Σ is inconsistent, contradicting our assumption about Σ. So we must have A Σ as required. MATHS 315 Lecture notes Page 15 of 31

18 Theorem If Σ form(l) is complete and consistent then the function f Σ : form(l) {0, 1} defined by { 1 if A Σ f Σ (A) = 0 if A / Σ is a truth assignment. Proof. We need to check that, for arbitrary wff A, B, if f Σ (A) = 1 then f Σ ( A) = 0; if f Σ (A) = 0 then f Σ ( A) = 1; if f Σ (A) = 1 and f Σ (B) = 0 then f Σ ((A B)) = 0; and if f Σ (A) = 0 or f Σ (B) = 1 then f Σ ((A B)) = 1. Suppose that f Σ (A) = 1. Then A Σ, so Σ L A, so Σ L A (since Σ is consistent), so A / Σ, so f Σ ( A) = 0. Suppose instead that f Σ (A) = 0. Then A / Σ so A Σ (since Σ is complete) so f Σ ( A) = 1. Next suppose f Σ (A) = 1 and f Σ (B) = 0. Suppose, for a contradiction, that f Σ ((A B)) 0, i.e. that f Σ ((A B)) = 1. Then we have A Σ and (A B) Σ, so Σ L A and Σ L (A B). But then, by modus ponens, Σ L B, and so B Σ, so f Σ (B) = 1, a contradiction. Thus f Σ ((A B)) = 0, as required. Suppose instead that f Σ (A) = 0. Then A / Σ, so A Σ (by completeness), so Σ L A. We also know that so L ( A (A B)), Σ L ( A (A B)), so by modus ponens we have Σ L (A B). Thus (A B) Σ, so f Σ ((A B)) = 1 as required. Finally, suppose f Σ (B) = 1. Then B Σ so Σ L B. We also have Σ L (B (A B)) since this is an axiom, so by modus ponens we have Σ L (A B), and thus f Σ ((A B)) = 1, as required. Exercises 13. Let A, B, C form(l). MATHS 315 Lecture notes Page 16 of 31

19 (a) Complete the following derivation showing that {(A (B C)), B, A} L C: 1. Hyp 2. Hyp 3. 2, 1, MP 4. Hyp 5. 4, 3, MP (b) Deduce that L ((A (B C)) (B (A C))). 14. Let A and B be wffs of L. (a) Find a derivation showing that {( A B), B} L A. (b) Use the Deduction Theorem to deduce that L (( A B) (B A)). (c) Find a derivation showing that {( A B)} L (B A). 2.6 Countable sets Our proof that every consistent set can be extended to a complete consistent set depends on the fact that the set form(l) is countable. In this section we will give a brief overview of countable sets. Definition A set X is countable if X = or we can enumerate X as { x n n N } (possibly with repetitions). In other words, X is countable if X = or there is an onto map g : N X (given by n x n ). The idea is that countable sets are small : they may be infinite, but they are only just infinite. This being so the following result is obvious: Proposition If X is countable and Y X then Y is countable. Proof. If Y = then Y is countable, so we assume Y (and therefore certainly X ). Then we can enumerate X as { x n n N }. Since Y, there is at least one y Y. Put { x n if x n Y y n = y if x n / Y Then Y = { y n n N }, so Y is countable, as required. Proposition If X and Y are sets with X countable and there is a bijection from X to Y then Y is also countable. MATHS 315 Lecture notes Page 17 of 31

20 Proof. Again we assume X is non-empty, so we can enumerate it as { x n n N }. Let f : X Y be a bijection. Then we can enumerate Y as { f(x n ) n N }, so Y is countable as required. Proposition If X and Y are countable then so is X Y. Proof. We assume X and Y are both non-empty (else the result is trivial). So we can enumerate X as { x n n N } and Y as { y n n N }. So then we have X Y = { z n n N }, where { x n/2 if n is even z n = if n is odd y (n 1)/2 Lemma The function f : N N N given by f(m, k) = 2 m (2k+ 1) 1 is a bijection. Proof. We show first that f is 1 1. So suppose f(m 1, k 1 ) = f(m 2, k 2 ). Without loss of generality (WLOG), m 1 m 2. Now we have so 2 m 1 (2k 1 + 1) 1 = 2 m 2 (2k 2 + 1) 1 2k = 2 m 2 m 1 (2k 2 + 1) Now the left hand side is odd, and the right hand side is even unless m 2 m 1 = 0. So we have m 2 m 1 = 0, so m 1 = m 2. Thus we have 2k = 2k 2 + 1, so k 1 = k 2 also, and thus (m 1, k 1 ) = (m 2, k 2 ). Next we must show that f is onto. So let n N. Then n + 1 > 0, so n + 1 can be expressed in the form 2 m (2k + 1) (by repeatedly dividing 2 into n + 1, m times, until the result is an odd number). But then f(m, k) = (n + 1) 1 = n. Proposition Let { A n n N } be a countable family of countable non-empty sets. Then n N A n is countable. Proof. Let f : N N N be the bijection from Lemma For each m we can enumerate A m as { x m,k k N }. Put B = { z n n N }, where if m, k N with f(m, k) = n then z n = x m,k. Note that, for each n there is a unique pair (m, k) with f(m, k) = n (since f is a bijection), so z n is well defined. Note that B is countable. If b B then b = z n = x m,k for some m, k N. But then b A m, so b n N A n. Conversely if a n N A n then a A m for some m, so a = x m,k for some k, and then a = z f(m,k) B. Thus we have B = n N A n. So n N A n is countable. MATHS 315 Lecture notes Page 18 of 31

21 Lemma If A and B are countable sets then A B is countable. Proof. If either A or B is empty then A B = so A B is countable. So we assume that A and B are nonempty and can therefore be enumerated as { a n n N } and { b n n N } respectively. For each n N let A n = {a n } B = { (a n, b m ) m N }. Then each A n is countable so n N A n is countable. But n N A n = A B, so A B is countable as required. Proposition Let X be a countable set of symbols. Then the set X of all finite non-empty strings of symbols from X is countable. Proof. We have X = n N X n, where X n is the set of all strings of length n + 1. So we only need to show that each X n is countable. We do this by induction on n: X 0 is just the set of strings of length 1, so there is a bijection from X to X 0. So suppose that X n is countable, and we wish to deduce that X n+1 is countable. Each string of length n + 2 can be obtained by taking a string from X n and adding another symbol from X at the end. Thus there is a bijection between X n+1 and X n X. Since X n and X are both countable, so is X n X, and therefore so is X n+1. Theorem The set form(l) is countable. Proof. Let X be the set of symbols of L. Then X is countable, so X is countable. Thus, since form(l) X, form(l) is countable. Here is a sketch of an alternative proof of the previous theorem. We use the first exercise below, Ex Let S = {,, (, ), p 0, p 1,...} be the symbol set for L. Choose a bijection g : S N {0}. Given a string w = s 0 s 1... s n 1 over S, let n 1 G(w) = i=0 α g(s i) i where α i is the i-th prime number. Then G is 1-1 since factoring into prime numbers is unique. the restriction of G to form(l) is a 1-1 map form(l) N. So form(l) is countable. MATHS 315 Lecture notes Page 19 of 31

22 So what is an example of a non-countable set? The set of real numbers is not countable. The easiest example, however is P(N), the power set of N. If g : N P(N), one considers the set R = {n : n g(n)}. If R = g(n), then n R implies n R, and n R implies n R. This contradiction (which is the same as the one in Russell s paradox) show that R is not in the range of g. Thus g is not onto. Exercises 15. The following are equivalent for any set X. (i) There is a 1 1 function f : X N (ii) X is empty or there is an onto function g : N X. 16. Let F be the set of all finite subsets of N. Show that F is countable. [Hint: express F as n N A n where each A n is countable.] 17. Show that the sets Z of integers and Q of rational numbers are both countable. 18. Let I be an uncountable set, and for each i I let U i R be a set of real numbers with the property that there is at least one q Q U i. Show that there is some q Q with q U i for uncountably many i I. [Hint: express I as n N A n and observe that if all the sets A n were countable then I would have to be countable.] 2.7 The Adequacy Theorem for L We are now in a position to pull the ingredients together to prove the adequacy theorem for L. We begin with two more purely syntactical Lemmas concerning consistency. Lemma Let Σ form(l) be a consistent set, and let A form(l). Then Σ {A} is consistent or Σ { A} is consistent. Proof. We have already shown in Lemma 2.19 that if Σ L A then Σ { A} is consistent. So suppose that Σ L A. We must show that Σ {A} is consistent. Suppose, for a contradiction, that it is inconsistent, in other words that there is some B such that Σ {A} L B and Σ {A} L B. Then, by the Deduction Theorem, Σ L (A B) and Σ L (A B). But we also have Σ L A so by modus ponens we have Σ L B and Σ L B, contradicting the assumption that Σ is consistent. Hence there is no such B, in other words Σ {A} is consistent, as required. MATHS 315 Lecture notes Page 20 of 31

23 Lemma Let Σ form(l) be an inconsistent set. Then there is a finite Γ Σ such that Γ is inconsistent. Proof. Since Σ is inconsistent, there is some A such that Σ L A and Σ L A. Let A 1, A 2,..., A m be a derivation of A from Σ and let B 1, B 2,..., B n be a derivation of A from Σ. Put Γ = Σ ( {A 1, A 2,..., A m } {B 1, B 2,..., B n } ). Then Γ is a finite subset of Σ. Consider the sequence A 1, A 2,..., A m. Every term in this sequence is an axiom, in Σ or follows from two earlier terms by modus ponens. But any of the terms which are in Σ are in Γ, so every term in the sequence is an axiom, is in Γ or follows from two earlier terms by modus ponens. In other words, this is a derivation of A from Γ. Similarly, B 1, B 2,..., B n is a derivation of A from Γ. So Γ is a finite inconsistent subset of Σ, as required. Theorem Let Σ form(l) be a consistent set. Then there is a complete consistent set Π with Σ Π. Proof. We know that form(l) is countable, so we can enumerate it as { A n n N }. We construct a sequence (Σ n ) n N of subsets of form(l) as follows: Σ 0 = Σ, and if we have defined Σ n then { Σ n {A n } if Σ {A n } is consistent Σ n+1 = Σ n { A n } otherwise Note that if Σ n {A n } is inconsistent then Σ n { A n } is consistent, by Lemma Hence we can prove by induction that each Σ n is consistent. Put Π = n N. We claim that Π is consistent. By the previous lemma, it is enough to show that each finite subset of Π is consistent, so let Γ Π be finite, say Γ = {A 1, A 2,..., A k }. For each i, A i Σ ni for some n i N. Put m = max{n 1, n 2,..., n k }. Then we have n i m for each i, and A i Σ ni Σ m, so we have Γ Σ m. Then if Γ were inconsistent, Σ m would also be inconsistent. So Γ is consistent, as required. MATHS 315 Lecture notes Page 21 of 31

24 Finally we must check that Π is complete. So let A form(l). Then A = A n for some n. So we have either A n Σ n+1 or A n Σ n+1, and Σ n+1 Π, so A Π or A Π, as required. Theorem Let Σ be a set of wffs of L. Then Σ is satisfiable if and only if Σ is consistent. Proof. Suppose first that Σ is satisfiable. Let v be a truth assignment which satisfies Σ. Suppose, for a contradiction, that Σ is inconsistent, in other words there is some B with Σ L B and Σ L B. Then, by the Soundness Theorem, Σ = B and Σ = B, so since v satisfies Σ we must have v(b) = 1 and v( B) = 1. But this is impossible, so there is no such B, i.e. Σ is consistent. Conversely, suppose that Σ is consistent. Then there is some complete consistent Π with Σ Π. Then, by Theorem 2.22, the function f Π : form(l) {0, 1} defined by { 1 if B Π f Π (B) = 0 if B / Π is a truth assignment which satisfies Π. In particular, it satisfies Σ, so Σ is satisfiable. The following Theorem, together with the Soundness theorem for L, establishes the desired equivalence between syntax and semantics: Σ L A if and only if Σ = A. Theorem 2.36 (The Adequacy Theorem for L). Let Σ {A} form(l). If Σ = A then Σ L A. Proof. We prove the contrapositive: if Σ L A then Σ = A. So suppose Σ L A. Then Σ { A} is consistent, so it is satisfiable. Let v be a truth assignment which satisfies Σ { A}. Then v(b) = 1 for all B Σ but v(a) = 0, so Σ = A, as required. Corollary Every tautology is a theorem of L. Proof. If A is a tautology then = A, so L A, in other words A is a theorem of L. Corollary 2.38 (The Compactness Theorem for L). Let Σ form(l). If every finite subset of Σ is satisfiable then Σ is satisfiable. Proof. Suppose that every finite subset of Σ is satisfiable. Then every finite subset of Σ is consistent, so Σ is consistent, so Σ is satisfiable. MATHS 315 Lecture notes Page 22 of 31

25 Exercises 19. Let Σ {A, B} form(l). Show that if Σ {A} is satisfiable and Σ {B} is not satisfiable then Σ L (B A). 20. Let Σ {A, B} form(l). Show that either Σ {(A B)} is satisfiable or Σ L B. 21. (a) If A is a tautology and Σ form(l) is a set such that Σ L A, then Σ is inconsistent. (b) Give an example of a set Σ form(l) which is complete but inconsistent. MATHS 315 Lecture notes Page 23 of 31

26 Answers to the Exercises for Chapter 2 1. We must show that for any i N, A i MB i is a theorem, and the converse, if x is a theorem, then x has the form A i MB i. M, AMB, AAMBB,..., A i MB i is a derivation of A i MB i (the rule is applies i times), and hence A i MB i is theorem for each i N. Let B 1, B 2,..., B n = x be a derivation of x in the MAB system. We prove by induction on k, 1 k n, that B k has the required form. For n = 1, B 1 is M, which has the required form (in this case i=1). Suppose k > 1 and for each l < k, B l has the required form. Either B k is M, and as before it has the required form, or B k is obtained from B l for some l < k by the rule. By the inductive hypothesis B l = A r MB r for some r N. Then an application of the rule to B l gives B k = A r+1 MB r+1, which has the required form. 2. (a) Prove by induction on k. Base step: If k = 2 0 = 1, then we have MI which is an axiom and hence a theorem in M. Inductive step: Suppose M I }.{{.. I} is a theorem in M, then by Rule 2 we have that 2 n M I }.{{.. I} I }.{{.. I} or M I }.{{.. I}. 2 n 2 n 2 n+1 Thus it follows that M I }.{{.. I} is theorem in M whenever k is a power of 2. k (b) For each x we have the following derivation: (c) By induction on the number of I s. 1. M xiii Hyp. 2. M xiiiu 1, Rule MxUU 2, Rule 3 4. Mx 3, Rule 4. Base step: We have that MI and MII are theorems in M. Inductive step: If M I }.{{.. I} is a theorem, then from (b) M I }.{{.. I} is a k k+3 theorem. This shows that M I }.{{.. I} is a theorem whenever k = 3m + 1 or k k + 3m + 2 for every m N. (d) Let x be any string of symbols I, U, such that 3 does not divide the number I s. Suppose U occurs k times in x. Where ever U occurs in x, MATHS 315 Lecture notes Page 24 of 31

27 replace it by III and call this string y. Since we have added 3k I s, the number of I s in y is not divisible by 3. By (c), My is a theorem in M. Now apply rule 3 k times to My get Mx and hence Mx is a theorem in M. 3. (a) We have the derivation (b) We have the derivation (c) We have the derivation 4. We have the derivation So {( p 1 p 2 ), p 2 } LP p p 2 Hyp. 2. (p 1 ( p 1 p 2 )) LP1 3. ( p 1 p 2 ) 1, 2, MP 1. ( p 1 p 2 ) Hyp. 2. (( p 1 p 2 ) (( p 1 p 2 ) p 1 )) LP3 3. (( p 1 p 2 ) p 1 ) 1, 2, MP 1. p 2 Hyp. 2. ( p 2 ( p 1 p 2 )) LP1 3. ( p 1 p 2 ) 1, 2, MP 4. (( p 1 p 2 ) (( p 1 p 2 ) p 1 )) LP3 5. (( p 1 p 2 ) p 1 ) 3, 4, MP 6. p 2 Hyp. 7. (p 2 ( p 1 p 2 )) LP1 8. ( p 1 p 2 ) 9. p 1 8, 5, MP 1. ( p 1 p 2 ) Hyp. 2. (( p 1 p 2 ) (( p 1 p 2 ) p 1 )) LP3 3. (( p 1 p 2 ) p 1 ) 1, 2, MP 4. p 2 Hyp. 5. (p 2 ( p 1 p 2 )) LP1 6. ( p 1 p 2 ) 4, 5, MP 7. p 1 6, 3, MP 5. We have the derivation 1. (A (B C)) Hyp 2. A Hyp 3. (B C) 2, 1, MP 4. B Hyp 5. C 4, 3, MP MATHS 315 Lecture notes Page 25 of 31

28 6. We have the derivation 7. (a) We have the derivation 1. (F (G H)) Hyp. 2. ((F (G H)) ((F G) (F H))) L2 3. ((F G) (F H)) 1, 2, MP 4. G Hyp 5. (G (F G)) L1 6. (F G) 4, 5, MP 7. (F H) 6, 3 MP 1. (( A B) (( A B) A)) LP3 2. ( A B) Hyp 3. (( A B) A) 2, 1, MP 4. B Hyp. 5. (B ( A B)) LP1 6. ( A B) 4, 5, MP 7. A 6, 3, MP (b) From (a) we have {( A B), B} LP A. Hence by the Deduction Theorem we have {B} LP (( A B) A). So by the Deduction Theorem again we have LP (B (( A B) A)). 8. By the Deduction Theorem it is sufficient to show that { A} LP A. We have the following derivation: 1. (( A ( A) (( A A) A)) LP2 2. A Hyp. 3. ( A ( A A)) LP1 4. ( A A) 2, 3, MP 5. (( A A) A) 4, 1, MP 6. ( A A) Iαα, by Example 1.4 from notes 7. A 6, 5, MP 9. (a) We have the derivation 1. B Hyp. 2. ( B( A B)) LP1 3. ( A B) 1, 2, MP 4. (( A B (( A B) A)) LP3 5. (( A B) A) 3, 4, MP 6. B Hyp 7. (B ( A B)) LP1 8. ( A B) 6, 7, MP 9. A 8, 5, MP MATHS 315 Lecture notes Page 26 of 31

29 (b) From (a) we know that {B, B} LP A, so by the Deduction Theorem we have { B} LP (B A), and by the Deduction Theorem again we have L ( B (B A)). 10. (a) We have the derivation 1. A Hyp. 2. (A B) Hyp. 3. B 1, 2, MP 4. (B C) Hyp. 5. C 3, 4, MP (b) From (a) we know that {(A B), (B C), A} LP C. So, by the Deduction Theorem, we have {(A B), (B C)} LP (A C)I. By the Deduction Theorem again we have {(A B)} LP ((B C) (A C)), and by the Deduction Theorem yet again we have LP ((A B) (B C) (A C)). (c) We inspect the derivation from (a): the last line is 3, 4, MP so we know we have to try to get (A 3) and (A 4), in other words we have to get (A B) and (A (B C)). From there we will use LP2 and MP twice to get (A C). Now (A B) is a hypothesis and, becuase (B C) is also a hypothesis we can get (A (BC)) using LP1. So we get the derivation 1. (B C) Hyp. 2. ((B C) (A (B C))) LP1 3. (A (B C)) 1, 2, MP 4. (A B) Hyp. 5. ((A (B C) ((A B) (A C))) LP2 6. ((A B) (A C)) 3, 5, MP 7. (A C) 4, 6, MP 11. (a) Let A Σ: we must show that A E(Σ), i.e. that Σ = A. So let v be a valuation with v(b) = 1 for all B Σ. In particular, v(a) = 1. So Σ = A, as required. (b) Suppose Σ Π. Let A E(Σ): we must show that A E(Π), in other words that Π = A. So let v be a valuation with v(b) = 1 for all B Π. Since Σ Π we certainly have v(b) = 1 for all B Σ, so (since Σ = A) we have v(a) = 1. Thus Π = A, as required. (c) We must show that E(E(Σ)) E(Σ) and E(Σ) E(E(Σ)). So let A E(E(Σ)). We must show that A E(Σ), i.e. that Σ = A. So let v be a valuation with v(b) = 1 for all B Σ. We claim that v also satisfies E(Σ). So let C E(Σ). Then Σ = C and v satisfies S, so v(c) = 1. Thus v does satisfy E(Σ), and so since E(Σ) = A we must have v(a) = 1. Thus Σ = A, as required. 12. (a) Let A Σ. Then we have the one-line derivation 1. A Hyp so Σ L A, so A Con(Σ). Thus Σ Con(Σ). (b) Suppose Σ Π. Let A Con Σ. Then Σ L A, and Σ Π, so Π L A, so A Con(Π). Hence Con(Σ) Con(Π). MATHS 315 Lecture notes Page 27 of 31

30 (c) From (a) we have Σ Con(Σ), so from (b) we have Con(Σ) Con(Con(Σ)). For the opposite containment, let A Con(Con(Σ)). We must show that A Con(Σ). Now, since A Con(Con(Σ)), Con(Σ) L A, so there is a derivation A 1, A 2,..., A n of A from Con(Σ). We prove by induction on i that Σ L A i for 1 i n. Base: i = 1. A i is either a hypothesis or an axiom. Case 1 A 1 is a hypothesis. Then A 1 Con(Σ), so Σ L A 1, as required. Case 2 A 1 is an axiom. Then Σ L A 1, as required. Inductive step: Suppose 1 < i n, and the result holds for all j with 1 j < i. There are three cases to consider: A i is a hypothesis, an axiom or follows from two earlier terms by modus ponens. Cases 1 and 2 are just as for the base. Case 3 A i follows from two earlier terms, A j and A k say, by modus ponens. This means that A k must be (A j A i ). By inductive hypothesis we have Σ L A j and Σ L A k, in other words Σ L (A j A i ), so by modus ponens we have Σ L A i as required. Hence, by induction Σ L A i for each i, so Σ L A, in other words A Con(Σ). Thus Con(Con(Σ)) Con(Σ), as required. 13. (a) We have the derivation 1. (A (B C)) Hyp 2. A Hyp 3. (B C) 2, 1, MP 4. B Hyp 5. C 4, 3, MP (b) From (a) we know that {(A (B C)), B, A} L C. By the Deduction Theorem we have {(A (B C)), B} L (A C). By the Deduction Theorem again we have{(a (B C))} L (B (A C)), so by the Deduction Theorem yet again we have L ((A (B C)) (B (A C))). 14. (a) We have the derivation 1. ( A B) Hyp. 2. (( A B) (( A B) A)) L3 3. (( A B) A) 1, 2, MP 4. B Hyp. 5. (B ( A B)) L1 6. ( A B) 4, 5, MP 7. A 6, 3, MP (b) From (a) we have {( A B), B} L A. By the Deduction Theorem we have {( A B)} L (B A), and by the Deduction Theorem again we have L (( A B) (B A)). MATHS 315 Lecture notes Page 28 of 31

31 (c) We have the derivation 1. ( A B) Hyp. 2. (( A B) A (B B ( A B) A )) L1 3. (B ( A B)) 1, 2, MP 4. (( A B) (( A B) A)) L3 5. ((( A B) (( A B) A)) A (B B (( A B) (( A B) A)) A )) L1 6. (B (( A B) (( A B) A))) 4, 5, MP 7. ((B A (( A B) B (( A B) A) C )) ((B A ( A B) B ) (B A (( A B) A) C ))) L2 8. ((B ( A B)) (B (( A B) A))) 6, 7, MP 9. (B ( A B)) L1 10. (B (( A B) A)) 3, 8, MP 11. ((B A (( A B) B A C )) ((B A ( A B) B ) (B A A C ))) L2 12. ((B ( A B)) (B A)) 10, 11, MP 13. (B A) 9, 12, MP 15. Sorry, guys, DIY There are two ways to express F as a countable union of countable sets. The slightly harder way is to write F = n N A n, where A n = { X N X = n }. It is not too dificult to prove, by induction, that each A n is countable. However, it is easier to note that every finite subset of N is a subset of {0, 1, 2,..., n} for some n N. Thus we have F = n N B n, where B n = { X X {0, 1,..., n} }. Note that B n has 2 n+1 elements, so it is finite and therefore it is countable. Hence F is also countable. 17. We can write Z = { n n N } { n n N }. Since Z is a union of two countable sets, it is countable. Now we have Q = { m m Z, n N, n 0 }. So, if we put Q n 0 = and Q n = { m m Z } n for n > 0, we have Q = n N Q n. Now for each n > 0, the function f n : Z Q n given by m m is a bijection, so since Z is countable each Q n n is countable. Thus Q is a countable union of countable sets, hence countable. 18. By Exercise 17, we know that Q is countable, so we can enumerate it as { q n n N }. For each n N, let A n = { i I q n U i }. Clearly each A n I, so n N A n I. Conversely, if i I then there must be some q Q U i, and q = q n for some n. But then i A n for some n, so i n N A n. Thus we have I = n N A n. Now, if all the sets A n were countable, we would know that I is also countable. But I is not countable. So at least one of the sets A n must be uncountable. Put q = q n. Then since A n is uncountable, q U i for uncountably many i I, as required. 19. We will show that Σ L B, by showing that Σ = B. So let v be a valuation which satisfies Σ. Then (since we know that v cannot satisfy Σ {B}), v(b) = 0. So v( B) = 1. This shows that Σ = B so by the Adequacy Theorem we have Σ L B. We also know that Σ L ( B (B A)), so by modus ponens we have Σ L (B A). MATHS 315 Lecture notes Page 29 of 31

32 20. If Σ {(A B)} is satisfiable then we are done, so suppose Σ {(A B)} is not satisfiable. We want to show that Σ L B, and by the Adequacy Theorem it is enough to show that Σ = B. So let v be a valuation which satisfies Σ. Since v cannot satisfy Σ {(A B)} we must have v((a B)) = 0. But then we must have v(a) = 1 and v(b) = 0. Hence v( B) = 1. Since this is true for every such v, we have Σ = B, and so by the Adequacy Theorem Σ L B. MATHS 315 Lecture notes Page 30 of 31

### Fundamentals of Mathematics Lecture 6: Propositional Logic

Fundamentals of Mathematics Lecture 6: Propositional Logic Guan-Shieng Huang National Chi Nan University, Taiwan Spring, 2008 1 / 39 Connectives Propositional Connectives I 1 Negation: (not A) A A T F

### 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

### Mathematical Induction

Mathematical Induction MAT30 Discrete Mathematics Fall 016 MAT30 (Discrete Math) Mathematical Induction Fall 016 1 / 19 Outline 1 Mathematical Induction Strong Mathematical Induction MAT30 (Discrete Math)

### Mathematical Induction

Mathematical Induction Everybody do the wave! The Wave If done properly, everyone will eventually end up joining in. Why is that? Someone (me!) started everyone off. Once the person before you did the

### 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,

### Sets and Subsets. Countable and Uncountable

Sets and Subsets Countable and Uncountable Reading Appendix A Section A.6.8 Pages 788-792 BIG IDEAS Themes 1. There exist functions that cannot be computed in Java or any other computer language. 2. There

### 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)

### Finite Sets. Theorem 5.1. Two non-empty finite sets have the same cardinality if and only if they are equivalent.

MATH 337 Cardinality Dr. Neal, WKU We now shall prove that the rational numbers are a countable set while R is uncountable. This result shows that there are two different magnitudes of infinity. But we

### 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

### 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.

### 1. R In this and the next section we are going to study the properties of sequences of real numbers.

+a 1. R In this and the next section we are going to study the properties of sequences of real numbers. Definition 1.1. (Sequence) A sequence is a function with domain N. Example 1.2. A sequence of real

### Deductive Systems. Marco Piastra. Artificial Intelligence. Artificial Intelligence - A.A Deductive Systems [1]

Artificial Intelligence Deductive Systems Marco Piastra Artificial Intelligence - A.A. 2012- Deductive Systems 1] Symbolic calculus? A wff is entailed by a set of wff iff every model of is also model of

### LOGICAL INFERENCE & PROOFs. Debdeep Mukhopadhyay Dept of CSE, IIT Madras

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

### CARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE

CARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE With the notion of bijection at hand, it is easy to formalize the idea that two finite sets have the same number of elements: we just need to verify

### 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

### Chapter 6 Finite sets and infinite sets. Copyright 2013, 2005, 2001 Pearson Education, Inc. Section 3.1, Slide 1

Chapter 6 Finite sets and infinite sets Copyright 013, 005, 001 Pearson Education, Inc. Section 3.1, Slide 1 Section 6. PROPERTIES OF THE NATURE NUMBERS 013 Pearson Education, Inc.1 Slide Recall that denotes

### DISCRETE MATHEMATICS W W L CHEN

DISCRETE MATHEMATICS W W L CHEN c W W L Chen, 1982, 2008. This chapter originates from material used by the author at Imperial College, University of London, between 1981 and 1990. It is available free

### CHAPTER 7 GENERAL PROOF SYSTEMS

CHAPTER 7 GENERAL PROOF SYSTEMS 1 Introduction Proof systems are built to prove statements. They can be thought as an inference machine with special statements, called provable statements, or sometimes

### 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 (

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

CS 70 Discrete Mathematics and Probability Theory Fall 009 Satish Rao, David Tse Note 0 Infinity and Countability Consider a function (or mapping) f that maps elements of a set A (called the domain of

### 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

### 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

### Introducing Functions

Functions 1 Introducing Functions A function f from a set A to a set B, written f : A B, is a relation f A B such that every element of A is related to one element of B; in logical notation 1. (a, b 1

### On the number of lines of theorems in the formal system MIU

On the number of lines of theorems in the formal system MIU Armando B. Matos Technical Report Series: DCC -- -- Departamento de Ciência de Computadores Faculdade de Ciências & Laboratório de Inteligência

### In mathematics you don t understand things. You just get used to them. (Attributed to John von Neumann)

Chapter 1 Sets and Functions We understand a set to be any collection M of certain distinct objects of our thought or intuition (called the elements of M) into a whole. (Georg Cantor, 1895) In mathematics

### Mathematical Logic and its Application to. Computer Science. Lecture Notes

Mathematical Logic and its Application to Computer Science Lecture Notes Eitan Farchi farchi@il.ibm.com Yochai Ben-Chaim yochaib@il.ibm.com March 3, 2010 1 Contents 1 Introduction 9 1.1 The Knaves and

### CHAPTER 5: MODULAR ARITHMETIC

CHAPTER 5: MODULAR ARITHMETIC LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN 1. Introduction In this chapter we will consider congruence modulo m, and explore the associated arithmetic called

### Finite and Infinite Sets

Chapter 9 Finite and Infinite Sets 9. Finite Sets Preview Activity (Equivalent Sets, Part ). Let A and B be sets and let f be a function from A to B..f W A! B/. Carefully complete each of the following

### 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

### Sets and Cardinality Notes for C. F. Miller

Sets and Cardinality Notes for 620-111 C. F. Miller Semester 1, 2000 Abstract These lecture notes were compiled in the Department of Mathematics and Statistics in the University of Melbourne for the use

### Climbing an Infinite Ladder

Section 5.1 Climbing an Infinite Ladder Suppose we have an infinite ladder and the following capabilities: 1. We can reach the first rung of the ladder. 2. If we can reach a particular rung of the ladder,

### 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

### 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

### 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

### 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

### 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

### , A A {(A (B C))}, ((A B) C) {A}, (B A) {(A A)}, A {(A B), ( A C))}, (B C)

1. Axioms and rules of inference for propositional logic. Suppose T = L, A, R is a formal theory. Whenever H is a finite subset of L and C L it is evident that H, C R H C. Fix a set X of propositional

### 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)

### 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

### 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

### Chapter 1. Informal introdution to the axioms of ZF.

Chapter 1. Informal introdution to the axioms of ZF. 1.1. Extension. Our conception of sets comes from set of objects that we know well such as N, Q and R, and subsets we can form from these determined

### Affine Planes: An Introduction to Axiomatic Geometry

Affine Planes: An Introduction to Axiomatic Geometry Here we use Euclidean plane geometry as an opportunity to introduce axiomatic systems. Keep in mind that the axiomatic approach is not the only approach

### 13 Infinite Sets. 13.1 Injections, Surjections, and Bijections. mcs-ftl 2010/9/8 0:40 page 379 #385

mcs-ftl 2010/9/8 0:40 page 379 #385 13 Infinite Sets So you might be wondering how much is there to say about an infinite set other than, well, it has an infinite number of elements. Of course, an infinite

### REAL ANALYSIS I HOMEWORK 2

REAL ANALYSIS I HOMEWORK 2 CİHAN BAHRAN The questions are from Stein and Shakarchi s text, Chapter 1. 1. Prove that the Cantor set C constructed in the text is totally disconnected and perfect. In other

### Cardinality. The set of all finite strings over the alphabet of lowercase letters is countable. The set of real numbers R is an uncountable set.

Section 2.5 Cardinality (another) Definition: The cardinality of a set A is equal to the cardinality of a set B, denoted A = B, if and only if there is a bijection from A to B. If there is an injection

### 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

### Section 3 Sequences and Limits

Section 3 Sequences and Limits Definition A sequence of real numbers is an infinite ordered list a, a 2, a 3, a 4,... where, for each n N, a n is a real number. We call a n the n-th term of the sequence.

### 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

### I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

### Lecture 3. Mathematical Induction

Lecture 3 Mathematical Induction Induction is a fundamental reasoning process in which general conclusion is based on particular cases It contrasts with deduction, the reasoning process in which conclusion

### Discrete Mathematics, Chapter 5: Induction and Recursion

Discrete Mathematics, Chapter 5: Induction and Recursion Richard Mayr University of Edinburgh, UK Richard Mayr (University of Edinburgh, UK) Discrete Mathematics. Chapter 5 1 / 20 Outline 1 Well-founded

### It is not immediately obvious that this should even give an integer. Since 1 < 1 5

Math 163 - Introductory Seminar Lehigh University Spring 8 Notes on Fibonacci numbers, binomial coefficients and mathematical induction These are mostly notes from a previous class and thus include some

### Structure of Measurable Sets

Structure of Measurable Sets In these notes we discuss the structure of Lebesgue measurable subsets of R from several different points of view. Along the way, we will see several alternative characterizations

### 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

### p 2 1 (mod 6) Adding 2 to both sides gives p (mod 6)

.9. Problems P10 Try small prime numbers first. p p + 6 3 11 5 7 7 51 11 13 Among the primes in this table, only the prime 3 has the property that (p + ) is also a prime. We try to prove that no other

### Math/CSE 1019: Discrete Mathematics for Computer Science Fall Suprakash Datta

Math/CSE 1019: Discrete Mathematics for Computer Science Fall 2011 Suprakash Datta datta@cse.yorku.ca Office: CSEB 3043 Phone: 416-736-2100 ext 77875 Course page: http://www.cse.yorku.ca/course/1019 1

### Elementary Number Theory We begin with a bit of elementary number theory, which is concerned

CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,

### 0 ( x) 2 = ( x)( x) = (( 1)x)(( 1)x) = ((( 1)x))( 1))x = ((( 1)(x( 1)))x = ((( 1)( 1))x)x = (1x)x = xx = x 2.

SOLUTION SET FOR THE HOMEWORK PROBLEMS Page 5. Problem 8. Prove that if x and y are real numbers, then xy x + y. Proof. First we prove that if x is a real number, then x 0. The product of two positive

### Consistency, completeness of undecidable preposition of Principia Mathematica. Tanmay Jaipurkar

Consistency, completeness of undecidable preposition of Principia Mathematica Tanmay Jaipurkar October 21, 2013 Abstract The fallowing paper discusses the inconsistency and undecidable preposition of Principia

### 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

### Logic & Discrete Math in Software Engineering (CAS 701) Dr. Borzoo Bonakdarpour

Logic & Discrete Math in Software Engineering (CAS 701) Background Dr. Borzoo Bonakdarpour Department of Computing and Software McMaster University Dr. Borzoo Bonakdarpour Logic & Discrete Math in SE (CAS

### This chapter is all about cardinality of sets. At first this looks like a

CHAPTER Cardinality of Sets This chapter is all about cardinality of sets At first this looks like a very simple concept To find the cardinality of a set, just count its elements If A = { a, b, c, d },

### MATH10040 Chapter 2: Prime and relatively prime numbers

MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive

### 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

### 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

### Notes on Modal Logic

Notes on Modal Logic Notes for Philosophy 151 Eric Pacuit January 28, 2009 These short notes are intended to supplement the lectures and text ntroduce some of the basic concepts of Modal Logic. The primary

### An important class of codes are linear codes in the vector space Fq n, where F q is a finite field of order q.

Chapter 3 Linear Codes An important class of codes are linear codes in the vector space Fq n, where F q is a finite field of order q. Definition 3.1 (Linear code). A linear code C is a code in Fq n for

### Theorem 2. If x Q and y R \ Q, then. (a) x + y R \ Q, and. (b) xy Q.

Math 305 Fall 011 The Density of Q in R The following two theorems tell us what happens when we add and multiply by rational numbers. For the first one, we see that if we add or multiply two rational 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,

### Chap2: The Real Number System (See Royden pp40)

Chap2: The Real Number System (See Royden pp40) 1 Open and Closed Sets of Real Numbers The simplest sets of real numbers are the intervals. We define the open interval (a, b) to be the set (a, b) = {x

### 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

### Discrete Mathematics

Slides for Part IA CST 2014/15 Discrete Mathematics Prof Marcelo Fiore Marcelo.Fiore@cl.cam.ac.uk What are we up to? Learn to read and write, and also work with, mathematical

### This asserts two sets are equal iff they have the same elements, that is, a set is determined by its elements.

3. Axioms of Set theory Before presenting the axioms of set theory, we first make a few basic comments about the relevant first order logic. We will give a somewhat more detailed discussion later, but

### -123- A Three-Valued Interpretation for a Relevance Logic. In thi.s paper an entailment relation which holds between certain

Dr. Frederick A. Johnson Department of Philosophy Colorado State University Fort Collins, Colorado 80523-23- A Three-Valued Interpretation for a Relevance Logic In thi.s paper an entailment relation which

### Sets and functions. {x R : x > 0}.

Sets and functions 1 Sets The language of sets and functions pervades mathematics, and most of the important operations in mathematics turn out to be functions or to be expressible in terms of functions.

### Math 421, Homework #5 Solutions

Math 421, Homework #5 Solutions (1) (8.3.6) Suppose that E R n and C is a subset of E. (a) Prove that if E is closed, then C is relatively closed in E if and only if C is a closed set (as defined in Definition

### Problem Set. Problem Set #2. Math 5322, Fall December 3, 2001 ANSWERS

Problem Set Problem Set #2 Math 5322, Fall 2001 December 3, 2001 ANSWERS i Problem 1. [Problem 18, page 32] Let A P(X) be an algebra, A σ the collection of countable unions of sets in A, and A σδ the collection

### 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

### 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

### ALGEBRA HANDOUT 2: IDEALS AND QUOTIENTS. 1. Ideals in Commutative Rings In this section all groups and rings will be commutative.

ALGEBRA HANDOUT 2: IDEALS AND QUOTIENTS PETE L. CLARK 1. Ideals in Commutative Rings In this section all groups and rings will be commutative. 1.1. Basic definitions and examples. Let R be a (commutative!)

### Pythagorean Triples, Complex Numbers, Abelian Groups and Prime Numbers

Pythagorean Triples, Complex Numbers, Abelian Groups and Prime Numbers Amnon Yekutieli Department of Mathematics Ben Gurion University email: amyekut@math.bgu.ac.il Notes available at http://www.math.bgu.ac.il/~amyekut/lectures

### CHAPTER 5. Number Theory. 1. Integers and Division. Discussion

CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a

### Chapter 1. Sigma-Algebras. 1.1 Definition

Chapter 1 Sigma-Algebras 1.1 Definition Consider a set X. A σ algebra F of subsets of X is a collection F of subsets of X satisfying the following conditions: (a) F (b) if B F then its complement B c is

### INCIDENCE-BETWEENNESS GEOMETRY

INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full

### Induction and Recursion

Induction and Recursion Winter 2010 Mathematical Induction Mathematical Induction Principle (of Mathematical Induction) Suppose you want to prove that a statement about an integer n is true for every positive

### Chapter 1 Basic Number Concepts

Draft of September 2014 Chapter 1 Basic Number Concepts 1.1. Introduction No problems in this section. 1.2. Factors and Multiples 1. Determine whether the following numbers are divisible by 3, 9, and 11:

### 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

### The Predicate Calculus in AI

Last time, we: The Predicate Calculus in AI Motivated the use of Logic as a representational language for AI (Can derive new facts syntactically - simply by pushing symbols around) Described propositional

### f(x) is a singleton set for all x A. If f is a function and f(x) = {y}, we normally write

Math 525 Chapter 1 Stuff If A and B are sets, then A B = {(x,y) x A, y B} denotes the product set. If S A B, then S is called a relation from A to B or a relation between A and B. If B = A, S A A is called

### Mathematical induction & Recursion

CS 441 Discrete Mathematics for CS Lecture 15 Mathematical induction & Recursion Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Proofs Basic proof methods: Direct, Indirect, Contradiction, By Cases,

### Notes on counting finite sets

Notes on counting finite sets Murray Eisenberg February 26, 2009 Contents 0 Introduction 2 1 What is a finite set? 2 2 Counting unions and cartesian products 4 2.1 Sum rules......................................

### Further linear algebra. Chapter I. Integers.

Further linear algebra. Chapter I. Integers. Andrei Yafaev Number theory is the theory of Z = {0, ±1, ±2,...}. 1 Euclid s algorithm, Bézout s identity and the greatest common divisor. We say that a Z divides

### Sets, Relations and Functions

Sets, Relations and Functions Eric Pacuit Department of Philosophy University of Maryland, College Park pacuit.org epacuit@umd.edu ugust 26, 2014 These notes provide a very brief background in discrete

### MATH20302 Propositional Logic. Mike Prest School of Mathematics Alan Turing Building Room

MATH20302 Propositional Logic Mike Prest School of Mathematics Alan Turing Building Room 1.120 mprest@manchester.ac.uk April 10, 2015 Contents I Propositional Logic 3 1 Propositional languages 4 1.1 Propositional

### This chapter describes set theory, a mathematical theory that underlies all of modern mathematics.

Appendix A Set Theory This chapter describes set theory, a mathematical theory that underlies all of modern mathematics. A.1 Basic Definitions Definition A.1.1. A set is an unordered collection of elements.

### POSITIVE INTEGERS, INTEGERS AND RATIONAL NUMBERS OBTAINED FROM THE AXIOMS OF THE REAL NUMBER SYSTEM

MAT 1011 TECHNICAL ENGLISH I 03.11.2016 Dokuz Eylül University Faculty of Science Department of Mathematics Instructor: Engin Mermut Course assistant: Zübeyir Türkoğlu web: http://kisi.deu.edu.tr/engin.mermut/

### Problems on Discrete Mathematics 1

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

### 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.