course Mth 151 sorry that this is after twelve C??????d?€}P?v????assignment #001
......!!!!!!!!...................................
22:18:09 `q001. Part 1 includes six activities. If you have completed an activity, just enter the answer 'completed'. This question is appearing in the Question box. The box to the right is the Answer box, where you will type in your answers to the questions posed here. To use this program you read a question, then enter your answer in the Answer box and click on Enter Answer. In your answers give what is requested, but don't go into excruciating detail. Try to give just enough that the instructor can tell that you understand an item. After entering an answer click on Next Question/Answer above the Question box. Do you understand these instructions?
......!!!!!!!!...................................
RESPONSE --> k
.................................................
......!!!!!!!!...................................
22:18:23 This program has created the folder c:\vhmthphy on your hard drive. Browse to that folder and locate the file whose name begins with SEND. The name of this file will also include your name, as you gave it to the program, and the file will show as a Text file. Never tamper with a SEND file in any way. It contains internal codes as if these codes are tampered with you won't get credit for the assignment. However you are welcome to copy this file to another location and view it, make changes, etc. Just be sure that when requested to do so you send the instructor the original, tamper-free file. State in the Answer box whether or not you have been able to locate the SEND file. Don't send the SEND file yet. Note that more questions/instructions remain in the q_a_prelim.
......!!!!!!!!...................................
RESPONSE --> yes
.................................................
......!!!!!!!!...................................
22:18:48 `q002. Note that every time you click on Enter Answer the program writes your response to your SEND file. Even if the program disappears all the information you have entered with the Enter Answer button will remain in that file. This program never 'unwrites' anything. Even if this program crashes your information will still be there in the SEND file. Explain this in your own words.
......!!!!!!!!...................................
RESPONSE --> Note that every time you click on Enter Answer the program writes your response to your SEND file. Even if the program disappears all the information you have entered with the Enter Answer button will remain in that file. This program never 'unwrites' anything. Even if this program crashes your information will still be there in the SEND file.
.................................................
......!!!!!!!!...................................
22:19:04 Any time you do not receive a reply from the instructor by the end of the following day, you should resubmit your work using the Resubmit Form at http://www.vhcc.edu/dsmith/genInfo/. You have already seen that page, but take another look at that page and be sure you see the Submit Work form, the Resubmit Form and a number of other forms that will be explained later. Enter a sentence or two describing the related links you see at that location.
......!!!!!!!!...................................
RESPONSE --> absolutely nothing
.................................................
......!!!!!!!!...................................
22:19:24 `q003. If you are working on a VHCC computer, it is probably set up in such a way as to return to its original configuration when it is rebooted. To avoid losing information it is suggested that you back up your work frequently, either by emailing yourself a copy or by using a key drive or other device. This is a good idea on any computer. Please indicate your understanding of this suggestion.
......!!!!!!!!...................................
RESPONSE --> If you are working on a VHCC computer, it is probably set up in such a way as to return to its original configuration when it is rebooted. To avoid losing information it is suggested that you back up your work frequently, either by emailing yourself a copy or by using a key drive or other device. This is a good idea on any computer.
.................................................
......!!!!!!!!...................................
22:19:37 Once more, locate the SEND file in your c:\vhmthphy folder, and open the file. Copy its contents to the clipboard (this is a common operation, but in case you don't know how, just use CTRL-A to highlight the contents of the file and CTRL-C to copy the contents to the clipboard). Then return to the form that instructed you to run this program, and paste the contents into the indicated box (just right-click in the box and select Paste). You may now click on the Quit button, or simply close the program.
......!!!!!!!!...................................
RESPONSE --> k
.................................................
????E??x?????Student Name: assignment #014
.................................................
??????L???|?????? Student Name: assignment #015
.................................................
......!!!!!!!!...................................
22:30:10 `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 TT T TF F FT T FF T
.................................................
......!!!!!!!!...................................
22:30:27 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 --> K
.................................................
......!!!!!!!!...................................
22:40:09 `q002. Reason out, then construct a truth table for the proposition ~p -> q.
......!!!!!!!!...................................
RESPONSE --> well, i know in work form that the proposition stands for negation of if 'p' then 'q '. p q ~p ~p->q TT F F TF F T FT T F FF T F
.................................................
......!!!!!!!!...................................
22:45:41 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 --> ok, i'm not sure that i understand this one
.................................................
......!!!!!!!!...................................
22:56:33 `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 --> well, in the case that is asking (p and the negation of q) ""or"" (the contrapositive, negation of if p (and) the negation of then q) ""or"" (U) should make it to where the proposition is false only when if both p and q are false.
.................................................
......!!!!!!!!...................................
22:58:42 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 --> i'm not understanding this at all, i understand what the problem is saying but i'm not sure how to get the final result. i can't read the problem fine but can't finish
.................................................
......!!!!!!!!...................................
23:10:12 `q004. Construct a truth table for the proposition (p ^ ~q) U (~p -> ~q ).
......!!!!!!!!...................................
RESPONSE --> p q ~p ~q (p^~q) (~p-> ~q) (p^~q) U (~p->~q) TT F F F T T TF F T F F F FT T F T T T FF T T T T T
.................................................
......!!!!!!!!...................................
23:11:43 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 T 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 --> i almost had it right but i'm still not getting this.
.................................................
......!!!!!!!!...................................
23:13:12 `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 --> TTT, TFT TFF, FTT, FFT, FFF, TTF
.................................................
......!!!!!!!!...................................
23:13:48 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 --> i forgot the FFT
.................................................
......!!!!!!!!...................................
23:21:24 `q006. Evaluate the TFT, FFT and FTF lines of the truth table for (p ^ ~q) -> r.
......!!!!!!!!...................................
RESPONSE --> p q r ~q (p^~q) (p^~q)-> r TFT T T T FFT T F F FTF F T T
.................................................
......!!!!!!!!...................................
23:21:43 We would need column headings p, q, r, ~q, (p^~q) and (p^~q) -> r. The truth table would then read
......!!!!!!!!...................................
RESPONSE --> K
.................................................
......!!!!!!!!...................................
23:22:23 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 --> i actually understand this one
.................................................
?????????w?Student Name: assignment #016
.................................................
......!!!!!!!!...................................
23:40:29 `q001. There are 6 questions in this set. Is the following argument valid? 'If it rains, the grass will get 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.'
......!!!!!!!!...................................
RESPONSE --> yes, because it says that you could smell the grass yesterday when it rained yesterday
.................................................
......!!!!!!!!...................................
23:40:44 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 --> ok
.................................................
......!!!!!!!!...................................
23:41:58 `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 --> no because it's not safe to drive on slippery roads.
.................................................
......!!!!!!!!...................................
23:45:17 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 --> alrighty tricky man, i understand.
.................................................
......!!!!!!!!...................................
23:47:27 `q003. Is the following argument valid: 'Today it will rain or it will snow. Today it didn't rain. Therefore today it snowed.'
......!!!!!!!!...................................
RESPONSE --> yes because it said that it will either rain or snow so we can't assume that it might not do one or the other
.................................................
......!!!!!!!!...................................
23:47:55 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 --> ok
.................................................
......!!!!!!!!...................................
23:49:30 `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 --> it's valid buddy, because of the fact that is said if it doesn't rain we have one, we didn't have one so obviously it did
.................................................
......!!!!!!!!...................................
23:50:06 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 --> Ok
.................................................
......!!!!!!!!...................................
23:54:12 `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 --> it seems to me that is would be (p ^ q) ->r because q isn't a then. if you put it the way it is written, it says if it rains and the grass gets wet 'then' we can smell the wet grass
.................................................
......!!!!!!!!...................................
23:55:13 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 --> gotcha
.................................................
......!!!!!!!!...................................
23:55:53 `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 --> no, wouldn't it be TTT
.................................................
......!!!!!!!!...................................
23:57:23 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 --> ok i understand, but try to say that three times fast
.................................................
"