We introduce the family of R-based proto-Boolean rings associated with an arbitrary commutative ring R. They generalize the protoBoolean algebra devised by Brown [4] as a tool for expressing in modern language Boole’s research in The Laws of Thought. In fact the algebraic results from [4] are recaptured within the framework of proto-Boolean rings, along with other theorems. The free Boolean alg...

The concept of an MV-algebra was introduced by Chang [4] as an algebraic basis for many-valued logic. It turned out that MV-algebras are a subclass of a more general class of effect algebras [7, 6]. Namely, MV-algebras are in one-to-one correspondence with lattice ordered effect algebras satisfying the Riesz decomposition property [2], the latter are called MV-effect algebras. In the study of c...

In Boolean algebra, true statements are denoted 1 and false statements are denoted 0. A Boolean function acts on a set of these Boolean values and outputs a set of Boolean values (usually just one). The most common Boolean operators used are NOT, AND, OR, and XOR. 2.1 NOT NOT is a Boolean function that takes in one Boolean value and outputs its negation. Let x be a Boolean variable. NOT(x) is d...