Question: Which WFF is NOT a sub-formula in this parse tree? A. q B. ((rq)(ps)) C. (r(sp)) D. (rq) Which valuation satisfies the formula represented by



Which WFF is NOT a sub-formula in this parse tree? A. q B. ((rq)(ps)) C. (r(sp)) D. (rq) Which valuation satisfies the formula represented by this parse tree? A. (p)=(q)=(r)=(s)=F B. (p)=(q)=(r)=(s)=T C. (p)=(r)=T,(q)=(s)=F D. (p)=T,(r)=(q)=(s)=F Which valuation corresponds to the truth assignments in the parse tree? A. (p)=T,(q)=F B. (p)=F,(q)=T C. (p)=(q)=F D. (p)=(q)=T
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
