|
Tutors Answer Your Questions about Conjunction (FREE)
Question 889738: A student studying the weather for d days observed that
1) it rained on 7 days , morning OR afternoon
2) When it rained in afternoon it was clear in morning
3) there were 5 clear afternoons
4) there were 6 clear mornings.
Then d equals
Click here to see answer by richwmiller(17219)  |
Question 911051: Please help me solve this I've asked my teacher but he will not help me . Question- which size can of soup shown in the table has the lowest unit price ? And now I will type in the table-
Soup prices oz -
10 - $0.79
15 - $1.29
18 - $2.16
32 - $3.19
Click here to see answer by josgarithmetic(39617) |
Question 915332: Use an ordinary truth table to answer the following problems. Construct the truth table as per the instructions in the textbook.
Given the argument:
S ⊃ (K ∨ ∼ S) / K ⊃ S // S ≡ K
This argument is:
a. Invalid; fails in 2nd line.
b. Invalid; fails in 3rd line.
c. Invalid; fails in 1st line.
d. Valid.
e. Invalid; fails in 4th line.
Click here to see answer by Edwin McCravy(20054)  |
Question 915332: Use an ordinary truth table to answer the following problems. Construct the truth table as per the instructions in the textbook.
Given the argument:
S ⊃ (K ∨ ∼ S) / K ⊃ S // S ≡ K
This argument is:
a. Invalid; fails in 2nd line.
b. Invalid; fails in 3rd line.
c. Invalid; fails in 1st line.
d. Valid.
e. Invalid; fails in 4th line.
Click here to see answer by AnlytcPhil(1806)  |
Question 927200: Use ordinary truth tables to answer the following problem.
Given the argument: B ∨ M / B ∨ ∼ K // (K ∨ ∼ M) ⊃ B, this argument is:
Invalid; fails in 3rd line.
Invalid; fails in 2nd line.
Invalid; fails in 1st line.
Invalid; fails in 4th line.
Valid.
I have tried to break up the question and use the T & F in the lines but keep messing up on my placement. Can someone help me so that I can understand what I am doing wrong. Thanks!
Click here to see answer by Edwin McCravy(20054)  |
Question 971804: I had an exam which i failed because of logical questions of this sort.
- What is the equivalent of " A dolphin cannot fly and a bird can swim" is false?
I know this is a question which it involves conjunction but i do not know how to process such in order to arrive with an answer.
Do i have to double negate it?
Please help me. Thanks
Click here to see answer by Edwin McCravy(20054)  |
Question 972808: I'm stuck on the following question: Use truth tables to establish whether the following arguments are valid. If any arguments are not valid, give counterexamples to them. If any arguments are valid, explain carefully why they are valid.
e.g. P or Q, not P, Q
or not (P or not Q) P <> Q
I'm not sure how to provide counterexamples or explain how an argument is valid.
Click here to see answer by solver91311(24713)  |
Question 975437: INSTRUCTIONS: Use ordinary truth tables to answer the following problems. Construct the truth tables as per the instructions in the textbook.
Given the argument:
Premises: B ∨ M / B ∨ ∼K Conclusion: (K ∨ ∼M) ⊃ B
This argument is:
A. Invalid; fails in 3rd line.
B. Invalid; fails in 2nd line.
C. Invalid; fails in 1st line.
D. Invalid; fails in 4th line.
E. Valid.
Click here to see answer by solver91311(24713)  |
Question 975442: INSTRUCTIONS: Determine whether the following symbolized arguments are valid or invalid by identifying the form of each. In some cases the argument must be rewritten using double negation or commutativity before it has a named form. Those arguments without a specific name are invalid.
H ⊃ ∼M
M____
∼H
DA--invalid.
MP--valid.
AC--invalid.
MT--valid.
HS--valid.
Click here to see answer by jim_thompson5910(35256) |
Question 975440: I've compared them to every rule and they don't make sense to me.
INSTRUCTIONS: Determine whether the following symbolized arguments are valid or invalid by identifying the form of each. In some cases the argument must be rewritten using double negation or commutativity before it has a named form. Those arguments without a specific name are invalid.
∼S
∼S ⊃ FF
MP--valid.
AC--valid.
MT--valid.
AC--invalid.
DS--valid.
Click here to see answer by solver91311(24713)  |
Question 975439: INSTRUCTIONS: Use indirect truth tables to answer the following problems.
Given the argument:
Premises: (K ∼C) ⊃ ∼(P R)/ J ⊃ (K P)/ A ⊃ (P R) Conclusion: (A J) ⊃ C
This argument is:
Cogent.
Sound.
Valid.
Uncogent.
Invalid.
Click here to see answer by Edwin McCravy(20054)  |
Question 975438: I'm having real difficulty solving this, can you please help?
INSTRUCTIONS: Use indirect truth tables to answer the following problems.
Given the argument:
Premises: E ⊃ J / B ⊃ Q / D ⊃ (J ∼Q) Conclusion: (E B) ≡ D
This argument is:
Uncogent.
Sound.
Valid.
Invalid.
Cogent.
Click here to see answer by jim_thompson5910(35256) |
Question 975476: Is the answer CD - invalid? If not, what is it and why? Thanks!
Determine whether the following symbolized arguments are valid or invalid by identifying the form of each. In some cases the argument must be rewritten using double negation or commutativity before it has a named form.
(R ⊃ ∼T) (D ⊃ T)
∼T ∨ T____
∼R ∨ ∼D
MT--valid.
CD--invalid.
CD--valid.
HS--valid.
DD--valid.
Click here to see answer by jim_thompson5910(35256) |
Question 975482: What is the answer? I think it's invalid.
Determine whether the following symbolized arguments are valid or invalid by identifying the form of each. In some cases the argument must be rewritten using double negation or commutativity before it has a named form. Those arguments without a specific name are invalid.
∼D ⊃ N
D_
∼N
MP--valid.
MT--invalid.
DA--invalid.
AC--invalid.
Invalid.
I believe it's the last answer because it doesn't seem to substitute into the rules. Correct if I'm wrong, please! Thank you!!
Click here to see answer by solver91311(24713)  |
Question 975481: I believe this is just invalid, can somebody confirm if that is the correct answer or does it match up with a property?
INSTRUCTIONS: Determine whether the following symbolized arguments are valid or invalid by identifying the form of each. In some cases the argument must be rewritten using double negation or commutativity before it has a named form. Those arguments without a specific name are invalid.
(∼G ∨ E) (R ∨ M)
R ∨ ∼G ___
E ∨ M
MT--valid.
Invalid.
DA--invalid.
MP--valid.
AC--invalid.
Click here to see answer by solver91311(24713)  |
Question 976057: Instructions: Identify the premises and the conclusion. Also find the structure and then use truth tables to evaluate validity or invalidity. Finally provide your translation schema.
Problem: There are only three possibilities: either your sister is mad, or she is telling lies, or she is telling the truth. You know she does not tell lies, and she is obviously not mad, so we must conclude she is telling the truth. (C. S. Lewis, `` The Lion, the Witch, and the Wardrobe'')
Click here to see answer by t0hierry(194)  |
Question 983778: Let P represent the simple statement " The stove is hot" and q represent "the taxes are high" express compound statement in symbolic form.
The stove is hot if and only if the taxes are high, and as the stove is not hot, the taxes are not high.
The compound statement in symbolic form is ?
Click here to see answer by solver91311(24713)  |
Question 1008189: Let the universal set A = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12}, and the following
subsets of A :
B is the set of elements of A multiple of 2 and less than 11.
C is the set of elements of A that are odd and less than 10.
D is the set {0, 1, 10, 11}.
Determine the cardinality of the following sets. You are not obliged to justify
your answer, but explanations can earn you partial points in case of wrong answer.
a) C ∪ D :
b) B ∪ C ∪ D :
c) (B \ C) ∪ (C \ B) :
d) (B ∩ D) ∪ C :
e) (B ∩ C) :
f) B \ D :
g) B ∪ C :
h) B ∩ C ∩ D :
i) (B ∪ C) ∩ D :
j) D \ (B ∪ C) :
Click here to see answer by jim_thompson5910(35256) |
Question 1008187: Assume that the following 4 logical propositions are all true :
1. (A → B) ∧ (A → ¬B)
2. ¬A → B
3. ¬(B ∧ D)
4. C ∨ ¬A
What can you say about the truth value of propositions A, B, C and D. You
can answer true, false, or uncertain. Justify your answers.
Truth value of proposition A :
Truth value of proposition B :
Truth value of proposition C :
Truth value of proposition D :
Click here to see answer by jim_thompson5910(35256) |
Question 1028615: Either the mind is identical to the brain, or it is immaterial. If the mind is immaterial, it doesnt make any difference. The mind makes a difference. Therefore, the mind is identical to the brain. (B, I, D)
Click here to see answer by robertb(5830)  |
Question 1032455: Assume that the following 4 logical propositions are all true :
1. A → B
2. C → D
3. A ∨ C
4. ¬D
What can you say about the truth value of propositions A, B, C and D. You
can answer true, false, or uncertain. Justify your answers.
Truth value of proposition D :
Truth value of proposition C :
Truth value of proposition A :
Truth value of proposition B :
Click here to see answer by jim_thompson5910(35256) |
Question 1041074: Using a truth table to determine if the following pairs of statements are logically equivalent, contradictory, consistent or inconsistent.
~ D v B // ~ ( D * ~ B)
H = ~ G // ( G * H ) > ( ~ G * ~ H )
N * ( A > ~ E ) // ~ A * ( E v ~ N )
M > ( K > P ) // ( K * M ) > P
Q > ~ ( K v F ) // ( K * Q ) v ( F * Q )
Click here to see answer by solver91311(24713)  |
|
Older solutions: 1..45, 46..90, 91..135, 136..180, 181..225, 226..270, 271..315, 316..360, 361..405, 406..450, 451..495
|
| |