نتایج جستجو برای: pseudo bci algebra
تعداد نتایج: 122103 فیلتر نتایج به سال:
Many authors studied the graph theory in connection with commutative semigroups and commutative and noncommutative rings as we can refer to references. For example, Beck 1 associated to any commutative ring R its zero-divisor graph G R whose vertices are the zero-divisors of R including 0 , with two vertices a, b joined by an edge in case ab 0. Also, DeMeyer et al. 2 defined the zero-divisor gr...
Pseudo-linear algebra is the study of common properties of linear differential and difference operators. We introduce in this paper its basic objects (pseudo-derivations, skew polynomials, and pseudo-linear operators) and describe several recent algorithms on them, which, when applied in the differential and difference cases, yield algorithms for uncoupling and solving systems of linear differe...
In this note, we show that there is no Hopf algebra structure onQ∞, the algebra of pseudo-roots of noncommutative polynomials, which extends the one existing on NSym (one of its famous subalgebras).
In this note, we show that there is no Hopf algebra structure onQ∞, the algebra of pseudo-roots of noncommutative polynomials, which extends the one existing on NSym (one of its famous subalgebras).
We consider 3-Jordan algebras, i.e., the nonassociative commutative algebras satisfying (x^3 y)x=x^3(yx). The variety of 3-Jordan algebras contains all Jordan algebras and all pseudo-composition algebras. We prove that a simple 3-Jordan algebra with idempotent is either a Jordan algebra or a pseudo-composition algebra. Disciplines Algebra | Mathematics Comments This article is published as Hent...
Abstract This paper introduces the idea of £-Smarandache pseudo fuzzy ideal a BH–algebra. Some suggestions and examples are given to comprehend features this decide connected aspects among them with
Processing of the certain information, especially inferences based on certain information. Is based on classical two-valued logic. Due to strict and complete logical foundation (classical logic), making inference levels. Thus, it is natural and necessary to attempt to establish some rational logic system as the logical foundation for uncertain information processing. It is evident that this kin...
We investigate classes of Boolean algebras related to the notion of forcing that adds Cohen reals. A Cohen algebra is a Boolean algebra that is dense in the completion of a free Boolean algebra. We introduce and study generalizations of Cohen algebras: semi-Cohen algebras, pseudo-Cohen algebras and potentially Cohen algebras. These classes of Boolean algebras are closed under completion.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید