The truth value of a logical expression is defined recursively as: . The truth v

Question

The truth value of a logical expression is defined recursively as: . The truth value of t is t . The truth value of f is f . The truth value of (r1 A a2) is t if both and r2 have truth value t, is f otherwise. . The truth value of (i V 2) is f if both r and x2 have truth value f, it is t otherwise . The truth value of-(x) is f if has truth value 1, it is 1 otherwise. Define a CPG that generates the following language over {MAV(.), =): = {w=x : w is a logical expression over (,/), x E {i,f), andis the truth value of w} Thus, "t-t" , "((tAf)Vf) = f", and "-(((tAf)Vf)) = t" are in L , but "(UAf)Vf) = t'. and "(Af) v f = f" are not: the former because ((1 ^/)VJ) is false and not true, the latter because the expression lacks the outermost set of parentheses

Explanation / Answer

exp-> exp ^ exp

exp-> exp v exp

exp-> 'exp (' represents complement since I am unable to dont have that button for not)

exp-> (exp)

exp-> val

val->t | f

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.