2017
DOI: 10.22342/jims.22.2.233.131-150
|View full text |Cite
|
Sign up to set email alerts
|

Foundations of Ordered (Semi)hyperrings

Abstract: Abstract. In the present paper, we introduce the notion of (semi)hyperring (R, +, ·) together with a suitable partial order ≤. This structure is called an ordered (semi)hyperring. Also, we present several examples of ordered (semi)hyperrings and prove some results in this respect. By using the notion of pseudo order on an ordered (semi)hyperring (R, +, ·, ≤), we obtain an ordered (semi)ring. Finally, we study some properties of pseudoorder on an ordered (semi)hyperring.Key words and Phrases: Algebraic hyper… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(3 citation statements)
references
References 15 publications
(18 reference statements)
0
3
0
Order By: Relevance
“…By routine calculations, H is a hyper BN -algebra. Define a relation θ on H by θ = {(0, 0), (0, 2), (1,1), (1,3), (2, 0), (2,2), (3,1), (3,3), (4,4)}. By inspection, θ is an equivalence relation on H. Now, observe that 1θ3 and 2θ0 but 1 ⊛ 2 = {2}̸ θ{3} = 3 ⊛ 0 because (2, 3) / ∈ θ.…”
Section: Discussionmentioning
confidence: 99%
See 2 more Smart Citations
“…By routine calculations, H is a hyper BN -algebra. Define a relation θ on H by θ = {(0, 0), (0, 2), (1,1), (1,3), (2, 0), (2,2), (3,1), (3,3), (4,4)}. By inspection, θ is an equivalence relation on H. Now, observe that 1θ3 and 2θ0 but 1 ⊛ 2 = {2}̸ θ{3} = 3 ⊛ 0 because (2, 3) / ∈ θ.…”
Section: Discussionmentioning
confidence: 99%
“…Example 27. If we consider θ = {(0, 0), (0, 1), (1, 0), (1, 1), (2, 2), (2,3), (2,4), (3,2), (3,3), (3,4), (4,2), (4,3), (4,4)…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation