course MTH 151 ?L?o?x??????????assignment #015
......!!!!!!!!...................................
14:26:12 `q001. There are 6 questions in this set. The proposition p -> q is true unless p is true and q is false. Construct the truth table for this proposition.
......!!!!!!!!...................................
RESPONSE --> p,q,p->q t,t,t t,f,f f,t,t f,f,t confidence assessment: 2
.................................................
......!!!!!!!!...................................
14:27:42 The proposition will be true in every case except the one where p is true and q is false, which is the TF case. The truth table therefore reads as follows: p q p -> q T T T T F F F T T F F T
......!!!!!!!!...................................
RESPONSE --> will be true except where p is true and q is false. self critique assessment: 2
.................................................
......!!!!!!!!...................................
14:31:10 `q002. Reason out, then construct a truth table for the proposition ~p -> q.
......!!!!!!!!...................................
RESPONSE --> p,q,~p,~p->q t,t,f,t t,f,f,t f,t,t,t f,f,t,f confidence assessment: 2
.................................................
......!!!!!!!!...................................
14:32:52 This proposition will be false in the T -> F case where ~p is true and q is false. Since ~p is true, p must be false so this must be the FT case. The truth table will contain lines for p, q, ~p and ~p -> q. We therefore get p q ~p ~p -> q T T F T since (F -> T) is T T F F T since (F -> F) is T F T F T since (T -> T) is T F F T T since (T -> F) is F
......!!!!!!!!...................................
RESPONSE --> F -> T IS T F -> F IS T T -> T IS T T -> F IS F self critique assessment: 2
.................................................
......!!!!!!!!...................................
14:38:48 `q003. Reason out the truth value of the proposition (p ^ ~q) U (~p -> ~q ) in the case FT (i.e., p false, q true).
......!!!!!!!!...................................
RESPONSE --> (F^F) V (T->F) FVF F confidence assessment: 2
.................................................
......!!!!!!!!...................................
14:40:29 To evaluate the expression we must first evaluate p ^ ~q and ~p -> ~q. p ^ ~q is evaluated by first determining the values of p and ~q. If p is false and q true, then ~q is false. Thus both p and ~q are false, and p ^ ~q is false. ~p -> ~q will be false if ~p is true and ~q is false; otherwise it will be true. In the FT case p is false to ~p is true, and q is true so ~q is false. Thus it is indeed the case the ~p -> ~q is false. (p ^ ~q) U (~p -> ~q ) will be false if (p ^ ~q) and (~p -> ~q ) are both false, and will otherwise be true. In the case of the FT truth values we have seen that both (p ^ ~q) and (~p -> ~q ) are false, so that (p ^ ~q) U (~p -> ~q ) is false.
......!!!!!!!!...................................
RESPONSE --> ~p -> ~q will be false if ~p is true and ~q is false; otherwise it will be true. self critique assessment: 2
.................................................
......!!!!!!!!...................................
14:46:57 `q004. Construct a truth table for the proposition (p ^ ~q) U (~p -> ~q ).
......!!!!!!!!...................................
RESPONSE --> p,q,~p,~q,(p^~q),~p->~q,(p^~q)V(~p->~q) t,t,f,f,f,t,t t,f,f,t,t,t,t f,t,t,f,f,f,f f,f,t,t,f,t,t confidence assessment: 2
.................................................
......!!!!!!!!...................................
14:47:50 We will need headings for p, q, ~p, ~q, (p ^ ~q), (~p -> ~q ) and (p ^ ~q) U (~p -> ~q ). So we set up our truth table p q ~p ~q (p ^ ~q) (~p -> ~q ) (p ^ ~q) U (~p -> ~q ) T T F F F T T T F F T F T T F T T F F F F F F T T F T T To see the first line, where p and q are both T, we first see that ~p and ~q must both be false. (p ^ ~q) will therefore be false, since ~q is false; (~p -> ~q) is of the form F -> F and is therefore true. Since (~p -> ~q) is true, (p ^ ~q) U (~p -> ~q ) must be true. To see the second line, where p is T and q is F, we for see that ~p will be F and ~q true. (p ^ ~q) will therefore be true, since both p and ~q are true; (~p -> ~q) is of the form F -> T and is therefore true. Since (p ^ ~q) and (~p -> ~q ) are both true, (p ^ ~q) U (~p -> ~q ) is certainly true. To see the fourth line, where p is F and q is F, we for see that ~p will be T and ~q true. (p ^ ~q) will be false, since p is false; (~p -> ~q) is of the form T -> T and is therefore true. Since (~p -> ~q ) is true, (p ^ ~q) U (~p -> ~q ) is true.
......!!!!!!!!...................................
RESPONSE --> to see the first line, where p and q are both T, we first see that ~p and ~q must both be false. self critique assessment: 2
.................................................
......!!!!!!!!...................................
14:51:42 `q005. If we have a compound sentence consisting of three statements, e.g., p, q and r, then what possible combinations of truth values can occur?
......!!!!!!!!...................................
RESPONSE --> p,q,r t,t,t t,t,f t,f,t t,f,f f,t,t f,t,f f,f,t f,f,f confidence assessment: 2
.................................................
......!!!!!!!!...................................
14:52:36 A compound statement with two statements p and q has four possible combinations of truth values: TT, TF, FT, FF. Here we also have r, which can be either T or F. So we can append either T or F to each of the possible combinations for p and q. If r is true then we have possible combinations TT T, TF T, FT T, FF T. If r is false we have TT F, TF F, FT F, FF F. This gives us 8 possible combinations: TTT, TFT, FTT, FFT, TTF, TFF, FTF, FFF.
......!!!!!!!!...................................
RESPONSE --> A compound statement with two statements p and q has four possible combinations of truth values. self critique assessment: 2
.................................................
......!!!!!!!!...................................
14:58:06 `q006. Evaluate the TFT, FFT and FTF lines of the truth table for (p ^ ~q) -> r.
......!!!!!!!!...................................
RESPONSE --> p,q,r,~p,p^~q,(p^~q)->r t,t,t,f,f,t t,t,f,f,f,t t,f,t,t,t,t t,f,f,t,t,f f,t,t,f,f,t f,t,f,f,f,t f,f,t,t,f,t f,f,f,t,f,t confidence assessment: 2
.................................................
......!!!!!!!!...................................
14:59:07 We would need column headings p, q, r, ~q, (p^~q) and (p^~q) -> r. The truth table would then read
......!!!!!!!!...................................
RESPONSE --> we would need column headings p,q,r,~p,(p^~q) and (p^~q->r. self critique assessment: 2
.................................................
......!!!!!!!!...................................
14:59:38 p q r ~q (p^~q) (p^~q) -> r T F T T T T F F T T F T F T F F F T
......!!!!!!!!...................................
RESPONSE --> TFTTTT FFTTFT FTFFFT self critique assessment: 2
.................................................
??…??X??L????€? assignment #016 016. Translating Arguments Liberal Arts Mathematics I 10-16-2008
......!!!!!!!!...................................
15:03:56 This argument certainly seems valid. We say what will happen if rains, and what will happen is that happens. Then we say that it rains, so the whole chain of happenings, rained then wet grass then smell, should follow.
......!!!!!!!!...................................
RESPONSE --> Yes the argument is valid self critique assessment: 2
.................................................
......!!!!!!!!...................................
15:04:30 `q002. Is the following argument valid: 'If it snows, the roads will be slippery. If the roads are slippery they'll be safer to drive on. Yesterday it snowed. Therefore yesterday the roads were safer to drive on.'
......!!!!!!!!...................................
RESPONSE --> this statement is not valid confidence assessment: 2
.................................................
......!!!!!!!!...................................
15:05:16 The validity of an argument has nothing to do with whether the statements in that argument are true or not. All we are allowed to do is assume that the statements are indeed true, and see if the conclusions of the argument therefore hold. In this case, we might well question the statement 'if the roads are slippery they'll be safer to drive on', which certainly seems untrue. However that has nothing to do with the validity of the argument itself. We can later choose to reject the conclusion because it is based on a faulty assumption, but we cannot say that the argument is invalid because of a faulty assumption. This argument tells us that something will happen if it snows, and then tells us what we can conclude from that. It then tells us that it snows, and everything follows logically along a transitive chain, starting from from the first thing.
......!!!!!!!!...................................
RESPONSE --> so the argument is valid self critique assessment: 2
.................................................
......!!!!!!!!...................................
15:05:47 `q003. Is the following argument valid: 'Today it will rain or it will snow. Today it didn't rain. Therefore today it snowed.'
......!!!!!!!!...................................
RESPONSE --> the argument is valid confidence assessment: 2
.................................................
......!!!!!!!!...................................
15:06:24 If we accept the fact that it will do one thing or another, then at least one of those things must happen. If it is known that if one of those things fails to happen, then, the other must. Therefore this argument is valid.
......!!!!!!!!...................................
RESPONSE --> this argument is valid self critique assessment: 2
.................................................
......!!!!!!!!...................................
15:06:51 `q004. Is the following argument valid: 'If it doesn't rain we'll have a picnic. We don't have a picnic. Therefore it rained.'
......!!!!!!!!...................................
RESPONSE --> this argument is valid confidence assessment: 2
.................................................
......!!!!!!!!...................................
15:07:20 In this argument where told the something must happen as a result of a certain condition. That thing is not happen, so the condition cannot have been satisfied. The condition was that it doesn't rain; since this condition cannot have been satisfied that it must have rained. The argument is valid.
......!!!!!!!!...................................
RESPONSE --> the argument is valid self critique assessment: 2
.................................................
......!!!!!!!!...................................
15:13:16 `q005. We can symbolize the following argument: 'If it rains, the grass gets wet. If the grass gets wet, we'll be able to smell the wet grass. It rained yesterday. Therefore yesterday we were able to smell the wet grass.' Let p stand for 'It rains', q for 'the grass gets wet' and r for 'we can smell the wet grass'. Then the first sentence forms a compound statement which we symbolize as p -> q. Symbolize the remaining statements in the argument.
......!!!!!!!!...................................
RESPONSE --> (p->q) (q->r) (p->r) confidence assessment: 2
.................................................
......!!!!!!!!...................................
15:14:38 The argument gives three conditions, 'If it rains, the grass gets wet. If the grass gets wet, we'll be able to smell the wet grass. It rained yesterday.', which are symbolized p -> q, q -> r and p. It says that under these three conditions, the statement r, 'we can smell the wet grass', must be true. Therefore the argument can be symbolized by the complex statement [ (p -> q) ^ (q -> r) ^ p] -> r.
......!!!!!!!!...................................
RESPONSE --> symbolize in a complex statement self critique assessment: 2
.................................................
......!!!!!!!!...................................
15:24:54 `q006. The preceding argument was symbolized as [ (p -> q) ^ (q -> r) ^ p] -> r. Determine whether this statement is true for p, q, r truth values F F T.
......!!!!!!!!...................................
RESPONSE --> p,q,r,(p->q),(q->r),(q->r)^p,(p->q)^(q->r)^p,(p->q)^(q->r)^p->r TTTTTTTT TTFFFFFT TFTTTTTT TFFFTTFT FTTTTFFF FTFTFFFT FFTTTFFF FFFTTFFT confidence assessment: 2
.................................................
......!!!!!!!!...................................
15:26:06 For these truth values p -> q is true since p is false (recall that the only way p -> q can be false is for p to be true and q to be false), q -> r is false since q is false, and p itself is false, therefore [ (p -> q) ^ (q -> r) ^ p] is false. This makes [ (p -> q) ^ (q -> r) ^ p] -> r true, since the statement can only be false if [ (p -> q) ^ (q -> r) ^ p] is true while r is false.
......!!!!!!!!...................................
RESPONSE --> the only way p->q can be false is for p to be true and q to be false. self critique assessment: 2
.................................................