scholarly journals Applications of soft intersection sets to hemirings via SI-h-bi-ideals and SI-h-quasi-ideals

Filomat ◽  
2016 ◽  
Vol 30 (8) ◽  
pp. 2295-2313
Author(s):  
Xueling Ma ◽  
Jianming Zhan ◽  
Bijan Davvaz

The aim of this paper is to lay a foundation for providing a soft algebraic tool in considering many problems that contains uncertainties. In order to provide these soft algebraic structures, we introduce the concepts of SI-h-bi-ideals and SI-h-quasi-ideals of hemirings. The relationships between these kinds of soft intersection h-ideals are established. Finally, some characterizations of h-hemiregular, h-intra-hemiregular and h-quasi-hemiregular hemirings are investigated by these kinds of soft intersection h-ideals.

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Xueling Ma ◽  
Hee Sik Kim

The purpose of this paper is to give a foundation for providing a new soft algebraic tool in considering many problems containing uncertainties. In order to provide these new soft algebraic structures, we discuss a new soft set-(M, N)-soft intersection set, which is a generalization of soft intersection sets. We introduce the concepts of (M, N)-SI filters of BL-algebras and establish some characterizations. Especially, (M, N)-soft congruences in BL-algebras are concerned.


2013 ◽  
Vol 2013 ◽  
pp. 1-9
Author(s):  
Yongwei Yang ◽  
Xiaolong Xin ◽  
Pengfei He

The aim of the paper is to lay a foundation for providing a soft algebraic tool in considering many problems that contain uncertainties. In order to provide these soft algebraic structures, the notion ofλ,μ-soft union rings which is a generalization of that of soft union rings is proposed. By introducing the notion of soft cosets, soft quotient rings based onλ,μ-soft union ideals are established. Moreover, through discussing quotient soft subsets, an approach for constructing quotient soft union rings is made. Finally, isomorphism theorems ofλ,μ-soft union rings related to invariant soft sets are discussed.


2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Eun Hwan Roh ◽  
Young Bae Jun

The aim of this paper is to lay a foundation for providing a soft algebraic tool in considering many problems that contain uncertainties. In order to provide these soft algebraic structures, the notion of int-soft positive implicative ideals is introduced, and related properties are investigated. Relations between an int-soft ideal and an int-soft positive implicative ideal are established. Characterizations of an int-soft positive implicative ideal are obtained. Extension property for an int-soft positive implicative ideal is constructed. The∧-product and∨-product of int-soft positive implicative ideals are considered, and the soft intersection (resp., union) of int-soft positive implicative ideals is discussed.


2012 ◽  
Vol 2012 ◽  
pp. 1-15 ◽  
Author(s):  
Young Bae Jun ◽  
Kyoung Ja Lee ◽  
Eun Hwan Roh

The aim of this paper is to lay a foundation for providing a soft algebraic tool in considering many problems that contain uncertainties. In order to provide these soft algebraic structures, the notions of closed intersectional soft -ideals and intersectional soft commutative -ideals are introduced, and related properties are investigated. Conditions for an intersectional soft -ideal to be closed are provided. Characterizations of an intersectional soft commutative -ideal are established, and a new intersectional soft c--ideal from an old one is constructed.


1987 ◽  
Vol 10 (4) ◽  
pp. 387-413
Author(s):  
Irène Guessarian

This paper recalls some fixpoint theorems in ordered algebraic structures and surveys some ways in which these theorems are applied in computer science. We describe via examples three main types of applications: in semantics and proof theory, in logic programming and in deductive data bases.


2021 ◽  
Vol 9 (1) ◽  
pp. 257-274
Author(s):  
Louis Deaett ◽  
Colin Garnett

Abstract Given a square matrix A, replacing each of its nonzero entries with the symbol * gives its zero-nonzero pattern. Such a pattern is said to be spectrally arbitrary when it carries essentially no information about the eigenvalues of A. A longstanding open question concerns the smallest possible number of nonzero entries in an n × n spectrally arbitrary pattern. The Generalized 2n Conjecture states that, for a pattern that meets an appropriate irreducibility condition, this number is 2n. An example of Shitov shows that this irreducibility is essential; following his technique, we construct a smaller such example. We then develop an appropriate algebraic condition and apply it computationally to show that, for n ≤ 7, the conjecture does hold for ℝ, and that there are essentially only two possible counterexamples over ℂ. Examining these two patterns, we highlight the problem of determining whether or not either is in fact spectrally arbitrary over ℂ. A general method for making this determination for a pattern remains a major goal; we introduce an algebraic tool that may be helpful.


Sign in / Sign up

Export Citation Format

Share Document