Check all the statements that are true: a. A predicate is a proposition-valued function.
b. It is possible to define disjunction using only negations and conjunction.
c. A conditional is false when both premise and conclusion are false.
d. Domain-restricted universal quantification is logically equivalent to the unrestricted universal quantification of a conditional.
e. The negation of a conjunction is the disjunction of the negations.
f. Inverse and converse are logically equivalent.
g. (p→q)∧(p→¬q) is a contradiction.
h. (p→q)∨(p→¬q) is a tautology.
i. Domain-restricted existential quantification is logically equivalent to the unrestricted existential quantification of a conditional.
j. The contrapositive is the inverse of the converse.