course Mth 151 zQykHxԒassignment #014
......!!!!!!!!...................................
19:59:33 3.3.6 rewrite using if then ' all marines love boot camp '.
......!!!!!!!!...................................
RESPONSE --> If someone is a marine, then he/she loves boot camp. confidence assessment: 3
.................................................
......!!!!!!!!...................................
19:59:44 ** The statement is equivalent to 'If it's a Marine, it loves boot camp' or equivalent. The statement is not equivalent to 'if it is boot camp, then all Marines love it', which is the converse of the original statement. **
......!!!!!!!!...................................
RESPONSE --> OK self critique assessment: 3
.................................................
......!!!!!!!!...................................
20:00:53 3.3.18 ~p false q false p -> q true
......!!!!!!!!...................................
RESPONSE --> False; the antecedent is true and the consquent is false, so the conditional statement is false confidence assessment: 3
.................................................
......!!!!!!!!...................................
20:01:07 ** Since ~p is false then p is true. Since q is false it follows that p -> q is of the form T -> F, which is false. The conditional is false when, and only when, the antecedent is true and the consequent false. **
......!!!!!!!!...................................
RESPONSE --> OK self critique assessment: 3
.................................................
......!!!!!!!!...................................
20:01:48 Query 3.3.36 write in symbols 'If play canceled, then it does not rain.'
......!!!!!!!!...................................
RESPONSE --> p -> ~r confidence assessment: 3
.................................................
......!!!!!!!!...................................
20:02:03 ** If p stands for 'play canceled' and r for 'it rains' then the statement would be p -> ~q. **
......!!!!!!!!...................................
RESPONSE --> OK self critique assessment: 3
.................................................
......!!!!!!!!...................................
20:03:46 Query 3.3.48 q true, p and r false, evaluate and (-r U p) -> p
......!!!!!!!!...................................
RESPONSE --> False; the antecedent is ~r (true) or p (false) and the consequent is false. Since the antecedent can be true, and the consequent is false, then the statement is false. confidence assessment: 3
.................................................
......!!!!!!!!...................................
20:03:55 ** The antecedent (~r U p ) would be true, since ~r true and p false. The consequent p would be false. Since the antecedent is true and the consequent false, the conditional is false. **
......!!!!!!!!...................................
RESPONSE --> OK self critique assessment: 3
.................................................
......!!!!!!!!...................................
20:04:19 Query 3.3.60 truth table for (p ^ q) -> (p U q)
......!!!!!!!!...................................
RESPONSE --> This is always true. confidence assessment: 3
.................................................
......!!!!!!!!...................................
20:04:40 ** The headings would be p, q ,(p^q), (pUq), (p^q)->(pUq) Row 1 would read T T T T T Row 2 would read T F F T T Row 3 would read F T F T T Row 4 would read F F F F T The common sense of this is that whenever both p and q are true, then the statement 'p or q' must be true. That's what means to say (p ^ q) -> (p U q). The fact that this statement is true is indicated by the last column of the truth table, which has True in every possible case. **
......!!!!!!!!...................................
RESPONSE --> OK self critique assessment: 3
.................................................
......!!!!!!!!...................................
20:05:03 Query 3.3.72 negation of ' if loving is wrong then I don't want to be right'
......!!!!!!!!...................................
RESPONSE --> Loving is wrong and I want to be right. confidence assessment: 3
.................................................
......!!!!!!!!...................................
20:05:14 ** The negation has to have the exact opposite truth values of the original statement. It is difficult and confusing to try to negate a conditional. It is much easier to translate the conditional to a disjunction then negate the disjunction. It is easy to negate the disjunction using deMorgan's Laws. Since p -> q is identical to ~p U q, the negation of p -> q is ~ ( ~p U q), which by de Morgan's Law is ~ ~p ^ ~q, or just p ^ ~q. So the negation would ge 'loving you is wrong AND I want to be right. COMMON ERROR AND NOTE: If loving you is wrong, then I want to be right. INSTRUCTOR COMMENT: The negation of a conditional can't be a conditional (a conditional is false in only one case so its negation would have to be false in three cases). **
......!!!!!!!!...................................
RESPONSE --> OK self critique assessment: 3
.................................................
......!!!!!!!!...................................
20:06:21 Query 3.3.90 circuit q parallel [ p in series with ( q par. ~p) ].
......!!!!!!!!...................................
RESPONSE --> q U (p^q) U (p^~p) confidence assessment: 2
.................................................
......!!!!!!!!...................................
20:07:35 ** If I'm looking at the same circuit you are the translation would be q U [ p ^ [q U ~p ]] . Since intersection and union each distribute over the other, this would simplify to q U [ ( p ^ q) U ( p ^ ~p) ]. Since p ^ ~p can't be true, this is the same as q U ( p ^ q). Since q U ( p ^ q) is true whenever q is true and false whenever q is false expression is true exactly when q is. So the circuit finally simplifies to just q. You should be able to see by looking at the circuit that current will flow whenever all the q switches are closed. **
......!!!!!!!!...................................
RESPONSE --> I had trouble simplifying this problem, but I think I understand it better now. self critique assessment: 2
.................................................
"