scholarly journals On Single-Valued Neutrosophic Closure Spaces

Symmetry ◽  
2021 ◽  
Vol 13 (8) ◽  
pp. 1508
Author(s):  
Fahad Alsharari
Keyword(s):  
Closure Operator ◽  
Neutrosophic Set ◽  
Approximation Space ◽  
Closure Operators ◽  
Continuous Mappings ◽  
Closure Spaces ◽  
Boundary Sets ◽  
Interior Operator

This paper aims to mark out new terms of single-valued neutrosophic notions in a Šostak sense called single-valued neutrosophic semi-closure spaces. To achieve this, notions such as β£-closure operators and β£-interior operators are first defined. More precisely, these proposed contributions involve different terms of single-valued neutrosophic continuous mappings called single-valued neutrosophic (almost β£, faintly β£, weakly β£) and β£-continuous. Finally, for the purpose of symmetry, we define the single-valued neutrosophic upper, single-valued neutrosophic lower and single-valued neutrosophic boundary sets of a rough single-valued neutrosophic set αn in a single-valued neutrosophic approximation space (F˜,δ). Based on αn and δ, we also introduce the single-valued neutrosophic approximation interior operator intαnδ and the single-valued neutrosophic approximation closure operator Clαnδ.

scholarly journals Soft Continuous Mappings in Soft Closure Spaces

2021 ◽  
pp. 2676-2684
Author(s):  
S. T. Ekram ◽  
R. N. Majeed
Keyword(s):  
Closure Operators ◽  
Continuous Mappings ◽  
Closure Spaces

Soft closure spaces are a new structure that was introduced very recently. These new spaces are based on the notion of soft closure operators. This work aims to provide applications of soft closure operators. We introduce the concept of soft continuous mappings and soft closed (resp. open) mappings, support them with examples, and investigate some of their properties.

Fuzzy roughness via ideals

2020 ◽  
Vol 39 (5) ◽  
pp. 6869-6880
Author(s):  
S. H. Alsulami ◽  
Ismail Ibedou ◽  
S. E. Abbas
Keyword(s):  
Fuzzy Set ◽  
Closure Operator ◽  
Approximation Space ◽  
Approximation Spaces ◽  
Fuzzy Connectedness ◽  
Fuzzy Approximation ◽  
Separation Axioms ◽  
Fuzzy Ideal ◽  
Interior Operator

In this paper, we join the notion of fuzzy ideal to the notion of fuzzy approximation space to define the notion of fuzzy ideal approximation spaces. We introduce the fuzzy ideal approximation interior operator int Φ λ and the fuzzy ideal approximation closure operator cl Φ λ , and moreover, we define the fuzzy ideal approximation preinterior operator p int Φ λ and the fuzzy ideal approximation preclosure operator p cl Φ λ with respect to that fuzzy ideal defined on the fuzzy approximation space (X, R) associated with some fuzzy set λ ∈ IX. Also, we define fuzzy separation axioms, fuzzy connectedness and fuzzy compactness in fuzzy approximation spaces and in fuzzy ideal approximation spaces as well, and prove the implications in between.

scholarly journals On induced map f# in fuzzy set theory and its applications to fuzzy continuity

2021 ◽  
Author(s):  
Sandeep Kaur ◽  
Nitakshi Goyal
Keyword(s):  
Set Theory ◽  
Fuzzy Set ◽  
Fuzzy Set Theory ◽  
Closure Operator ◽  
Topological Spaces ◽  
Continuous Mappings ◽  
New Vision ◽  
Saturated Sets ◽  
Interior Operator ◽  
Fuzzy Topological Spaces

Abstract In this paper, we introduce # image of a fuzzy set which gives a induced map f # corresponding to any function f : X → Y , where X and Y are crisp sets. With this, we present a new vision of studying fuzzy continuous mappings in fuzzy topological spaces where fuzzy continuity explains the term of closeness in the mathematical models. We also define the concept of fuzzy saturated sets which helps us to prove some new characterizations of fuzzy continuous mappings in terms of interior operator rather than closure operator.

Digital Jordan Curves and Surfaces with Respect to a Closure Operator

2021 ◽  
Vol 179 (1) ◽  
pp. 59-74
Author(s):  
Josef Šlapal
Keyword(s):  
Direct Product ◽  
Jordan Curve ◽  
Closure Operator ◽  
Jordan Curve Theorem ◽  
Closure Operators ◽  
Ternary Relation ◽  
Digital Space ◽  
Jordan Curves ◽  
Curves And Surfaces ◽  
Digital Plane

In this paper, we propose new definitions of digital Jordan curves and digital Jordan surfaces. We start with introducing and studying closure operators on a given set that are associated with n-ary relations (n > 1 an integer) on this set. Discussed are in particular the closure operators associated with certain n-ary relations on the digital line ℤ. Of these relations, we focus on a ternary one equipping the digital plane ℤ2 and the digital space ℤ3 with the closure operator associated with the direct product of two and three, respectively, copies of this ternary relation. The connectedness provided by the closure operator is shown to be suitable for defining digital curves satisfying a digital Jordan curve theorem and digital surfaces satisfying a digital Jordan surface theorem.

scholarly journals The Prime Stems of Rooted Circuits of Closure Spaces and Minimum Implicational Bases

10.37236/3068 ◽  
2013 ◽  
Vol 20 (1) ◽  
Author(s):  
Masataka Nakamura ◽  
Kenji Kashiwabara
Keyword(s):  
Convex Geometry ◽  
Closure Operators ◽  
Optimal Basis ◽  
Closed Set ◽  
Closed Sets ◽  
Closure Systems ◽  
Closure Spaces ◽  
Convex Geometries ◽  
Necessary And Sufficient ◽  
Special Case

A rooted circuit is firstly introduced for convex geometries (antimatroids). We generalize it for closure systems or equivalently for closure operators. A rooted circuit is a specific type of a pair $(X,e)$ of a subset $X$, called a stem, and an element $e\not\in X$, called a root. We introduce a notion called a 'prime stem', which plays the key role in this article. Every prime stem is shown to be a pseudo-closed set of an implicational system. If the sizes of stems are all the same, the stems are all pseudo-closed sets, and they give rise to a canonical minimum implicational basis. For an affine convex geometry, the prime stems determine a canonical minimum basis, and furthermore  gives rise to an optimal basis. A 'critical rooted circuit' is a special case of a rooted circuit defined for an antimatroid. As a precedence structure, 'critical rooted circuits' are necessary and sufficient to fix an antimatroid whereas critical rooted circuits are not necessarily sufficient to restore the original antimatroid as an implicational system. It is shown through an example.

scholarly journals Path-set induced closure operators on graphs

Filomat ◽  
2016 ◽  
Vol 30 (3) ◽  
pp. 863-871 ◽  
Author(s):  
Josef Slapal
Keyword(s):  
Image Analysis ◽  
Digital Image ◽  
Digital Image Analysis ◽  
Closure Operator ◽  
Simple Graph ◽  
Digital Topology ◽  
Closure Operators ◽  
Vertex Set ◽  
Positive Length ◽  
Path Connectedness

Given a simple graph, we associate with every set of paths of the same positive length a closure operator on the (vertex set of the) graph. These closure operators are then studied. In particular, it is shown that the connectedness with respect to them is a certain kind of path connectedness. Closure operators associated with sets of paths in some graphs with the vertex set Z2 are discussed which include the well known Marcus-Wyse and Khalimsky topologies used in digital topology. This demonstrates possible applications of the closure operators investigated in digital image analysis.

scholarly journals Closure System and Its Semantics

Axioms ◽  
2021 ◽  
Vol 10 (3) ◽  
pp. 198
Author(s):  
Yinbin Lei ◽  
Jun Zhang
Keyword(s):  
Closure Operator ◽  
Spatial Relations ◽  
Accumulation Point ◽  
Boundary Operator ◽  
Topological Spaces ◽  
Closure System ◽  
Derived Set ◽  
Topological Closure ◽  
Interior Operator ◽  
Isolated Point

It is well known that topological spaces are axiomatically characterized by the topological closure operator satisfying the Kuratowski Closure Axioms. Equivalently, they can be axiomatized by other set operators encoding primitive semantics of topology, such as interior operator, exterior operator, boundary operator, or derived-set operator (or dually, co-derived-set operator). It is also known that a topological closure operator (and dually, a topological interior operator) can be weakened into generalized closure (interior) systems. What about boundary operator, exterior operator, and derived-set (and co-derived-set) operator in the weakened systems? Our paper completely answers this question by showing that the above six set operators can all be weakened (from their topological counterparts) in an appropriate way such that their inter-relationships remain essentially the same as in topological systems. Moreover, we show that the semantics of an interior point, an exterior point, a boundary point, an accumulation point, a co-accumulation point, an isolated point, a repelling point, etc. with respect to a given set, can be extended to an arbitrary subset system simply by treating the subset system as a base of a generalized interior system (and hence its dual, a generalized closure system). This allows us to extend topological semantics, namely the characterization of points with respect to an arbitrary set, in terms of both its spatial relations (interior, exterior, or boundary) and its dynamic convergence of any sequence (accumulation, co-accumulation, and isolation), to much weakened systems and hence with wider applicability. Examples from the theory of matroid and of Knowledge/Learning Spaces are used as an illustration.

Generalized Fuzzy Closed Sets in Smooth Bitopological Spaces

2016 ◽  
pp. 419-456
Author(s):  
Osama A. El-Tantawy ◽  
Sobhy A. El-Sheikh ◽  
Rasha N. Majeed
Keyword(s):  
Closure Operator ◽  
Closure Operators ◽  
Closed Sets ◽  
Different Types ◽  
Definition Of ◽  
Bitopological Spaces

This chapter is devoted to the study of r-generalized fuzzy closed sets (briefly, gfc sets) in smooth bitopological spaces (briefly, smooth bts) in view definition of Šostak (1985). The chapter is divided into seven sections. The aim of Sections 1-2 is to introduce the fundamental concepts related to the work. In Section 3, the concept of r-(ti,tj)-gfc sets in the smooth bts's is introduce and investigate some notions of these sets, generalized fuzzy closure operator induced from these sets. In Section 4, (i,j)-GF-continuous (respectively, irresolute) mappings are introduced. In Section 5, the supra smooth topology which generated from a smooth bts is used to introduce and study the notion of r-t12-gfc sets for smooth bts's and supra generalized fuzzy closure operator . The present notion of gfc sets and the notion which introduced in section 3, are independent. In Section 6, two types of generalized supra fuzzy closure operators introduced by using two different approaches. Finally, Section 7 introduces and studies different types of fuzzy continuity which are related to closure.

The classification of small types of rank ω, Part I

2001 ◽  
Vol 66 (4) ◽  
pp. 1884-1898
Author(s):  
Steven Buechler ◽  
Colleen Hoover
Keyword(s):  
Stability Theory ◽  
Closure Operator ◽  
Algebraic Closure ◽  
Countable Model ◽  
Closure Operators ◽  
Basic Concepts ◽  
Countable Models

Abstract.Certain basic concepts of geometrical stability theory are generalized to a class of closure operators containing algebraic closure. A specific case of a generalized closure operator is developed which is relevant to Vaught's conjecture. As an application of the methods, we proveTheorem A. Let G be a superstate group of U-rank ω such that the generics of G are locally modular and Th(G) has few countable models. Let G− be the group of nongeneric elements of G. G+ = Go + G−. Let Π = {q ∈ S(∅): U(q) < ω}. For any countable model M of Th(G) there is a finite A ⊂ M such thai M is almost atomic over A ∪ (G+ ∩ M) ∪ ⋃p∈Πp(M).

The least extension of a closure operator on a sublattice

1967 ◽  
Vol 63 (1) ◽  
pp. 9-10 ◽  
Author(s):  
Roy O. Davies
Keyword(s):  
Complete Lattice ◽  
Closure Operator ◽  
Partial Ordering ◽  
Closure Operators ◽  
Image Position

Introduction. We recall (see Morgan Ward (3), Birkhoff (1), p. 49) that a closure operator on a complete lattice ℒ is a mapping f from ℒ into ℒ satisfying the conditionsfor all X, Y ∈ ℒ. The set of all closure operators on ℒ is itself a complete lattice with respect to the partial ordering in which f1 ≤ f2 if and only if f1(X) ≥ f2(X) for all X ∈ ℒ for every subset ℱ of and every element X ∈ ℒ we have.

Sign in / Sign up

Export Citation Format

Share Document