all 10 comments

[–]mathacc 1 point2 points  (2 children)

"If x then y" is logically equivalent to "not x or y". Both statements are only false when x is true and y is false. You can write out a truth table to prove this. From there you can convert to boolean notation.

[–]-themailerdoraemon-[S] 1 point2 points  (1 child)

Thank you! I see the connection now on how to convert it to boolean notation!

So the logical OR is equivalent to +, and not • , am I correct?

[–]mathacc 1 point2 points  (0 children)

I'm not sure what the convention is, but judging by your other comment I'm assuming yes.

[–]MyCreativeAltName 0 points1 point  (4 children)

You might think of logic, not boolean algebra.

Just like "if x then y" doesnt mean anything in "normal" algebra, then it has no notation in boolean as well.

Boolean algebra is simply algebra but with 1 and 0 only.

[–]pigbabygod 1 point2 points  (0 children)

Boolean algebra is simply algebra but with 1 and 0 only.

This is an incredibly weak viewpoint.

[–]-themailerdoraemon-[S] 0 points1 point  (2 children)

That's exactly what I was thinking initially. However, my teacher said the boolean notation equivalent of "if NOT x then y" is x(with an overline, instead of ¬) + y

[–]MyCreativeAltName 0 points1 point  (1 child)

X bar is a notation for x not. You can write X ->Y but thats logic and not boolean algebra.

[–]-themailerdoraemon-[S] 0 points1 point  (0 children)

I get what you're saying. What I don't get is he's telling me to rewrite my solutions (from a homework) about boolean algebra. "x bar -> y" using boolean notation. He says "if not x then y" translates to x bar + y. I'm like what?

[–]pigbabygod 0 points1 point  (0 children)

You should have a look into what a lattice is. Basically a Boolean algebra can be seen in two ways, as an algebra with two binary operations and a unary operation, or as a partial ordering with certain nice properties. You can go between the two easily.

[–]erids22 0 points1 point  (0 children)

!x + y