At least one of us is a knave. What are A and B?
|
|
- Bryan Francis
- 5 years ago
- Views:
Transcription
1 1. This is a puzzle about an island in which everyone is either a knight or a knave. Knights always tell the truth and knaves always lie. This problem is about two people A and B, each of whom is either a knight or a knave. A made the following statement: At least one of us is a knave. What are A and B? (a) A and B are both knights. (b) A is a knight and B is a knave. (c) A is a knave and B is a knight. (d) A and B are both knaves. (e) None of the above. 1
2 2. Let p and q be the propositions: p: It is below freezing. q: It is snowing. Which of the following expresses the statement: It is either snowing or below freezing. (a) p q (b) p q (c) p q (d) None of the above 2
3 3. Let p and q be the propositions: p: It is below freezing. q: It is snowing. Which of the following expresses the statement: It is snowing but not below freezing. (a) p q (b) q p. (c) p q. (d) p q (e) None of the above (it is impossible to be above freezing and snowing). 3
4 4. On the island of knights and knaves, suppose A says, Either I am a knave or B is a knight. What are A and B? (a) A and B are both knights. (b) A is a knight and B is a knave. (c) A is a knave and B is a knight. (d) A and B are both knaves. (e) None of the above. 4
5 5. Determine whether the following statement is true or false: If = 3 then = 4. (a) True (b) False (c) Part of it is true and part of it is false. (d) Can t decide, since the statement is nonsense. 5
6 6. Choose the statement that describes you best. (a) I looked at the course website and the textbook. (b) I looked at the course website but not the textbook. (c) I looked at the textbook but not the course website. (d) I haven t looked at either, but I will before next class. 6
7 7. What is my name? (a) Dr. Ford (b) Dr. Doedel (c) Dr. Narayanan (d) Don t know 7
8 8. p q (p q) ( p q) (a) is a true statement. (b) is a false statement. (c) is sometimes true, sometimes false. (d) don t know. 8
9 9. Let the universe of discourse be all integers. Then the truth value of x x 3 > x is: (a) False (b) True (c) Sometimes true, sometimes false (d) Don t know 9
10 10. Which of the two parts in Q 3 of worksheet 2 are logically equivalent? (a) Parts (c) and (d) are equivalent. (b) Parts (b) and (c) are equivalent. (c) Parts (e) and (f) are equivalent. (d) Parts (c) and (f) are equivalent. (e) Parts (a) and (e) are equivalent. 10
11 11. The negation of the statement x P (x) Q(x) is (a) x (P (x) Q(x)) (b) x P (x) Q(x) (c) x Q(x) P (x) (d) x P (x) Q(x) (e) Don t know. 11
12 12. Let P (x) denote x drinks tea and Q(x) denote x does not drink coffee. Let the universe of discourse be all Concordia students. Then the statement x P (x) Q(x) means (a) All Concordia students drink either tea or coffee. (b) There is a Concordia student who drinks tea but not coffee. (c) All Concordia students who drink coffee also drink tea. (d) All Concordia students drink both coffee and tea. (e) All Concordia students who drink tea also drink coffee. 12
13 13. How am I doing in terms of pace? (a) Too fast (b) Too slow (c) About right 13
14 14. Let the universe of discourse be integers and let P (x) denote the predicate x is the square root of 2. Then the statement x P (x) means (a) There is no integer which is the square root of 2. (b) There is an integer which is not the square root of 2. (c) Every integer is not the square root of 2. (d) There is an integer which is the square root of 2. (e) Don t know. 14
15 15. Let the universe of discourse be integers and let P (x) denote the predicate x is the square root of 2. Then the statement x P (x) means (a) There is no integer which is the square root of 2. (b) Not every integer is the square root of 2. (c) Every integer is not the square root of 2. (d) There is an integer which is the square root of 2. (e) Don t know. 15
16 16. Let L(x, y) denote the predicate x loves y and the universe of discourse for x and y be the set of all people. Then the statement x y L(x, y) means (a) Somebody loves everybody. (b) There is someone who everybody loves. (c) Nobody loves everybody. (d) Everybody loves somebody. 16
17 17. Let L(x, y) denote the predicate x loves y and the universe of discourse for x and y be the set of all people. Then the statement x y L(x, y) means (a) Nobody loves everybody. (b) Everybody loves somebody. (c) There is someone who everybody loves. (d) Somebody loves everybody.
18 18. Poll on assignment (a) I have finished doing the assignment. (b) I have finished most of the assignment. (c) I have started the assignment but have not made much headway. (d) I have not even looked at the assignment yet. 17
19 19. The statement x y z x 2 + y > z (a) is true. (b) is false. (c) is sometimes true, sometimes false. 18
20 20. The statement x [P (x) Q(x)] [ xp (x) xq(x)] (a) is true. (b) is false. (c) is sometimes true, sometimes false. 19
21 21. Let the universe of discourse be all integers. Then the truth value of x y z x 2 + y > z is: (a) true (b) false (c) sometimes true, sometimes false 20
22 22. ( x P (x) Q(x)) x Q(x) P (x) (a) is true. (b) is false. (c) is sometimes true, sometimes false. (d) Don t know. 21
23 23. Let the universe of discourse be all students and let C(x, y) be the statement x has chatted with y. Then the statement x y C(y, x) means (a) There is a student who has not chatted with any student. (b) There is no student who has chatted with another student. (c) There is a student who has chatted with all students. (d) Every student has chatted with some student. (e) There is a student who no student has chatted with. 22
24 24. Let the universe of discourse be all students and let C(x, y) be the statement x has chatted with y. Then the statement x y z z x z y x y C(x, y) C(x, z) means (a) Every student has chatted with y and z. (b) Every student has chatted with at least two other students. (c) y and z and x are all different and x has chatted with y and z. (d) There is a student who has chatted with every student. (e) There are two students who have chatted with every student. 23
25 25. Let the universe of discourse be all students and let C(x, y) be the statement x has chatted with y. Then the statement x C(x, John) y y John C(x, y) means (a) There is a student who has chatted only with John. (b) There is a student who is the only one John has chatted with. (c) Some students have chatted only with John. (d) Every student has chatted with John. (e) If a student has chatted with John, then he hasn t chatted with anyone else. 24
26 26. Poll on background reading: I have caught up on my reading upto (a) Section 1.4 (b) Section 1.3 (c) Section 1.2 (d) Section 1.1 (e) I haven t opened the textbook yet. 25
27 27. Poll on assignment (a) I have finished doing the assignment. (b) I have finished most of the assignment. (c) I have started the assignment but have not made much headway. (d) I have not even looked at the assignment yet. 26
28 28. What rule of inference is used in the following argument? If it snows today, the university will close. The university is not closed today. Therefore, it did not snow today. (a) Modus ponens (b) Modus tollens (c) Hypothetical syllogism (d) Simplification (e) Disjunctive syllogism 27
29 29. What rule of inference is used in the following argument? It is either hot today or the pollution is dangerous. It is not hot today. Therefore the pollution is dangerous. (a) Modus ponens (b) Modus tollens (c) Hypothetical syllogism (d) Disjunctive syllogism (e) Addition 28
30 30. In the Logic Problem, we have the following two assumptions: 1. Either logic is difficult or not many students like logic. 2. If mathematics is easy, then logic is not difficult. Is the following a valid conclusion of these assumptions? Mathematics is not easy, if many students like logic. (a) Yes (b) No (c) No clue 29
31 31. All poets are interesting people. Ann is an interesting person. Therefore, Ann is a poet. The above argument is an example of (a) a valid argument. (b) converse error (fallacy of affirming the conclusion). (c) inverse error (fallacy of denying the hypothesis). (d) circular reasoning. 30
32 32. The following argument is valid: All vegetarians eat vegetables. Some people who eat vegetables eat candy. Therefore, some vegetarians eat candy. (a) true (b) false (c) sometimes true, sometimes false 31
33 33. The following argument is valid: All movies made by John Sayles are wonderful. John Sayles made a movie about coal miners. Therefore, there is a movie about coal miners that is wonderful. (a) true (b) false (c) sometimes true, sometimes false 32
34 If x is even and y is odd, then x + 2y is even. 34. To prove the above statement using a direct proof, we start by assuming: (a) x is even, y is odd and x + 2y is odd. (b) x is even and y is odd. (c) x is even, y is odd and x + 2y is even. (d) x is odd or y is even. (e) If x is even and y is odd, then x + 2y is even. 33
35 35. Consider the statement: If 5x is even, then x is even. To prove this statement using an indirect proof, we would start by assuming that: (a) 5x is even. (b) x is even. (c) 5x is odd. (d) x is odd. (e) 5x is even and x is odd. 34
36 36. Consider the statement: If x is rational, and y is irrational, then x + y is irrational. To prove this statement using a proof by contradiction, we would start by assuming that: (a) x is rational, and y is irrational. (b) x is rational, y is irrational, and x + y is rational. (c) x is irrational, y is rational, and x + y is irrational. (d) If x is rational and y is irrational, then x + y is rational. (e) If x is irrational and y is rational, then x + y is irrational. 35
37 37. Let A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6}. Then the set {1, 2} is equal to (a) A B (b) A B (c) A B (d) A B (e) none of the specified sets 36
38 38. Let A = 4. Then P (A) = (a) 16 (b) 4 (c) 32 (d) 8 37
39 39. [(A B) (A B) = A] B = The above statement is (a) true (b) false (c) sometimes true, sometimes false 38
40 40. Let A and B be sets. Then {x x A x / B} can also be expressed as (a) A B (b) A B (c) A B (d) A = B (e) A / B.
41 41. Let A and B be sets. Then x x A x / B can also be expressed as (a) A B (b) A B (c) B A (d) A B (e) A / B.
42 42. Poll on test (a) I am feeling very prepared for the test. (b) I have been reviewing material, but don t yet feel completely prepared. (c) I haven t prepared for the test yet, but I think I ll be okay. (d) Help! I am really nervous. 39
43 43. Which of the following is not a function from R to R? (a) f(x) = x (b) f(x) = x (c) f(x) = 1/x (d) f(x) = x 5 40
44 44. Let f : Z Z be a function such that f(x) = (x + 2) 2. Then f is (a) one-to-one (b) not one-to-one (c) neither of the above (d) don t know 41
45 45. Let f : Z Z be a function such that f(x) = x 3 1. Then f is (a) onto (b) not onto (c) neither of the above (d) don t know 42
46 46. Let f : Z Z Z be a function such that f(m, n) = m n. Then f is (a) one-to-one and onto (b) one-to-one but not onto (c) onto but not one-to-one (d) neither one-to-one nor onto (e) don t know 43
47 47. Let f : R R be a function such that f(x) = x 3 1. Then (a) f 1 (x) = (x + 1) 1/3 (b) f 1 (x) = x 1/3 + 1 (c) f 1 (x) = x 1/3 1 (d) f is not invertible. 44
48 48. Let f and g be functions from Z to Z such that f(x) = x + 5 and g(x) = x 2 + x + 1. (a) f g(x) = x 2 + x + 6 (b) f g(x) = x x + 26 (c) f g(x) = x x + 31 (d) f g is not defined. 45
49 49. If f and f g are both onto, then does it follow that g is onto? (a) yes (b) no (c) don t know 46
50 50. For every real number x x = x The above statement is (a) false (b) true (c) sometimes true, sometimes false. 47
51 51. Poll on test: (a) It was too easy. (b) It was easy but not too easy. (c) It was reasonable, but a bit hard. (d) It was way too hard. 48
52 52. For all integers a, if a 0 then a 0. The above statement is (a) true (b) false (c) sometimes true, sometimes false 49
53 53. For all integers a, b, and c, if a b and a c, then a bc. The above statement is (a) true (b) false 50
54 54. Which of the following numbers is a prime? (a) 15 (b) 23 (c) 93 (d)
55 55. Which of the following is equal to gcd( , 2 2 7)? (a) 14 (b) 8 (c) 7 (d) 4 52
56 56. Which of the following integers is equal to 17 mod 3? (a) -2 (b) -1 (c) 1 (d) 2 53
57 57. Consider the statement If n is an even integer, then n 2 0 (mod 6) or n 2 4 (mod 6). A proof of the above statement should consider the cases: (a) n 2 = 6k; n 2 = 6k + 4 where k Z. (b) n = 2k; n = 2k + 1 where k Z. (c) n = 6k; n = 6k + 2; n = 6k + 4 where k Z. (d) n 2 = 2k; n 2 = 2k + 1 where k Z. 54
58 58. Consider the statement: If n is prime, then at least one of n + 2 and n + 4 is a composite number. To prove the above statement using a proof by contradiction, we start by assuming: (a) n, n + 2, n + 4 are all prime numbers. (b) n is a prime number and at least one of n + 2 and n + 4 is not a composite number. (c) If n is prime, then both n + 2 and n + 4 are composite numbers. (d) If n is a composite number, then n + 2 and n + 4 are both prime numbers. 55
59 59. Using the Euclidean algorithm, how many steps does it take to find gcd(280, 98)? (a) 2 (b) 3 (c) 4 (d) 6 56
60 60. Consider the statement If n is an even integer, then n 2 0 (mod 6) or n 2 4 (mod 6). A proof of the above statement should consider the cases: (a) n 2 = 6k; n 2 = 6k + 4 where k Z. (b) n = 2k; n = 2k + 1 where k Z. (c) n = 6k; n = 6k + 2; n = 6k + 4 where k Z. (d) n 2 = 2k; n 2 = 2k + 1 where k Z. 57
61 61. Using the Euclidean algorithm, find gcd(441, 28). It is (a) 2 (b) 4 (c) 7 (d) 14 58
62 62. Consider the statement n = 3(5 n+1 1)/4 whenever n is a non-negative integer. In the basis step of a proof by induction, we need to verify that (a) = 3(5 1 1)/4 (b) = 3(5 2 1)/4 (c) 3 = 3(5 1)/4 59
63 63. Let P (n) be the statement n(n + 1) = n(n + 1)(n + 2)/3 Then the statement P (n + 1) is (a) (n + 1)(n + 2) = (n)(n + 1)(n + 2)/3 (b) (n + 1)(n + 2) = (n + 1)(n + 2)(n + 3)/3 (c) (n + 2)(n + 3) = (n + 1)(n + 2)(n + 3)/3 (d) (n)(n + 2) = (n)(n + 2)(n + 3)/3 60
64 64. equals (a) 1/2 (b) 2/ n n + 1 (c) (n + 1)/(n + 2) (d) n/(n + 1) (e) None of the above 61
65 65. Consider the statement H 2 n > 1 + n/2 whenever n is a non-negative integer and H j is the j-th harmonic number. In the basis step of a proof by induction, we need to verify that (a) H 0 = (b) H 1 = 1 (c) H 0 1 (d) H 1 1 (e) H 1 3/2 62
66 66. For which non-negative integers is n 2 n!? Give the most accurate answer. (a) n 1 (b) n 2 (c) n 3 (d) n 4 (e) n 5 63
67 67. What is wrong with the following proof of the statement All horses have the same color. Let P (n) be the proposition that all horses in any set of n horses have the same color. Basis: Clearly, P (1) is true. Induction step: Assume P (k) is true, so that all horses in any set of k horses have the same color. Now consider a set of k + 1 horses, number them as 1, 2,... k + 1. Now by the inductive hypothesis, the first k of them must have the same color, and the last k must also have the same color. Therefore, they must all have the same color and P (k + 1) is true. 64
68 68. We want to prove by induction that n 2 1 is divisible by 8 whenever n is an odd positive integer. In the inductive step, we assume that 8 divides k 2 1 for some odd positive integer k. What do we need to prove? (a) 8 divides k 1. (b) 8 divides k 2 1. (c) 8 divides (k + 1) 2 1 (d) 8 divides (k + 2) 2 1 (e) Don t know 65
69 69. How many subsets does a set of n elements have? (a) n (b) n 2 (c) 2 n (d) n! (e) Don t know 66
70 70. Consider the following recursive definition for function f: f(0) = 3 f(n + 1) = 2f(n) for all n 0 Then: (a) f(3) = 24 (b) f(3) = 12 (c) f(3) = 24 (d) f(3) = 12 (e) Don t know 67
71 71. Consider the following recursive definition of a set: 0 S If i S, then i + 2 S Then S is the (a) the set of even integers. (b) the set of odd integers. (c) the set of powers of 2. (d) the set of even positive integers. (e) the set of even non-negative integers. 68
72 72. Poll on test: (a) It was too easy. (b) It was easy but not too easy. (c) It was the perfect level of difficulty. (d) It was reasonable, but a bit hard. (e) It was way too hard. 70
73 73. Consider the relation R on the set {1, 2, 3, 4, 5} where xry if and only if x > y. What is the number of non-zero entries in the matrix for R? (a) 9 (b) 10 (c) 15 (d) 25
74 74. Let R Z Z be the relation defined as follows: (x, y) R if and only if x + y = 0 Then R is reflexive. (a) true (b) false 71
75 75. Let R Z Z be the relation defined as follows: (x, y) R if and only if x + y = 0 Then R is symmetric. (a) true (b) false 72
76 76. Let R Z Z be the relation defined as follows: (x, y) R if and only if x + y = 0 Then R is anti-symmetric. (a) true (b) false 73
77 77. Let R Z Z be the relation defined as follows: (x, y) R if and only if x + y = 0 Then R is transitive. (a) true (b) false 74
78 78. Let R Z Z be the relation defined as follows: (x, y) R if and only if x + y = 0 Then R is transitive. (a) true (b) false 75
79 79. Let R Z Z be the relation defined as follows: (x, y) R if and only if x + y = 0 Then R is transitive. (a) true (b) false 76
80 80. Let R be a relation on the real numbers defined as follows: (x, y) R if and only if x = y + 1 or x = y 1 Then R is reflexive. (a) true (b) false 77
81 81. Let R be a relation on the real numbers defined as follows: (x, y) R if and only if x = y + 1 or x = y 1 Then R is symmetric. (a) true (b) false 78
82 82. Let R be a relation on the real numbers defined as follows: (x, y) R if and only if x = y + 1 or x = y 1 Then R is anti-symmetric. (a) true (b) false 79
83 83. Let R be a relation on the real numbers defined as follows: (x, y) R if and only if x = y + 1 or x = y 1 Then R is transitive. (a) true (b) false 80
84 84. Let R be a relation on the real numbers defined as follows: (x, y) R if and only if x y 2 Then R is reflexive. (a) true (b) false 81
85 85. Let R be a relation on the real numbers defined as follows: (x, y) R if and only if x y 2 Then R is symmetric. (a) true (b) false 82
86 86. Let R be a relation on the real numbers defined as follows: (x, y) R if and only if x y 2 Then R is anti-symmetric. (a) true (b) false 83
87 87. Let R be a relation on the real numbers defined as follows: (x, y) R if and only if x y 2 Then R is transitive. (a) true (b) false 84
88 88. I have filled out the online course evaluation for this course. (a) Yes (b) No 85
89 89. Let R be a relation on a set of n elements. What is the maximum number of arcs in a shortest path between two nodes in the graph of the relation? (a) n 1 (b) n (c) n 2 (d) No bound, there could be an infinite number of arcs. 86
90 90. Consider the relation R on the set of integers where xry if and only if x 2 = y 2. (a) R is an equivalence relation. (b) R is not an equivalence relation. 87
91 91. Consider the following equivalence relation R on Z Z: (a, b)r(c, d) if and only if a b = c d. Then the equivalence classes of R are: (a) A k = {(a, b) a, b Z and a b = k} for every k Z (b) A k = {(a + k, k) a Z} for every k Z (c) Both of the above (d) None of the above (e) No idea 88
92 92. Let R be a relation on a set A. Then if R is transitive and symmetric, R must also be reflexive. The above statement is (a) true (b) false 89
93 93. How many relations can be defined on a set of n elements? (a) 2 n (b) n 2 (c) 4n 2 (d) 2 n2 90
94 94. If R is reflexive, then R n must be reflexive for all n 1. (a) true (b) false 91
95 95. If R is anti-symmetric, then R 2 must be anti-symmetric. (a) true (b) false 92
96 96. Consider the relation R = {(a, b), (b, c), (a, d), (c, d), (d, d)} on the set {a, b, c, d}. How many elements does the reflexive closure of R have? (a) 8 (b) 4 (c) 5 (d) 9 93
97 97. If R is a symmetric relation, then its symmetric closure is R. The above statement is (a) true (b) false 94
98 98. Given the matrix representation of an anti-symmetric relation R, you can derive the matrix for the anti-symmetric closure of R by (a) making the entry (x, y) a 1 if both (x, y) and (y, x) were zeroes. (b) making the entry (x, y) a 0 if both (x, y) and (y, x) were ones. (c) zeroing out the diagonal of the matrix. (d) none of the above. 95
WUCT121. Discrete Mathematics. Logic. Tutorial Exercises
WUCT11 Discrete Mathematics Logic Tutorial Exercises 1 Logic Predicate Logic 3 Proofs 4 Set Theory 5 Relations and Functions WUCT11 Logic Tutorial Exercises 1 Section 1: Logic Question1 For each of the
More informationPredicate Logic & Quantification
Predicate Logic & Quantification Things you should do Homework 1 due today at 3pm Via gradescope. Directions posted on the website. Group homework 1 posted, due Tuesday. Groups of 1-3. We suggest 3. In
More informationCSC 125 :: Final Exam May 3 & 5, 2010
CSC 125 :: Final Exam May 3 & 5, 2010 Name KEY (1 5) Complete the truth tables below: p Q p q p q p q p q p q T T T T F T T T F F T T F F F T F T T T F F F F F F T T 6-15. Match the following logical equivalences
More informationLecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel
Lecture Notes on DISCRETE MATHEMATICS Eusebius Doedel c Eusebius J. Doedel, 009 Contents Logic. Introduction............................................................................... Basic logical
More informationPredicate Logic. Andreas Klappenecker
Predicate Logic Andreas Klappenecker Predicates A function P from a set D to the set Prop of propositions is called a predicate. The set D is called the domain of P. Example Let D=Z be the set of integers.
More informationUNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc (MATHEMATICS) I Semester Core Course. FOUNDATIONS OF MATHEMATICS (MODULE I & ii) QUESTION BANK
UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc (MATHEMATICS) (2011 Admission Onwards) I Semester Core Course FOUNDATIONS OF MATHEMATICS (MODULE I & ii) QUESTION BANK 1) If A and B are two sets
More informationCOMP 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 informationLogic 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 informationDiscrete Structures CRN Test 3 Version 1 CMSC 2123 Autumn 2013
. Print your name on your scantron in the space labeled NAME. 2. Print CMSC 223 in the space labeled SUBJECT. 3. Print the date 2-2-203, in the space labeled DATE. 4. Print your CRN, 786, in the space
More informationTest 1 Solutions(COT3100) (1) Prove that the following Absorption Law is correct. I.e, prove this is a tautology:
Test 1 Solutions(COT3100) Sitharam (1) Prove that the following Absorption Law is correct. I.e, prove this is a tautology: ( q (p q) (r p)) r Solution. This is Modus Tollens applied twice, with transitivity
More informationDepartment of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination II (Fall 2007)
Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination II (Fall 2007) Problem 1: Specify two different predicates P (x) and
More informationIntro to Logic and Proofs
Intro to Logic and Proofs Propositions A proposition is a declarative sentence (that is, a sentence that declares a fact) that is either true or false, but not both. Examples: It is raining today. Washington
More informationCHAPTER 1 - LOGIC OF COMPOUND STATEMENTS
CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS 1.1 - Logical Form and Logical Equivalence Definition. A statement or proposition is a sentence that is either true or false, but not both. ex. 1 + 2 = 3 IS a statement
More informationLECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel
LECTURE NOTES on DISCRETE MATHEMATICS Eusebius Doedel 1 LOGIC Introduction. First we introduce some basic concepts needed in our discussion of logic. These will be covered in more detail later. A set is
More information1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : 5 points
Introduction to Discrete Mathematics 3450:208 Test 1 1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : The inverse of E : The
More informationArgument. whenever all the assumptions are true, then the conclusion is true. If today is Wednesday, then yesterday is Tuesday. Today is Wednesday.
Logic and Proof Argument An argument is a sequence of statements. All statements but the first one are called assumptions or hypothesis. The final statement is called the conclusion. An argument is valid
More informationLECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel
LECTURE NOTES on DISCRETE MATHEMATICS Eusebius Doedel 1 LOGIC Introduction. First we introduce some basic concepts needed in our discussion of logic. These will be covered in more detail later. A set is
More informationReadings: Conjecture. Theorem. Rosen Section 1.5
Readings: Conjecture Theorem Lemma Lemma Step 1 Step 2 Step 3 : Step n-1 Step n a rule of inference an axiom a rule of inference Rosen Section 1.5 Provide justification of the steps used to show that a
More informationQuiz 1. Directions: Show all of your work and justify all of your answers.
Quiz 1 1. Let p and q be the following statements. p : Maxwell is a mathematics major. q : Maxwell is a chemistry major. (1) a. Write each of the following in symbolic form using logical connectives. i.
More information3/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 informationTEST BANK Questions for Chapter 1
464 Test Bank Questions and Answers TEST BANK Questions for Chapter 1 What is the negation of the propositions in 1 3? 1. Abby has more than 300 friends on facebook. 2. A messaging package for a cell phone
More informationDepartment of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination I (Spring 2008)
Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination I (Spring 2008) Problem 1: Suppose A, B, C and D are arbitrary sets.
More informationChapter 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 informationProofs: 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 informationSTRATEGIES OF PROBLEM SOLVING
STRATEGIES OF PROBLEM SOLVING Second Edition Maria Nogin Department of Mathematics College of Science and Mathematics California State University, Fresno 2014 2 Chapter 1 Introduction Solving mathematical
More informationPacket #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics
CSC 224/226 Notes Packet #2: Set Theory & Predicate Calculus Barnes Packet #2: Set Theory & Predicate Calculus Applied Discrete Mathematics Table of Contents Full Adder Information Page 1 Predicate Calculus
More informationLogical Operators. Conjunction Disjunction Negation Exclusive Or Implication Biconditional
Logical Operators Conjunction Disjunction Negation Exclusive Or Implication Biconditional 1 Statement meaning p q p implies q if p, then q if p, q when p, q whenever p, q q if p q when p q whenever p p
More informationICS141: Discrete Mathematics for Computer Science I
ICS141: Discrete Mathematics for Computer Science I Dept. Information & Computer Sci., Originals slides by Dr. Baek and Dr. Still, adapted by J. Stelovsky Based on slides Dr. M. P. Frank and Dr. J.L. Gross
More informationSample Problems for all sections of CMSC250, Midterm 1 Fall 2014
Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014 1. Translate each of the following English sentences into formal statements using the logical operators (,,,,, and ). You may also use mathematical
More informationProofs. 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 informationMethods of Proof. 1.6 Rules of Inference. Argument and inference 12/8/2015. CSE2023 Discrete Computational Structures
Methods of Proof CSE0 Discrete Computational Structures Lecture 4 When is a mathematical argument correct? What methods can be used to construct mathematical arguments? Important in many computer science
More informationCSC 125 :: Final Exam December 14, 2011
1-5. Complete the truth tables below: CSC 125 :: Final Exam December 14, 2011 p q p q p q p q p q p q T T F F T F T F (6 9) Let p be: Log rolling is fun. q be: The sawmill is closed. Express these as English
More informationDiscrete Mathematics for CS Spring 2006 Forbes HW 1 Solutions
CompSci 102 Discrete Mathematics for CS Spring 2006 Forbes HW 1 Solutions 1. (2 pts.) Basics Thanks for your responses 2. (13 pts.) Book problems - Warmup for Recitation (a) 1.2 Exercise 36: The statement
More informationFull file at Chapter 1
Chapter 1 Use the following to answer questions 1-5: In the questions below determine whether the proposition is TRUE or FALSE 1. 1 + 1 = 3 if and only if 2 + 2 = 3. 2. If it is raining, then it is raining.
More informationChapter 1, Logic and Proofs (3) 1.6. Rules of Inference
CSI 2350, Discrete Structures Chapter 1, Logic and Proofs (3) Young-Rae Cho Associate Professor Department of Computer Science Baylor University 1.6. Rules of Inference Basic Terminology Axiom: a statement
More informationReexam in Discrete Mathematics
Reexam in Discrete Mathematics First Year at the Faculty of Engineering and Science and the Technical Faculty of IT and Design August 15th, 2017, 9.00-13.00 This exam consists of 11 numbered pages with
More informationLogic and Proof. Aiichiro Nakano
Logic and Proof Aiichiro Nakano Collaboratory for Advanced Computing & Simulations Department of Computer Science Department of Physics & Astronomy Department of Chemical Engineering & Materials Science
More informationUniversity of Ottawa CSI 2101 Midterm Test Instructor: Lucia Moura. February 9, :30 pm Duration: 1:50 hs. Closed book, no calculators
University of Ottawa CSI 2101 Midterm Test Instructor: Lucia Moura February 9, 2010 11:30 pm Duration: 1:50 hs Closed book, no calculators Last name: First name: Student number: There are 5 questions and
More informationExercise Set 1 Solutions Math 2020 Due: January 30, Find the truth tables of each of the following compound statements.
1. Find the truth tables of each of the following compound statements. (a) ( (p q)) (p q), p q p q (p q) q p q ( (p q)) (p q) 0 0 0 1 1 1 1 0 1 0 1 0 0 0 1 0 0 1 1 1 1 1 1 1 0 0 1 0 (b) [p ( p q)] [( (p
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics. Introductory Notes in Discrete Mathematics Solution Guide
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics Introductory Notes in Discrete Mathematics Solution Guide Marcel B. Finan c All Rights Reserved 2015 Edition Contents
More information2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional Logic
CS 103 Discrete Structures Chapter 1 Propositional Logic Chapter 1.1 Propositional Logic 1 1.1 Propositional Logic Definition: A proposition :is a declarative sentence (that is, a sentence that declares
More informationMACM 101 Discrete Mathematics I. Exercises on Propositional Logic. Due: Tuesday, September 29th (at the beginning of the class)
MACM 101 Discrete Mathematics I Exercises on Propositional Logic. Due: Tuesday, September 29th (at the beginning of the class) SOLUTIONS 1. Construct a truth table for the following compound proposition:
More informationDISCRETE MATHEMATICS BA202
TOPIC 1 BASIC LOGIC This topic deals with propositional logic, logical connectives and truth tables and validity. Predicate logic, universal and existential quantification are discussed 1.1 PROPOSITION
More informationCSCE 222 Discrete Structures for Computing. Predicate Logic. Dr. Hyunyoung Lee. !!!!! Based on slides by Andreas Klappenecker
CSCE 222 Discrete Structures for Computing Predicate Logic Dr. Hyunyoung Lee Based on slides by Andreas Klappenecker 1 Predicates A function P from a set D to the set Prop of propositions is called a predicate.
More informationMath 3336: Discrete Mathematics Practice Problems for Exam I
Math 3336: Discrete Mathematics Practice Problems for Exam I The upcoming exam on Tuesday, February 26, will cover the material in Chapter 1 and Chapter 2*. You will be provided with a sheet containing
More informationKS MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) RULES OF INFERENCE. Discrete Math Team
KS091201 MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) RULES OF INFERENCE Discrete Math Team 2 -- KS091201 MD W-04 Outline Valid Arguments Modus Ponens Modus Tollens Addition and Simplification More Rules
More informationFirst order Logic ( Predicate Logic) and Methods of Proof
First order Logic ( Predicate Logic) and Methods of Proof 1 Outline Introduction Terminology: Propositional functions; arguments; arity; universe of discourse Quantifiers Definition; using, mixing, negating
More informationA Guide to Proof-Writing
A Guide to Proof-Writing 437 A Guide to Proof-Writing by Ron Morash, University of Michigan Dearborn Toward the end of Section 1.5, the text states that there is no algorithm for proving theorems.... Such
More informationDISCRETE MATH: LECTURE Chapter 3.3 Statements with Multiple Quantifiers If you want to establish the truth of a statement of the form
DISCRETE MATH: LECTURE 5 DR. DANIEL FREEMAN 1. Chapter 3.3 Statements with Multiple Quantifiers If you want to establish the truth of a statement of the form x D, y E such that P (x, y) your challenge
More informationReview 3. Andreas Klappenecker
Review 3 Andreas Klappenecker Final Exam Friday, May 4, 2012, starting at 12:30pm, usual classroom Topics Topic Reading Algorithms and their Complexity Chapter 3 Logic and Proofs Chapter 1 Logic and Proofs
More informationChapter 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 information5. 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 informationW3203 Discrete Mathema1cs. Logic and Proofs. Spring 2015 Instructor: Ilia Vovsha. hcp://www.cs.columbia.edu/~vovsha/w3203
W3203 Discrete Mathema1cs Logic and Proofs Spring 2015 Instructor: Ilia Vovsha hcp://www.cs.columbia.edu/~vovsha/w3203 1 Outline Proposi1onal Logic Operators Truth Tables Logical Equivalences Laws of Logic
More informationDo not start until you are given the green signal
SOLUTIONS CSE 311 Winter 2011: Midterm Exam (closed book, closed notes except for 1-page summary) Total: 100 points, 5 questions. Time: 50 minutes Instructions: 1. Write your name and student ID on the
More informationRules of Inference. Arguments and Validity
Arguments and Validity A formal argument in propositional logic is a sequence of propositions, starting with a premise or set of premises, and ending in a conclusion. We say that an argument is valid if
More informationInference 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 informationA. Propositional Logic
CmSc 175 Discrete Mathematics A. Propositional Logic 1. Statements (Propositions ): Statements are sentences that claim certain things. Can be either true or false, but not both. Propositional logic deals
More informationAssignment #2 COMP 3200 Spring 2012 Prof. Stucki
Assignment #2 COMP 3200 Spring 2012 Prof. Stucki 1) Construct deterministic finite automata accepting each of the following languages. In (a)-(c) the alphabet is = {0,1}. In (d)-(e) the alphabet is ASCII
More informationDiscrete Mathematics Logics and Proofs. Liangfeng Zhang School of Information Science and Technology ShanghaiTech University
Discrete Mathematics Logics and Proofs Liangfeng Zhang School of Information Science and Technology ShanghaiTech University Resolution Theorem: p q p r (q r) p q p r q r p q r p q p p r q r T T T T F T
More informationMATH 215 Discrete Mathematics Worksheets. Which of these are propositions? What are the truth values of those that are propositions?
Which of these are propositions? What are the truth values of those that are propositions? 1. Would you like some coffee? 2. I would like coffee with cream and sugar. 3. Either Mom or Dad will pick me
More informationBoolean Algebra and Proof. Notes. Proving Propositions. Propositional Equivalences. Notes. Notes. Notes. Notes. March 5, 2012
March 5, 2012 Webwork Homework. The handout on Logic is Chapter 4 from Mary Attenborough s book Mathematics for Electrical Engineering and Computing. Proving Propositions We combine basic propositions
More informationCSE 20 DISCRETE MATH. Winter
CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Today's learning goals Distinguish between a theorem, an axiom, lemma, a corollary, and a conjecture. Recognize direct proofs
More informationReview: Potential stumbling blocks
Review: Potential stumbling blocks Whether the negation sign is on the inside or the outside of a quantified statement makes a big difference! Example: Let T(x) x is tall. Consider the following: x T(x)
More informationCSCE 222 Discrete Structures for Computing. Review for the Final. Hyunyoung Lee
CSCE 222 Discrete Structures for Computing Review for the Final! Hyunyoung Lee! 1 Final Exam Section 501 (regular class time 8:00am) Friday, May 8, starting at 1:00pm in our classroom!! Section 502 (regular
More information1) Let h = John is healthy, w = John is wealthy and s = John is wise Write the following statement is symbolic form
Math 378 Exam 1 Spring 2009 Show all Work Name 1) Let h = John is healthy, w = John is wealthy and s = John is wise Write the following statement is symbolic form a) In order for John to be wealthy it
More informationArtificial Intelligence: Knowledge Representation and Reasoning Week 2 Assessment 1 - Answers
Artificial Intelligence: Knowledge Representation and Reasoning Week 2 Assessment 1 - Answers 1. When is an inference rule {a1, a2,.., an} c sound? (b) a. When ((a1 a2 an) c) is a tautology b. When ((a1
More informationPropositional Logic. Argument Forms. Ioan Despi. University of New England. July 19, 2013
Propositional Logic Argument Forms Ioan Despi despi@turing.une.edu.au University of New England July 19, 2013 Outline Ioan Despi Discrete Mathematics 2 of 1 Order of Precedence Ioan Despi Discrete Mathematics
More informationCSE 20 DISCRETE MATH. Fall
CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Distinguish between a theorem, an axiom, lemma, a corollary, and a conjecture. Recognize direct proofs
More informationFull file at
Transparencies to accompany Rosen, Discrete Mathematics and Its Applications Introduction Chapter 1 - Introduction Applications of discrete mathematics: Formal Languages (computer languages) Compiler Design
More informationThe following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof
Ch. 1.6 Introduction to Proofs The following techniques for methods of proofs are discussed in our text - Vacuous proof - Trivial proof - Direct proof - Indirect proof (our book calls this by contraposition)
More informationChapter 2: The Logic of Quantified Statements
Chapter 2: The Logic of Quantified Statements Topics include 2.1, 2.2 Predicates and Quantified Statements, 2.3 Statements with Multiple Quantifiers, and 2.4 Arguments with Quantified Statements. cs1231y
More informationThe Logic of Compound Statements cont.
The Logic of Compound Statements cont. CSE 215, Computer Science 1, Fall 2011 Stony Brook University http://www.cs.stonybrook.edu/~cse215 Refresh from last time: Logical Equivalences Commutativity of :
More informationMat2345 Week 2. Chap 1.5, 1.6. Fall Mat2345 Week 2. Chap 1.5, 1.6. Week2. Negation. 1.5 Inference. Modus Ponens. Modus Tollens. Rules.
Fall 2013 Student Responsibilities Reading: Textbook, Sections 1.5 1.6 Assignments: as given in the Homework Assignment list (handout) Secs. 1.5 & 1.6 Attendance: Dryly Encouraged Overview Finish up 1.1
More informationMAT 243 Test 1 SOLUTIONS, FORM A
t MAT 243 Test 1 SOLUTIONS, FORM A 1. [10 points] Rewrite the statement below in positive form (i.e., so that all negation symbols immediately precede a predicate). ( x IR)( y IR)((T (x, y) Q(x, y)) R(x,
More informationProofs. Example of an axiom in this system: Given two distinct points, there is exactly one line that contains them.
Proofs A mathematical system consists of axioms, definitions and undefined terms. An axiom is assumed true. Definitions are used to create new concepts in terms of existing ones. Undefined terms are only
More informationReview. Propositions, propositional operators, truth tables. Logical Equivalences. Tautologies & contradictions
Review Propositions, propositional operators, truth tables Logical Equivalences. Tautologies & contradictions Some common logical equivalences Predicates & quantifiers Some logical equivalences involving
More informationDISCRETE MATH: FINAL REVIEW
DISCRETE MATH: FINAL REVIEW DR. DANIEL FREEMAN 1) a. Does 3 = {3}? b. Is 3 {3}? c. Is 3 {3}? c. Is {3} {3}? c. Is {3} {3}? d. Does {3} = {3, 3, 3, 3}? e. Is {x Z x > 0} {x R x > 0}? 1. Chapter 1 review
More informationMath 55 Homework 2 solutions
Math 55 Homework solutions Section 1.3. 6. p q p q p q p q (p q) T T F F F T F T F F T T F T F T T F T F T F F T T T F T 8. a) Kwame will not take a job in industry and not go to graduate school. b) Yoshiko
More informationMidterm: Sample 3. ECS20 (Fall 2017) 1) Using truth tables, establish for each of the two propositions below if it is a tautology, a contradiction
Midterm: Sample 3 ECS20 (Fall 2017) Part I: logic 1) Using truth tables, establish for each of the two propositions below if it is a tautology, a contradiction or neither. 1) [p (q r)] [((r p) q) q] Let
More informationMath 230 Final Exam, Spring 2008
c IIT Dept. Applied Mathematics, May 15, 2008 1 PRINT Last name: Signature: First name: Student ID: Math 230 Final Exam, Spring 2008 Conditions. 2 hours. No book, notes, calculator, cell phones, etc. Part
More informationSection Summary. Section 1.5 9/9/2014
Section 1.5 Section Summary Nested Quantifiers Order of Quantifiers Translating from Nested Quantifiers into English Translating Mathematical Statements into Statements involving Nested Quantifiers Translated
More informationECOM Discrete Mathematics
ECOM 2311- Discrete Mathematics Chapter # 1 : The Foundations: Logic and Proofs Fall, 2013/2014 ECOM 2311- Discrete Mathematics - Ch.1 Dr. Musbah Shaat 1 / 85 Outline 1 Propositional Logic 2 Propositional
More informationCS0441 Discrete Structures Recitation 3. Xiang Xiao
CS0441 Discrete Structures Recitation 3 Xiang Xiao Section 1.5 Q10 Let F(x, y) be the statement x can fool y, where the domain consists of all people in the world. Use quantifiers to express each of these
More informationDiscrete Mathematics Exam File Spring Exam #1
Discrete Mathematics Exam File Spring 2008 Exam #1 1.) Consider the sequence a n = 2n + 3. a.) Write out the first five terms of the sequence. b.) Determine a recursive formula for the sequence. 2.) Consider
More informationPacket #1: Logic & Proofs. Applied Discrete Mathematics
Packet #1: Logic & Proofs Applied Discrete Mathematics Table of Contents Course Objectives Page 2 Propositional Calculus Information Pages 3-13 Course Objectives At the conclusion of this course, you should
More informationChapter 3. The Logic of Quantified Statements
Chapter 3. The Logic of Quantified Statements 3.1. Predicates and Quantified Statements I Predicate in grammar Predicate refers to the part of a sentence that gives information about the subject. Example:
More informationUNIVERSITY OF VICTORIA DECEMBER EXAMINATIONS MATH 122: Logic and Foundations
UNIVERSITY OF VICTORIA DECEMBER EXAMINATIONS 2013 MATH 122: Logic and Foundations Instructor and section (check one): K. Mynhardt [A01] CRN 12132 G. MacGillivray [A02] CRN 12133 NAME: V00#: Duration: 3
More informationMathematical Reasoning Rules of Inference & Mathematical Induction. 1. Assign propositional variables to the component propositional argument.
Mathematical Reasoning Rules of Inference & Mathematical Induction Example. If I take the day off it either rains or snows 2. When It rains, my basement floods 3. When the basement floods or it snows,
More informationASSIGNMENT 1 SOLUTIONS
MATH 271 ASSIGNMENT 1 SOLUTIONS 1. (a) Let S be the statement For all integers n, if n is even then 3n 11 is odd. Is S true? Give a proof or counterexample. (b) Write out the contrapositive of statement
More informationDiscrete Mathematical Structures: Theory and Applications
Chapter 1: Foundations: Sets, Logic, and Algorithms Discrete Mathematical Structures: Theory and Applications Learning Objectives Learn about sets Explore various operations on sets Become familiar with
More information1 The Foundation: Logic and Proofs
1 The Foundation: Logic and Proofs 1.1 Propositional Logic Propositions( 명제 ) a declarative sentence that is either true or false, but not both nor neither letters denoting propositions p, q, r, s, T:
More informationMath 10850, fall 2017, University of Notre Dame
Math 10850, fall 2017, University of Notre Dame Notes on first exam September 22, 2017 The key facts The first midterm will be on Thursday, September 28, 6.15pm-7.45pm in Hayes-Healy 127. What you need
More informationFoundations of Mathematics MATH 220 FALL 2017 Lecture Notes
Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements
More informationLecture Notes 1 Basic Concepts of Mathematics MATH 352
Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,
More information*EXAM 1 Answer key* EECS 203 Spring 2016
*EXAM 1 Answer key* EECS 203 Spring 2016 Name (Print): Key uniqname (Print): Key Instructions. You have 110 minutes to complete this exam. You may have one page of notes (8.5x11.5 two-sided) but may not
More informationCSE 1400 Applied Discrete Mathematics Proofs
CSE 1400 Applied Discrete Mathematics Proofs Department of Computer Sciences College of Engineering Florida Tech Fall 2011 Axioms 1 Logical Axioms 2 Models 2 Number Theory 3 Graph Theory 4 Set Theory 4
More informationRED. Name: Instructor: Pace Nielsen Math 290 Section 1: Winter 2014 Final Exam
RED Name: Instructor: Pace Nielsen Math 290 Section 1: Winter 2014 Final Exam Note that the first 10 questions are true-false. Mark A for true, B for false. Questions 11 through 20 are multiple choice
More informationCS 250/251 Discrete Structures I and II Section 005 Fall/Winter Professor York
CS 250/251 Discrete Structures I and II Section 005 Fall/Winter 2013-2014 Professor York Practice Quiz March 10, 2014 CALCULATORS ALLOWED, SHOW ALL YOUR WORK 1. Construct the power set of the set A = {1,2,3}
More informationsoftware design & management Gachon University Chulyun Kim
Gachon University Chulyun Kim 2 Outline Propositional Logic Propositional Equivalences Predicates and Quantifiers Nested Quantifiers Rules of Inference Introduction to Proofs 3 1.1 Propositional Logic
More information1 The Foundation: Logic and Proofs
1 The Foundation: Logic and Proofs 1.1 Propositional Logic Propositions( ) a declarative sentence that is either true or false, but not both nor neither letters denoting propostions p, q, r, s, T: true
More information