Discrete Mathematics

123456789101112131415
Across
  1. 3. A relation R on a set A is ….. if whenever aRb then bRa, that is, if whenever (a, b) ∈ R then (b, a) ∈ R.
  2. 7. If p is ....., then ¬p is true.
  3. 8. The ….. statement p <-> q is the proposition "p if and only if q”.
  4. 9. Such a set with no elements is called the ….. set or null set and is denoted by ∅.
  5. 11. A compound proposition that is neither a tautology nor a contradiction is called a …..
  6. 13. An ….. is a sequence of statements of which one is intended as a conclusion and the others,the premises,are intended to prove or at least provide some evidence for the conclusion.
  7. 14. ….. is a declarative statement which is true or false, but not both.
  8. 15. Any two propositions can be combined by the word “or” to form a compound proposition called the ........ of the original propositions.
Down
  1. 1. Two sets A and B are said to be ….. if they have no elements in common.
  2. 2. A conditional statement is also called an …..
  3. 4. Q = the set of ….. numbers.
  4. 5. A compound proposition that is always true, no matter what the truth values of the propositions that occur in it, is called a …..
  5. 6. The intersection of two sets A and B, denoted by A ∩ B, is the set of elements which belong to both A and B.
  6. 10. If p and q are true, then p ∧ q is .....
  7. 12. A relation R on a set A is ….. if whenever aRb and bRc then aRc, that is, if whenever (a, b), (b, c) ∈ R then (a,c) ∈ R.