I have problem with my code. I need to check tautology using recursion. Please give me some hint. I know how recursion works. But I do not have clue how to apply in tautology. this is my arbitrary. ((p | q) & !(p & q)) == (p | q); I want to check it. PLease help me!
↧