II. Truth Tables and Symbolization 2. Use a truth table to determine and indicate whether the following sentences are truth-functionally equivalent. (12 points) (C v D)>~D ~(C=(~D>-C)) 3. Use a truth table to determine and indicate whether the following set of sentences is truth-functionally consistent. (12 points) {( JK)=L, ~(K&L), (K & ~J) v L } 4. Symbolize the following argument using SL and the symbolization key provided. Put it in standard form (i.e., identify clearly the premises and the conclusion). Prove and indicate its truth-functional validity (or invalidity) by using a truth table. (14 points) DeMorgan is the murderer, Holmes declared. I know this because of the following clues. Firstly, Boole is guilty only if Russell is not. Secondly, neither Boole nor Russell is guilty if De Morgan is guilty. And finally, DeMorgan being guilty is a necessary condition for Russell not being guilty." [B: Boole is guilty; D: De Morgan is guilty; R: Russell is guilty] II. Truth Tables and Symbolization 2. Use a truth table to determine and indicate whether the following sentences are truth-functionally equivalent. (12 points) (C v D)>~D ~(C=(~D>-C)) 3. Use a truth table to determine and indicate whether the following set of sentences is truth-functionally consistent. (12 points) {( JK)=L, ~(K&L), (K & ~J) v L } 4. Symbolize the following argument using SL and the symbolization key provided. Put it in standard form (i.e., identify clearly the premises and the conclusion). Prove and indicate its truth-functional validity (or invalidity) by using a truth table. (14 points) DeMorgan is the murderer, Holmes declared. I know this because of the following clues. Firstly, Boole is guilty only if Russell is not. Secondly, neither Boole nor Russell is guilty if De Morgan is guilty. And finally, DeMorgan being guilty is a necessary condition for Russell not being guilty." [B: Boole is guilty; D: De Morgan is guilty; R: Russell is guilty]