stiff vault
I'm a little confused on how to deal with quantifiers while making proof trees. For problems without quantifiers I'm 100% good (things like A => B = 0 the result should be (A,B) = (1,0) ). I need help with problems like shown in the picture below. This is from my most recent exam and I just made up bull crap because u had no idea what to do (still don't).
stiff vault
Original problem
stiff vault
Translated "prove that the following predicate equation is true in all cases. If not true in all cases, find an interpretation with the main set M ={a,b} where this equation evaluates to false and explain your interpretation's fitness."
rugged scroll