Search the courses, subjects, tracks, games and features, or jump straight to a page.
2 cards from this section. Quick, good the night before a test.
What does it mean for a set of logical operators to be functionally complete?
Think about how implications can be rewritten.
Give an example of a logical identity.
Consider basic logical operations.
Which of the following sets of operators is functionally complete?
Think about binary logic and operations.
If a compound proposition is satisfiable, it means?
Consider what satisfiability entails.
Demonstrate the functional completeness of the set {OR, NOT}. Show how to construct conjunction from these.
Use De Morgan’s laws.
Using resolution refutation, prove that the premises {p, q} entail the conclusion ¬r.
Show steps leading to empty resolvent.
3 more questions in this section. Enroll free to practise them all.
Enroll free