Hi
Can you please help me with this problem?
"What is the maximum size of a set A of logical expressions that only use →, p, q : each pair of elements of A are not equivalent?"
I've found 6 different possible truth values. Is this the maximum size? If yes, how do I prove it?
Thanks!
0 commentaires:
Enregistrer un commentaire