A community for students.
Here's the question you clicked on:
 0 viewing
anonymous
 4 years ago
what is the negation" all cabbages are green
anonymous
 4 years ago
what is the negation" all cabbages are green

This Question is Closed

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0suppose that "if z is a wgroup then z is solvable" is a true statement, you also know that the "z is solvable" is true. can you deduce that "z is a wgroup" is true?

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0i wish i was good a math

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0no because for the statement to be true z is a wgroup could be true or false

lgbasallote
 4 years ago
Best ResponseYou've already chosen the best response.0unless there's more to that question...don't you just put a "not" before the adjective?

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0igbasallote what are you talking about?

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0in a "if p then q" statement. if "if p" is false the whole statement is true regardless of then p. If they are both true then it is also true. It can only be false if "if p" is true and "then q" is flase.

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0I can give you an example to clarify if you want

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0I was answering ur second question by the way

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0@lgbasollote was answering your first.

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0and @lgbasallote you were correct

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0I don't get what lgbasallote was saying

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0actually let me look at me logic notes to make sure.

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0The correct answer to your first question is All cabages are not green

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0Like the car is red. The negation is the car is not red

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0why isn't it not all cabbages are green

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0because that implies that some are green

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0we want to to do a complete opposite

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0so u wan't to tell that none of them are green right?

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0Did you understand what I was saying to your second question

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0im trying to figure it out now

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0What class is this? just curious

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0whole class based on proofs basically

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0induction proofing, contradictions, and now we are at sets theories

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0I took a class called mathematical logic which involved a bunch of this stuff. Kinda interesting kinda hell

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0Only class I have ever had to drop cuz i was failing. Sets, relations, and functions.

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0Let me know if you don't understand my explanation about your second question I can provide an example that would make it clearer. I'm going to move on to other questions

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0thats pretty much what i am in now, and let me tell you that I have no idea how im going to pass that class

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0Logic was kinda fun. Sets is hell. I would master definitions. completely understand what a subset is and what real numbers and complex numbers. just master definitions because you can use those in ur proofs. I wish I had done that.

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0im trying to figure out that example and don't completely get it So P=>Q so if z is a wgroup then z is solvable IS TRUE, then "Z is solvable is also true" why s s "Z is a wgroup false?

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0The negation of "all cabbages are green" is "there exists a cabbage which is not green". All is a quantifier.

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0isn't the negation "all cabbages are not green?"

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0So @DanielxAK we just had to show that for all to be false one is true?

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0lets use p and q for your question all the words are confusing me lol. So the question is essentially... If, if p then q is true, then q is true" So its a nested statement?

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0P>Q T Premise Q T Prove

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0I'm not sure I understand what you mean by that. If it was phrased, cabbage is green. Then, the negation would be cabbage is not green. But, you have "all cabbages are green". So, the negation would be "there exists a cabbage which isn't green". The negation of all is one. This might be able to explain it better than I can: http://www.math.cornell.edu/~hubbard/negation.pdf

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0Your second question @math_proof, I think it is a correct statement. Because "if p" is true, for the statement to be true (which it is by a premise) "then q" must be true. and "if p" is false. Then "then q" is assumed true because it can't be proven otherwise.

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0You got me inerested now. I dug out my logic notes. Law of Equivalence for Implication and Disjunction (LEID) states IF p>q is true, THEN not p or q is true

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0So we are Given that P > Q is true correct? and we have to prove that Q is true? am I understanding right?

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0we know that Q is true

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0so P can be either true of false

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0so P=>Q, z is a wgroup then z is solvable" is a true statement, so P>Q is true and we know Q is true because "Z is solvable" so P can be either True of False? thats what i'm thinking

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0P>Q T Premise Q T Premise P T Prove Ok I'm on the right page

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0So I would say the answer is ~P V P

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0thats based on truth table on logical implication

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0so we can't deduce if P is true

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0I have this cheat sheet that my teacher made us with all the laws of logic that can be used in a proof. If you'd like it i'll email it to you. Just private message me your email. If you are not comfortable with that I guess I could post it on this thread, but I've got warned for stuff like that

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0I guess we can't for certain

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0omg thanks so much for that, I actually get it now

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0No problem. When you jump into sets I will be no help. Like I said earlier for sets proofs I would master definitions because my teacher used a lot of "By def'n..." in her proofs

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0i never heard of this website, but now that i discovered it is so useful and helpful and for free

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0how do you give a medal?
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.