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 does it mean for a set of operators to be functionally complete?
Think about combining basic logical statements.
Convert the implication 'p → q' using logical operators.
One operator should represent FALSE.
What are the main logical operators in a functionally complete set?
Recall the operators discussed.
T or F: A tautology is a proposition that is always false.
Think about the definition of tautology.
Using the premises 'p → q', 'q → r', and '¬p', show whether the conclusion '¬r' is valid using resolution.
Start with negating the conclusion!
You are given a chain of implications, can you derive a numeric example using resolution that leads to either a tautology or contradiction?
Think about testing minimal values to break the chain.
7 more questions in this section. Enroll free to practise them all.
Enroll free