sham simha Posted January 30, 2014 Posted January 30, 2014 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
Recommended Posts
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 accountSign in
Already have an account? Sign in here.
Sign In Now