1962
DOI: 10.1007/bf01365557
|View full text |Cite
|
Sign up to set email alerts
|

Boolean semirings

Abstract: IntroductionA ring R, in which every element is idempotent, is called a "Boolean ring"; and it is well-known that a Boolean ring (with unity element) is also a distributive (and complemented) lattice.Several generalisations for a Boolean ring are known --p-rings, regular rings, biregular rings, associate rings [3], Pl-rings [I], etc., of which, the class of associate rings contains, as special cases, those of p-rings, regular rings with unity element and without nonzero nilpotent elements etc. [3], and the cla… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
7
0

Year Published

1963
1963
1992
1992

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 13 publications
(7 citation statements)
references
References 4 publications
0
7
0
Order By: Relevance
“…Left permutable near-rings which also satisfy x 2 = x identically are the "t-near-rings" of LIGI4 [18] and have been considered by RATLIFF [27] and SUBRAHMAYAN [29]. (The latter calls them "Boolean semirings".)…”
Section: Introductionmentioning
confidence: 99%
“…Left permutable near-rings which also satisfy x 2 = x identically are the "t-near-rings" of LIGI4 [18] and have been considered by RATLIFF [27] and SUBRAHMAYAN [29]. (The latter calls them "Boolean semirings".)…”
Section: Introductionmentioning
confidence: 99%
“…PROPOSITION Boolean, left permutable near-rings were called "^-near-rings" by Ligh who characterized them in terms of subdirectly irreducible components [ 15]. (Earlier Subrahmanyan [28] considered Boolean, left permutable near-rings with abelian additive group, which he called "Boolean semirings.") It is immediate that a /Nnear-ring is LSD.…”
Section: Reduced Lsd Near-rings and Allied Topicsmentioning
confidence: 99%
“…Since special Boolean near-rings and Boolean semi-rings as defined in [3] and [8] respectively are ^-near-rings, Theorem 5.2 furnishes the subdirect structures of those near-rings as well.…”
Section: If R Is a Subdirectly Irreducible ^-Near-ring Then R Has A Lmentioning
confidence: 99%