Use symbols to write the logical form of the following arguments. If valid, iden- tify the rule of inference that guarantees its validity. Otherwise,

Let P be the statement where P: Studying hard for discrete math final Let Q be the statement, where Q: Getting A in discrete math final Definition: "If A is true then B is true." The logical form of this statement is: $A\to B$ The given statement is: "If you study hard for your discrete math final you will get A" Note that P: Studying hard for discrete math final and Q: Getting A in discrete math final. The logical form of the given statement is: $P\to Q$ The given statements is: "Jane got an A on her discrete math final, therefore Jane must have studied hard." "Jane got an A on her discrete math final." Hence the statement Q is true for Jane. This statement implies that "Jane must have studied hard." Hence P is true. If Q is true then P is true. The logical form of the statement is: $Q\to P$ From the first statement, $P\to Q$ From the second and third statements, $Q\to P$ which is not always true. For example, If the fruit is banana then it is yellow in color, if the fruit is yellow in color one can not assure whether the fruit is a banana. Hence, converse or inverse error has been made.