Repository of University of Nova Gorica

Search the repository
A+ | A- | Help | SLO | ENG

Query: search in
search in
search in
search in
* old and bologna study programme

Options:
  Reset


1 - 8 / 8
First pagePrevious page1Next pageLast page
1.
2.
Primeness of Relative Annihilators in BCK-Algebra
Hashem Bordbar, 2020, original scientific article

Abstract: Conditions that are necessary for the relative annihilator in lower BCK-semilattices to be a prime ideal are discussed. Given the minimal prime decomposition of an ideal A, a condition for any prime ideal to be one of the minimal prime factors of A is provided. Homomorphic image and pre-image of the minimal prime decomposition of an ideal are considered. Using a semi-prime closure operation “cl”, we show that every minimal prime factor of a cl-closed ideal A is also cl-closed.
Keywords: lower BCK-semilattice, relative annihilator, semi-prime closure operation, minimal prime decomposition, minimal prime factor
Published in RUNG: 24.02.2020; Views: 3532; Downloads: 0
This document has many files! More...

3.
WEAK CLOSURE OPERATIONS WITH SPECIAL TYPES IN LOWER BCK-SEMILATTICES
Hashem Bordbar, Young Bae Jun, 2017, original scientific article

Abstract: The notions of (strong) quasi prime mapping on the set of all ideals, t- type weak closure operation, and tender (resp., naive, sheer, feeble tender) weak closure operation are introduced, and their relations and properties are investigated. Conditions for a weak closure operation to be of t-type are provided. Given a weak closure operation, conditions for the new weak closure operation to be of t-type and to be a naive (sheer, feeble tender) weak closure operation are considered. We show that the new weak closure operation is the smallest tender weak closure operation containing the given weak closure operation.
Keywords: (strong) quasi prime mapping, t-type weak closure operation, naive (sheer, tender, feeble tender) weak closure operation.
Published in RUNG: 02.12.2019; Views: 3804; Downloads: 0
This document has many files! More...

4.
Semi-prime and meet weak closure operations in lower BCK-semilattices
Hashem Bordbar, Mohammad Mehdi Zahedi, 2017, original scientific article

Abstract: The notion of semi-prime (resp., meet) weak closure operation is introduced and related properties are investigated. Characterizations of a semi-prime (resp. meet) closure operation are discussed. Examples show that the notion of semi-prime weak closure operation is independent of the notion of meeting weak closure operation.
Keywords: non-zeromeet element, meet ideal, relative annihilator, semi-prime (resp., meet) weak closure operation.
Published in RUNG: 02.12.2019; Views: 3587; Downloads: 0
This document has many files! More...

5.
Tender and naive weak closure operations on lower BCK-semilattices.
Hashem Bordbar, 2018, original scientific article

Abstract: The notion of tender and naive weak closure operation is introduced, and their relations and properties are investigated. Using a weak closure operation "d" and an ideal A of a lower BCK-semilattice X with the greatest element 1, a new ideal K of X containing the ideal Acl of X is established. Using this ideal K, a new function clt : I(X) → I(X); A → K is given, and related properties are considered. We show that if "cl" is a tender (resp., naive) weak closure operation on I(X), then so are "clt" and clf.
Keywords: zeromeet element, meet ideal, relative annihilator, (finite type, tender, naive) weak closure operation.
Published in RUNG: 02.12.2019; Views: 3643; Downloads: 0
This document has many files! More...

6.
Weak closure operations on ideals of BCK-algebras
Hashem Bordbar, 2017, original scientific article

Abstract: Weak closure operation, which is more general form than closure operation, on ideals of BCK- algebras is introduced, and related properties are investigated. Regarding weak closure operation, finite type and (strong) quasi-primeness are considered. Also positive implicative (resp., commutative and implicative) weak closure operations are discussed.
Keywords: weak closure operation of finite type, (quasi-prime, positive implicative, commutative, implica- tive) weak closure operation.
Published in RUNG: 01.12.2019; Views: 3994; Downloads: 0
This document has many files! More...

7.
SEMI-PRIME CLOSURE OPERATIONS ON BCK-ALGEBRA
Hashem Bordbar, 2015, original scientific article

Abstract: In this paper we study the (good) semi-prime closure oper- ations on ideals of a BCK-algebra, lower BCK-semilattice, Noetherian BCK-algebra and meet quotient ideal and then we give several theorems that make different (good) semi-prime closure operations. Moreover, by giving some examples, we show that the given different notions are independent together, for instance, there is a semi-prime closure operation, which is not a good semi-prime. Finally by given the notion of “cf-Max X”, we prove that every member of “cf-Max X” is a prime ideal. Also, we conclude some more related results.
Keywords: BCI-algebra, BCK-algebra, closure operation, finite type closure operation, semi-prime closure operation.
Published in RUNG: 01.12.2019; Views: 3508; Downloads: 0
This document has many files! More...

8.
A Finite type Closure Operations on BCK-algebras
Hashem Bordbar, 2016, original scientific article

Abstract: In this article we study the (finite-type, cl-closed) closure operations on ideals of a BCK-algebra, with an emphasis on structural properties. Also we give several theorems that make different closure operations, especially on a quotient and Noetherian BCK-algebra. In particular, we show that the intersection and union (by imposing some additional conditions) of closure operations is a closure operation and every closure operation is a finite type on any finitely generated ideal. Moreover by given the notions of residuated quotient ideals and the meet of two ideals, we conclude some related results.
Keywords: BCI-algebra, BCK-algebra, closure operation, finite type closure operation.
Published in RUNG: 01.12.2019; Views: 3513; Downloads: 0
This document has many files! More...

Search done in 0.03 sec.
Back to top