Let P(x) be the statement "x is a clear explanation," ????(x) be the statement "x is satisfactory," ????(x) be the statement "x
is an excuse." Let the domain for x consists of all English written text. Express each of the statements below using quantifiers, the predicates P(x), ????(x), ???????????? ????(x) and logical connectives, including negations if needed. a. Some clear explanations are excuses. b. There are no satisfactory excuses. [Note this is equivalent to: All excuses are not satisfactory.]
Sample Response: Since the statement is true, there are an infinite number of solutions to the system. This statement also indicates that the lines are equivalent.