scholarly journals On rough sets induced by fuzzy relations approach in semigroups

2018 ◽  
Vol 16 (1) ◽  
pp. 1634-1650
Author(s):  
Rukchart Prasertpong ◽  
Manoj Siripitukdet
Keyword(s):  
Prime Ideal ◽  
Rough Set ◽  
Rough Sets ◽  
Sufficient Conditions ◽  
Unit Interval ◽  
Fuzzy Relation ◽  
Prime Ideals ◽  
Fuzzy Relations ◽  
Completely Prime Ideal

AbstractIn this paper, we introduce a rough set in a universal set based on cores of successor classes with respect to level in a closed unit interval under a fuzzy relation, and some interesting properties are investigated. Based on this point, we propose a rough completely prime ideal in a semigroup structure under a compatible preorder fuzzy relation, including the rough semigroup and rough ideal. Then we provide sufficient conditions for them. Finally, the relationships between rough completely prime ideals (rough semigroups and rough ideals) and their homomorphic images are verified.

On the Prime Ideals in a Commutative Ring

2000 ◽  
Vol 43 (3) ◽  
pp. 312-319 ◽  
Author(s):  
David E. Dobbs
Keyword(s):  
Prime Ideal ◽  
Commutative Ring ◽  
Polynomial Ring ◽  
Sufficient Conditions ◽  
Prime Ideals ◽  
Preceding Result ◽  
Finite Commutative Ring ◽  
The Axiom Of Choice ◽  
Necessary And Sufficient ◽  
Positive Integers

AbstractIf n and m are positive integers, necessary and sufficient conditions are given for the existence of a finite commutative ring R with exactly n elements and exactly m prime ideals. Next, assuming the Axiom of Choice, it is proved that if R is a commutative ring and T is a commutative R-algebra which is generated by a set I, then each chain of prime ideals of T lying over the same prime ideal of R has at most 2|I| elements. A polynomial ring example shows that the preceding result is best-possible.

scholarly journals Ideals on neutrosophic extended triplet groups

2021 ◽  
Vol 7 (3) ◽  
pp. 4767-4777
Author(s):  
Xin Zhou ◽  
◽  
Xiao Long Xin ◽  
Keyword(s):  
Prime Ideal ◽  
Distributive Lattice ◽  
Topological Structure ◽  
Hausdorff Space ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Prime Ideals ◽  
Ideal Space ◽  
Necessary And Sufficient

<abstract><p>In this paper, we introduce the concept of (prime) ideals on neutrosophic extended triplet groups (NETGs) and investigate some related properties of them. Firstly, we give characterizations of ideals generated by some subsets, which lead to a construction of a NETG by endowing the set consisting of all ideals with a special multiplication. In addition, we show that the set consisting of all ideals is a distributive lattice. Finally, by introducing the topological structure on the set of all prime ideals on NETGs, we obtain the necessary and sufficient conditions for the prime ideal space to become a $ T_{1} $-space and a Hausdorff space. </p></abstract>

scholarly journals Rough sets in graphs using similarity relations

2022 ◽  
Vol 7 (4) ◽  
pp. 5790-5807
Author(s):  
Imran Javaid ◽  
◽  
Shahroz Ali ◽  
Shahid Ur Rehman ◽  
Aqsa Shah
Keyword(s):  
Rough Set ◽  
Rough Sets ◽  
Sufficient Conditions ◽  
Membership Functions ◽  
Similarity Relations ◽  
Complete Bipartite Graphs ◽  
Essential Set ◽  
Essential Sets ◽  
Necessary And Sufficient ◽  
Clustering Criterion

<abstract><p>In this paper, we investigate the theory of rough set to study graphs using the concept of orbits. Rough sets are based on a clustering criterion and we use the idea of similarity of vertices under automorphism as a criterion. We introduce indiscernibility relation in terms of orbits and prove necessary and sufficient conditions under which the indiscernibility partitions remain the same when associated with different attribute sets. We show that automorphisms of the graph $ \mathcal{G} $ preserve the indiscernibility partitions. Further, we prove that for any graph $ \mathcal{G} $ with $ k $ orbits, any reduct $ \mathcal{R} $ consists of one element from $ k-1 $ orbits of the graph. We also study the rough membership functions for paths, cycles, complete and complete bipartite graphs. Moreover, we introduce essential sets and discernibility matrices induced by orbits of graphs and study their relationship. We also prove that every essential set consists of union of any two orbits of the graph.</p></abstract>

scholarly journals Picture Fuzzy Rough Set and Rough Picture Fuzzy Set on Two Different Universes and Their Applications

2020 ◽  
Vol 2020 ◽  
pp. 1-17
Author(s):  
Dliouah Ahmed ◽  
Binxiang Dai
Keyword(s):  
Rough Set ◽  
Rough Sets ◽  
Fuzzy Relation ◽  
Type I ◽  
Type Ii ◽  
Fuzzy Rough Set ◽  
Fuzzy Approximation ◽  
Picture Fuzzy Set ◽  
Decision Making Problem ◽  
Picture Fuzzy Sets

The major concern of this article is to propose the notion of picture fuzzy rough sets (PFRSs) over two different universes which depend on δ , ζ , ϑ -cut of picture fuzzy relation ℛ on two different universes (i.e., by combining picture fuzzy sets (PFSs) with rough sets (RSs)). Then, we discuss several interesting properties and related results on the PFRSs. Furthermore, we define some notions related to PFRSs such as (Type-I/Type-II) graded PFRSs, the degree α and β with respect to ℛ δ , ζ , ϑ on PFRSs, and (Type-I/Type-II) generalized PFRSs based on the degree α and β with respect to ℛ δ , ζ , ϑ and investigate the basic properties of above notions. Finally, an approach based on the rough picture fuzzy approximation operators on two different universes in decision-making problem is introduced, and we give an example to show the validity of this approach.

On Simplified Axiomatic Characterizations of (υ σ)-Fuzzy Rough Approximation Operators

2017 ◽  
Vol 25 (03) ◽  
pp. 457-476 ◽  
Author(s):  
Hongying Zhang ◽  
Haijuan Song
Keyword(s):  
Rough Sets ◽  
Axiomatic Approach ◽  
Fuzzy Relation ◽  
Fuzzy Relations ◽  
Constructive Approach ◽  
Axiomatic Characterizations ◽  
Approximation Operators ◽  
Rough Approximation ◽  
Potential Applications ◽  
Two Universes

The axiomatic approach is more appropriate than constructive approach for studying the algebraic structure of rough sets. In this paper, the more simple axiomatic characterizations of (υ σ)-fuzzy rough approximation operators are explored where υ is a residuated implicator and σis its dual implicator. Firstly, we review the existing independent axiomatic sets to characterize various types of υ-lower and σ-upper fuzzy rough approximation operators. Secondly, we present one-axiom characterizations of (υ σ)-fuzzy rough approximation operators constructed by a serial fuzzy relation on two universes. Furthermore, we show that (υ σ)-fuzzy rough approximation operators, corresponding to reexive, symmetric and T-transitive fuzzy relations, can be presented by only two axioms respectively. We conclude the paper by introducing some potential applications and future works.

scholarly journals Multi-Granulation Picture Hesitant Fuzzy Rough Sets

Symmetry ◽  
2020 ◽  
Vol 12 (3) ◽  
pp. 362 ◽  
Author(s):  
Bibin Mathew ◽  
Sunil Jacob John ◽  
José Carlos R. Alcantud
Keyword(s):  
Rough Set ◽  
Rough Sets ◽  
Fuzzy Relations ◽  
Fuzzy Rough Sets ◽  
Fuzzy Rough Set ◽  
Standard Format ◽  
Two Universes ◽  
Novel Model ◽  
Theoretical Foundations

We lay the theoretical foundations of a novel model, termed picture hesitant fuzzy rough sets, based on picture hesitant fuzzy relations. We also combine this notion with the ideas of multi-granulation rough sets. As a consequence, a new multi-granulation rough set model on two universes, termed a multi-granulation picture hesitant fuzzy rough set, is developed. When the universes coincide or play a symmetric role, the concept assumes the standard format. In this context, we put forward two new classes of multi-granulation picture hesitant fuzzy rough sets, namely, the optimistic and pessimistic multi-granulation picture hesitant fuzzy rough sets. Further, we also investigate the relationships among these two concepts and picture hesitant fuzzy rough sets.

A NOTE ON COMPLETELY PRIME IDEALS OF ORE EXTENSIONS

2010 ◽  
Vol 20 (03) ◽  
pp. 457-463 ◽  
Author(s):  
V. K. BHAT
Keyword(s):  
Prime Ideal ◽  
Prime Ideals ◽  
Recent Past ◽  
Associated Prime Ideals ◽  
Ore Extensions ◽  
Active Research ◽  
Considerable Work ◽  
Minimal Prime ◽  
Associated Prime ◽  
Completely Prime Ideal

The study of prime ideals has been an area of active research. In recent past a considerable work has been done in this direction. Associated prime ideals and minimal prime ideals of certain types of Ore extensions have been characterized. In this paper a relation between completely prime ideals of a ring R and those of R[x; σ, δ] has been given; σ is an automorphisms of R and δ is a σ-derivation of R. It has been proved that if P is a completely prime ideal of R such that σ(P) = P and δ(P) ⊆ P, then P[x; σ, δ] is a completely prime ideal of R[x; σ, δ]. It has also been proved that this type of relation does not hold for strongly prime ideals.

DECOMPOSITION OF MULTIUNIVERSE FUZZY TRUTH FUNCTIONS

2001 ◽  
Vol 09 (05) ◽  
pp. 623-643
Author(s):  
DERYA ALTUNAY ◽  
TURHAN ÇİFTÇİBAŞI
Keyword(s):  
Propositional Logic ◽  
Sufficient Conditions ◽  
Fuzzy Relation ◽  
Necessary And Sufficient Conditions ◽  
Fuzzy Relations ◽  
Decomposition Problem ◽  
The Common ◽  
Necessary And Sufficient ◽  
The Given

This paper focuses on the decomposition problem of fuzzy relations using the concepts of multiuniverse fuzzy propositional logic. Given two fuzzy propositions in different universes, it is always possible to construct a fuzzy relation in the common universe through a prescribed combination. However, the converse is not so obvious, if possible at all. In other words, given a fuzzy relation, how would we know if it really represents a certain relationship between some fuzzy propositions? It is important to recognize whether the given fuzzy relation is a meaningful representation of information according to certain criteria applicable to some fuzzy propositions that constitute the fuzzy relation itself. Two basic structures of decomposition are investigated. Necessary and sufficient conditions for decomposition of multiuniverse fuzzy truth functions in terms of one-universe truth functions are presented. An algorithm for decomposition is proposed.

scholarly journals On Fuzzy Rough Sets and Their Topological Structures

2014 ◽  
Vol 2014 ◽  
pp. 1-17 ◽  
Author(s):  
Weidong Tang ◽  
Jinzhao Wu ◽  
Dingwei Zheng
Keyword(s):  
Set Theory ◽  
Rough Set ◽  
Rough Sets ◽  
Rough Set Theory ◽  
Fuzzy Relations ◽  
Fuzzy Rough Sets ◽  
Approximation Spaces ◽  
Topological Structures ◽  
Fuzzy Approximation ◽  
Approximation Operators

The core concepts of rough set theory are information systems and approximation operators of approximation spaces. Approximation operators draw close links between rough set theory and topology. This paper is devoted to the discussion of fuzzy rough sets and their topological structures. Fuzzy rough approximations are further investigated. Fuzzy relations are researched by means of topology or lower and upper sets. Topological structures of fuzzy approximation spaces are given by means of pseudoconstant fuzzy relations. Fuzzy topology satisfying (CC) axiom is investigated. The fact that there exists a one-to-one correspondence between the set of all preorder fuzzy relations and the set of all fuzzy topologies satisfying (CC) axiom is proved, the concept of fuzzy approximating spaces is introduced, and decision conditions that a fuzzy topological space is a fuzzy approximating space are obtained, which illustrates that we can research fuzzy relations or fuzzy approximation spaces by means of topology and vice versa. Moreover, fuzzy pseudoclosure operators are examined.

Rough Approximations on Hesitant Fuzzy Sets

2016 ◽  
pp. 265-279
Author(s):  
D. Deepak ◽  
Sunil Jacob John
Keyword(s):  
Rough Set ◽  
Rough Sets ◽  
Fuzzy Relation ◽  
Equivalence Relations ◽  
Hesitant Fuzzy Set ◽  
Fuzzy Rough Sets ◽  
Fuzzy Rough Set ◽  
Dual Nature ◽  
Fuzzy Environment ◽  
Lower And Upper Approximations

Introduction of hesitant fuzzy rough sets would facilitate the use of rough set based techniques to hesitant fuzzy environment. Hesitant fuzzy rough sets deal with the lower and upper approximations in a hesitant fuzzy domain. For this purpose concepts of hesitant fuzzy relations are discussed first to create a theoretical framework to study hesitant fuzzy rough sets. The concepts of equivalence relations are discussed. Hesitant fuzzy rough sets and the properties of the approximations are discussed. The dual nature of the lower and upper approximations is proved. This chapter introduces the model of a hesitant fuzzy rough set which approximates a hesitant fuzzy set using a hesitant fuzzy relation.

Sign in / Sign up

Export Citation Format

Share Document