Jump to content

Boolean Algebra


sham simha

Recommended Posts

Hi Can some one help me in proving this statement.
Show that in a Boolean algebra, for any a,b and c, if any a≤b, then
a∨(b∧c)=b∧(a∨c).

 

Hi Can some one help me in proving this statement.
Show that in a Boolean algebra, for any a,b and c, if any a≤b, then
a∨(b∧c)=b∧(a∨c).

 

I got the answer thanks.

Logic is X or X = X

Link to comment
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
×
×
  • Create New...

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.