"All gleems are bloogs" leaves room for the possibility that there are a lot of bloogs that are not gleems. Yes, everytime you see a gleem, you can assume he is a bloog, but when you see a bloog, you don't know for certain whether he is a gleem or not.
"Some toogs are bloogs" doesn't tell us whether any of the toogs are gleems. The toogs could be the bloogs that are not gleems for all we know.
So, we do not have enough information to determine whether any toogs are gleems. They could be. Nothing in the statements excludes that possibility. But the information we are given does not prove whether or not they are.
So the answer your teacher is probably looking for is "false."
===================================================
Let me give you another explanation:
Some airplanes are toys. (They make toy airplanes.)
All teddy bears are toys.
Therefore, some airplanes are teddy bears: true or false?
Some snacks are cookies.
All Oreos are cookies.
Therefore, some snacks are Oreos: true or false?
Airplanes are not teddy bears. But some snacks are Oreos. It could go either way.
The original question does not have enough information to determine the answer.
True
False.
False 1/3 = 0.33333333333 Repeating or 33.33333333333333 Repeating % 33% = 0.33
true
True
False, the Bekes who are Broons are not necessarily among the Bekes who are Toogs.
Consider a bloob. Because it is a bloob, and ALL bloops are toogs, it must also be a toog. But if it is a toog then, because no toogs are goopers, it cannot be a gooper. So if it a bloob it cannot be a gooper. That is to say no gooper can be a bloob.
False
True AND False OR True evaluates to True. IT seems like it does not matter which is evaluated first as: (True AND False) OR True = False OR True = True True AND (False OR True) = True AND True = True But, it does matter as with False AND False OR True: (False AND False) OR True = False OR True = True False AND (False OR True) = False AND True = False and True OR False AND False: (True OR False) AND False = True AND False = False True OR (False AND False) = True OR False = True Evaluated left to right gives a different answer if the operators are reversed (as can be seen above), so AND and OR need an order of evaluation. AND can be replaced by multiply, OR by add, and BODMAS says multiply is evaluated before add; thus AND should be evaluated before OR - the C programming language follows this convention. This makes the original question: True AND False OR True = (True AND False) OR True = False OR True = True
False. It is software.
True
Assuming that you mean not (p or q) if and only if P ~(PVQ)--> P so now construct a truth table, (just place it vertical since i cannot place it vertical through here.) P True True False False Q True False True False (PVQ) True True True False ~(PVQ) False False False True ~(PVQ)-->P True True True False if it's ~(P^Q) -->P then it's, P True True False False Q True False True False (P^Q) True False False False ~(P^Q) False True True True ~(P^Q)-->P True True False False
Yes. If all the question's parts are true, then the answer is true. If all the question's parts are false, then the answer is false. If one of the question's parts is false and the rest true, then the answer is false. Logically, this is illustrated below using: A = True, B = True, C = True, D = False, E = False, F = False A and B and C = True D and E and F = False A and B and D = False If you add NOT, it's a bit more complicated. A and NOT(D) = True and True = True NOT(D) and D = True and False = False NOT(A) and NOT(B) = False and False = False Using OR adds another layer of complexity. A OR NOT(E) = True OR True = True NOT(D) OR D = True OR False = False NOT(A) OR NOT(B) = False OR False = False Logic is easy once you understand the rules.
False.
false
true and false it depends
False 1/3 = 0.33333333333 Repeating or 33.33333333333333 Repeating % 33% = 0.33