Note on uni-serial and generalized uni-serial rings
نویسندگان
چکیده
منابع مشابه
Serial Rings
A module is called uniseriat if it has a unique composition series of finite length. A ring (always with 1) is called serial if its right and left free modules are direct sums of uniserial modules. Nakayama, who called these rings generalized uniserial rings, proved [21, Theorem 171 that every finitely generated module over a serial ring is a direct sum of uniserial modules. In section one we g...
متن کاملGENERALIZED UNI-SOFT INTERIOR IDEALS IN ORDERED SEMIGROUPS
For all M,N∈P(U) such that M⊂N, we first introduced the definitions of (M,N)-uni-soft ideals and (M,N)-uni-soft interior ideals of an ordered semigroup and studied them. When M=∅ and N=U, we meet the ordinary soft ones. Then we proved that in regular and in intra-regular ordered semigroups the concept of (M,N)-uni-soft ideals and the (M,N)-uni-soft interior ideals coincide. Finally, we introduc...
متن کاملThe Structure of Serial Rings
A serial ring (generalized uniserial in the terminology of Nakayama) is one whose left and right free modules are direct sums of modules with unique finite composition series (uniserial modules.) This paper presents a module-theoretic discussion of the structure of serial rings, and some onesided characterizations of certain kinds of serial rings. As an application of the structure theory, an e...
متن کاملSerial Correlation Coefficient
In this paper, we investigate the relation between two variables where the one is measured with the ratio or interval scale and the other with the nominal. In this cases, we use from serial correlation coefficient. Computation of some serial coefficient such as biserial and point-biserial coefficient is carried out with some examples and R program.
متن کاملPolytypic Uni cation
Uni cation or two way pattern matching is the process of solving an equation involving two rst order terms with variables Uni cation is used in type inference in many pro gramming languages and in the execution of logic programs This means that uni cation algorithms have to be written over and over again for di erent term types Many other functions also make sense for a large class of datatypes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Japan Academy, Series A, Mathematical Sciences
سال: 1940
ISSN: 0386-2194
DOI: 10.3792/pia/1195579089