A well-known problem in Boolean algebra is to determine whether an algebra with binary operation + and unary operation I is Boolean if it satisfies the axioms. The purpose of this paper is to show that the Robbins Problem can be investigated by using a simplified notation for formal algebras.
A well-known problem in Boolean algebra is to determine whether an algebra with binary operation + and unary operation I is Boolean if it satisfies the axioms. The purpose of this paper is to show that the Robbins Problem can be investigated by using a simplified notation for formal algebras.
A well-known problem in Boolean algebra is to determine whether an algebra with binary operation + and unary operation I is Boolean if it satisfies the axioms. The purpose of this paper is to show that the Robbins Problem can be investigated by using a simplified notation for formal algebras.