نتایج جستجو برای: pseudo bck algebra

تعداد نتایج: 118706  

Journal: :Annales Universitatis Paedagogicae Cracoviensis. Studia Mathematica 2018

2001
Mitsuo Abe Katsunori Kawamura

Representation of the algebra of FP (anti)ghosts in string theory is studied by generalizing the recursive fermion system in the Cuntz algebra constructed previously. For that purpose, the pseudo Cuntz algebra, which is a ∗-algebra generalizing the Cuntz algebra and acting on indefinite-metric vector spaces, is introduced. The algebra of FP (anti)ghosts in string theory is embedded into the pse...

Mahmood Bakhshi, Mohammad Mehdi Zahedi, Rajab Ali Borzooei

In this note first we define the notions of fuzzy positive implicativehyper BCK-ideals of types 1,2,3 and 4. Then we prove some theorems whichcharacterize the above notions according to the level subsets. Also we obtainthe relationships among these notions, fuzzy (strong, weak, reflexive) hyperBCK-ideals and fuzzy positive implicative hyper BCK-ideals of types 5,6,7and 8. Then, we define the no...

2007
PAVEL KOLESNIKOV

For a given variety Var of algebras we define the variety Var of dialgebras. This construction turns to be closely related with varieties of pseudo-algebras: every Var-dialgebra can be embedded into an appropriate pseudo-algebra of the variety Var. In particular, Leibniz algebras are exactly Lie dialgebras, and every Leibniz algebra can be embedded into current Lie conformal algebra.

2010
DONALD MONK

A universal algebra is simple if and only if it has more than one element and there are no proper homomorphisms defined upon it. In this note we study a related notion : an algebra is pseudo-simple if and only if it has more than one element and is isomorphic to all its proper (i.e., non-one-element) homomorphic images. The two concepts simplicity and pseudo-simplicity are examples of concepts ...

Journal: :Ann. Pure Appl. Logic 2000
Martin Hofmann

In previous work the author has introduced a lambda calculus SLR with modal and linear types which serves as an extension of Bellantoni–Cook’s function algebra BC to higher types. It is a step towards a functional programming language in which all programs run in polynomial time. In this paper we develop a semantics of SLR using BCK-algebras consisting of certain polynomial-time algorithms. It ...

2013
Young Bae Jun G. Muhiuddin Abdullah M. Al-roqi

The notion of a (closed) double-framed soft ideal (briefly, a (closed) DFS-ideal) in BCK/BCI-algebras is introduced, and related properties are investigated. Several examples are provided. The relation between a DFS-algebra and a DFS-ideal is considered, and characterizations of a (closed) DFS-ideal are established. A new DFS-ideal from old one is constructed, and we show that the int-uni DFS-s...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید