
Page 1 of 2
Download, free
The full Discrete Mathematics and Proof courseEvery lesson in teaching order, with over 470 printables.See the course ›What's on the worksheet
- Write the negation of each sentence as a plain sentence.
- Rewrite each statement so that every sits on a single letter, simplifying any double negation.
- The condition -3 < x ≤ 5 means "x > -3 and x ≤ 5".
- A website turns down a new account when the username is already taken, or the password is shorter than 8 characters, or the email address is already…
- Use a truth table (letters P, Q, R in the fixed order) to decide whether the statements in each pair are logically equivalent.
- A statement uses only the connectives and , and every in it sits on a single letter.
Teach it first
The free lesson teaches it with worked examples and practice problems.
De Morgan's laws for statements: the lesson ›More Chapter 1 worksheets: Statements, truth tables and logical equivalence
- 1.1And and or: conjunction and disjunction
- 1.2Building a truth table for a compound statement
- 1.3Truth table for the conditional
- 1.4Tautologies and contradictions
- 1.5De Morgan's laws for statements
- 1.6A conditional and its contrapositive
- 1.7Saying a conditional without if-then
- 1.8Exclusive or and logic circuits