I've read the formula written on the title on a mathematics' book and it doesn't seem correct for me:
For the first part of the formula [A ∨ (B∧C)] I have the following possible values:
A; B and C; A and B and C (the Or is not exclusive)
For the second part of the formula [(A ∨ B) ∧ (A ∨ C)] I have the following values:
A and A (A); A and C; B and A; B and C; ...; A and B and A and C (A and B and C)
So I can have for the second part of the formula A and B; A and C which I can't obtain with the first part of the formula.
If I'm mistaken can somebody please tell me how and give some examples.
thanks,
Bruno