Can someone please give me a hint how to solve my task ?

Show that every Boolean algebra is an ortholattice, but not conversely.

Attachment 30082

1^{st}and 2^{nd}are done by definition.What about 3 and 4 ?

Printable View

- January 26th 2014, 02:20 AMxmegxBoolean Algebra
Can someone please give me a hint how to solve my task ?

Show that every Boolean algebra is an ortholattice, but not conversely.

Attachment 30082

1^{st}and 2^{nd}are done by definition.What about 3 and 4 ? - January 26th 2014, 03:37 PMchiroRe: Boolean Algebra
Hey xmegx.

The 3rd condition is known as De-Morgans Laws. You might want to read up on them for more information.

The 4th one could be done in a few ways - including the use of De-Morgans Laws (Part 3) where you find (x' OR 0)' and simplify.