Is S^{c} the key difference in this logical equivalence?

  • Thread starter Thread starter Horse
  • Start date Start date
  • Tags Tags
    Equivalent Logic
Horse
Messages
34
Reaction score
0
Is it equivalent?
<br /> ( \forall x \in S \forall y P(x) ) &lt;=&gt; \neg ( \exists x \in S^{c} \exists y \neg P(x) )<br />

Attempt at solution
I think it should be
<br /> ( \forall x \in S \forall y P(x) ) &lt;=&gt; \neg ( \exists x \in S \exists y \neg P(x) )<br />
The diiference to the above statement is S^{c}.
 
Last edited:
Physics news on Phys.org


Yes, your statement is correct.
 


HallsofIvy said:
Yes, your statement is correct.

Please, can you clarify whether it is the first statement or my attempt at solution?
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top