Answer Happy

Use a truth-tree to determine whether the following set of sentences is quantification- ally consistent. If it is consistent, specify the relevant part of an interpretation that makes all the literals on one completed open branch true. {(D=-G)&G, [G v(( AD)& A)]>-D, G-D}