Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

For instance,

Is $\neg (((p \land q) \lor r) \land s)$ equivalent to $((\neg p \lor \neg q) \land \neg r) \lor \neg s$?

share|improve this question
    
I think you can factorize it in the brackets first, and use the easy DeMorgan's Law a few times. –  rhenskyyy Apr 28 '12 at 3:32
3  
$p\land q\lor r\land s$ is ambiguous. Does it mean $(p\land q)\lor(r\land s)$, or does it mean $((p\land q)\lor r)\land s$, or some other combination? (Note the two are not equivalent; $(p\land q)\lor (r\land s)$ is true if $p$ and $q$ are true and $r$ and $s$ are false, but $((p\land q)\lor r)\land s$ is false if $s$ is false). Express it clearly first, and figure out which connective is at the "top level". –  Arturo Magidin Apr 28 '12 at 3:33
    
In short: what precedence rules are you using? –  J. M. Apr 28 '12 at 3:37
2  
@JohnHoffman: With the parenthesization that I think you had in mind, your calculation is correct. However, the reader should not be put into the position of having to guess where the missing parentheses are intended to be, unless there are long-established conventions. –  André Nicolas Apr 28 '12 at 3:37
2  
The short answer: Yes, you can use DeMorgan's law to expand a long sequence; this is easy to verify if they are all $\land$s or all $\lor$s. For other combinations, you have to be a bit careful on how you associate on either side (making sure the associations are compatible). –  Arturo Magidin Apr 28 '12 at 3:59
show 3 more comments

1 Answer

up vote 0 down vote accepted

Yes. I think you could prove this by induction. You might also note that once your fully parenthesize the intended formula, if you do things step by step, the negation moves to the parentheses first if any exist, and then moves to the letters and switches just one operation from AND to OR or the other way around. You could also note that negation consists of an isomorphism between ({T, F}, AND) and ({T, F}, AND') where " AND' " indicates OR, which implies that as long as you switch all values for the variables accordingly, and switch the first operation with its correlate OR, any given formula will behave exactly the same once the first operation has gotten rewritten as the second. Negation ensures that you've switched all values accordingly, so you can use De Morgan's laws this way.

share|improve this answer
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.