Search the courses, subjects, tracks, games and features, or jump straight to a page.
3 cards from this section. Quick, good the night before a test.
What is the equivalent of 'p → q'?
Think about how you can express implication using disjunction.
How do you express 'p ∧ q' using only negation and disjunction?
Consider De Morgan's laws.
What is the equivalent of p → q?
Remember how you transformed implications.
True or False: {AND, OR, NOT} together form a functionally complete set.
Think about examples you’ve seen.
Show how to express (p ∧ q) using only disjunction and negation.
Use De Morgan's laws to navigate through.
Determine if {NOT, OR} is functionally complete and provide proof.
Consider the relationships between the operations you've learned.
6 more questions in this section. Enroll free to practise them all.
Enroll free