The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
We introduce a class of rings which is a generalization of reflexive rings and -reversible rings. Let be a ring with identity and denote the Jacobson radical of . A ring is called -reflexive if for any , implies . We give some characterizations of a -reflexive ring. We prove that some results of reflexive rings can be extended to -reflexive rings for this general setting. We conclude some relations between -reflexive rings and some related rings. We investigate some extensions of...
In this paper, we introduce a subclass of strongly clean rings. Let be a ring with identity, be the Jacobson radical of , and let denote the set of all elements of which are nilpotent in . An element is called provided that there exists an idempotent such that and or is an element of . A ring is said to be in case every element in is very -clean. We prove that every very -clean ring is strongly -rad clean and has stable range one. It is shown that for a commutative...
Download Results (CSV)