Boolean rings and Boolean algebras

  • Thread starter Thread starter quasar987
  • Start date Start date
  • Tags Tags
    Rings
Click For Summary
A Boolean algebra can be derived from a Boolean ring by defining operations such as xANDy as xy, xORy as x+y+xy, and xNOT as 1+x. However, there is a concern that xNOT does not satisfy the involution property, as (xNOT)NOT results in 1+(1+x), which does not equal x. The discussion suggests that if xNOT were defined as -x, it would resolve the issue of involution. Additionally, it is noted that in an idempotent ring, the equation x+x=0 holds true, reinforcing the complexities of these definitions. The conversation highlights the nuances in the relationship between Boolean rings and algebras.
quasar987
Science Advisor
Homework Helper
Gold Member
Messages
4,796
Reaction score
32
My professor wrote that we get a Boolean algebra from a Boolean ring (R,+,-,.,0,1) by setting xANDy=xy, xORy=x+y+xy and xNOT=1+x.

But it seems to me that xNOT is not an involution. I.e., (xNOT)NOT = 1+(1+x), which is not x.

(xNOT=-x would do the trick though)
 
Physics news on Phys.org
It seems to me that

1+(1+x) = x

For several reasons. What else would it be equal to? Doesn't 1 + 1 = 0?
 
I forgot about that. In an idempotent ring, x+x=0.
 
The standard _A " operator" maps a Null Hypothesis Ho into a decision set { Do not reject:=1 and reject :=0}. In this sense ( HA)_A , makes no sense. Since H0, HA aren't exhaustive, can we find an alternative operator, _A' , so that ( H_A)_A' makes sense? Isn't Pearson Neyman related to this? Hope I'm making sense. Edit: I was motivated by a superficial similarity of the idea with double transposition of matrices M, with ## (M^{T})^{T}=M##, and just wanted to see if it made sense to talk...

Similar threads

  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 21 ·
Replies
21
Views
3K
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 14 ·
Replies
14
Views
2K
Replies
5
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 6 ·
Replies
6
Views
1K