Can I use modular arithmetic to solve problems in HW1? It seems useful in tackling Q2(a,d) and Q4(b)
Yes, you are allowed to use whatever tools unless otherwise specified.
1C) ‧s v ┐Exist x Q(x)the not(┐) is apply to "Exist x" or the whole term??
I cannot see the difference of these two understandings on the statement. Can you elaborate a bit?
┐Exist x Q(x) >> All x Q(x)┐(Exist x Q(x)) >> All x ┐Q(x)
I think both understanding should result in \forall x \neg Q(x)
Can I use modular arithmetic to solve problems in HW1? It seems useful in tackling Q2(a,d) and Q4(b)
ReplyDeleteYes, you are allowed to use whatever tools unless otherwise specified.
ReplyDelete1C) ‧s v ┐Exist x Q(x)
ReplyDeletethe not(┐) is apply to "Exist x" or the whole term??
I cannot see the difference of these two understandings on the statement. Can you elaborate a bit?
ReplyDelete┐Exist x Q(x) >> All x Q(x)
ReplyDelete┐(Exist x Q(x)) >> All x ┐Q(x)
I think both understanding should result in \forall x \neg Q(x)
ReplyDelete