provide proofderivation for symbolic logic Zx T WPvX WvQS Z

provide proof/derivation for symbolic logic

(Z&x) -> T, ~(W->(PvX)), (WvQ)->S, ZvP, therefore: S&T

Solution

1) (Z&x) -> T:

NOTE:   Assume 0=false(F) and 1=true(T).

             0 -> ? =0 (i.e. ?(0/1) no matters if the symbol before implication is 0).

             1 -> 0 =0   and   1 ->1 =0.

2) ~(W->(PvX)):

3) (WvQ)->S):

4)   ZvP :

Therefore, S&T will be calculated from the values of S andT in the above symbolic logic tabes.