Proving De Morgan laws inductively?

  • Thread starter Thread starter next__
  • Start date Start date
  • Tags Tags
    Laws
next__
Messages
1
Reaction score
0
How can I prove <by induction> the following De Morgan laws are valid for all n >= 2

- ( P(d1) ^ ... ^ P(dn) ) = ( - P(d1) ) v ... v ( - P(dn) )

knowing that -(p^q)=(-p)v(-q) and -((p)v(q))=(-p)^(-q) ?

I can use the inductive proof method on algebra/math theorems that have to do with variables, numbers, series, sums, etc. but I don't know what to do with propositions. Help, anyone?

I know how to prove the De Morgan laws when it comes to sets, I can also do it by deduction, but I'm just curious as to how you'd go about doing this inductively.
 
Physics news on Phys.org
Hint: Treat the propositions as formulas in Boolean algebra and use the fact that the operators ^ and v are (individually) associative.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top