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.
Define a satisfiable proposition.
Think about conditions under which a proposition can be true.
What is a clause?
Consider how literals group together.
Can a proposition be satisfiable if it is always false?
Remember the definition of unsatisfiable propositions.
What is CNF?
Think about how logical expressions are structured.
Given the logical expression (p OR q) AND (¬r OR s), show how to convert it into CNF.
Check for disjunctions within conjunctions.
Create a satisfiable and an unsatisfiable proposition and explain why they fit the definitions.
Remember the definitions and look for conflicts.
4 more questions in this section. Enroll free to practise them all.
Enroll free