In this paper we recall, improve, and extend several definitions, properties and applications of our previous 2019 research referred to NeutroAlgebras and AntiAlgebras (also called NeutroAlgebraic Structures and respectively AntiAlgebraic Structures). Let <A> be an item (concept, attribute, idea, proposition, theory, etc.). Through the process of neutrosphication, we split the nonempty space we work on into three regions {two opposite ones corresponding to <A> and <antiA>, and one corresponding to neutral (indeterminate) <neutA> (also denoted <neutroA>) between the opposites}, which may (...) or may not be disjoint – depending on the application, but they are exhaustive (their union equals the whole space). A NeutroAlgebra is an algebra which has at least one NeutroOperation or one NeutroAxiom (axiom that is true for some elements, indeterminate for other elements, and false for the other elements). A Partial Algebra is an algebra that has at least one Partial Operation, and all its Axioms are classical (i.e. axioms true for all elements). Through a theorem we prove that NeutroAlgebra is a generalization of Partial Algebra, and we give examples of NeutroAlgebras that are not Partial Algebras. We also introduce the NeutroFunction (and NeutroOperation). (shrink)

The purpose of this paper is to introduce and study the characteristic function of a neutrosophic set. After given the fundamental definitions of neutrosophic set operations generated by the characteristic function of a neutrosophic set ( Ng for short), we obtain several properties, and discussed the relationship between neutrosophic sets generated by Ng and others. Finally, we introduce the neutrosophic topological spaces generated by Ng . Possible application to GIS topology rules are touched upon.

In this paper, we introduce the concept of ""neutrosophic crisp neighborhoods system for the neutrosophic crisp point ". Added to, we introduce and study the concept of neutrosophic crisp local function, and construct a new type of neutrosophic crisp topological space via neutrosophic crisp ideals. Possible application to GIS topology rules are touched upon.

In this paper, we generalize the crisp topological spaces to the notion of neutrosophic crisp topological space, and we construct the basic concepts of the neutrosophic crisp topology.

In this paper, we introduce and study the concept of" neutrosophic closed set" and" neutrosophic continuous function". Possible application to GIS topology rules are touched upon.

The neutrosophic sets were known since 1999, and because of their wide applications and their great flexibility to solve the problems, we used these the concepts to define a new types of neutrosophic crisp closed sets and limit points in neutrosophic crisp topological space, namly [neutrosophic crisp Gem sets and neutrosophic crisp Turig points] respactvely, we stady their properties in details and join it with topological concepts. Finally we used [neutrosophic crisp Gem sets and neutrosophic crisp Turig points] to introduce (...) of topological concepts as: neutrosophic crisp closed (open) sets, neutrosophic crisp closure, neutrosophic crisp interior, neutrosophic crisp extrior and neutrosophic crisp boundary which are fundamental for further reserch on neutrosophic crisp topology and will setrengthen the foundations of theory of neutrosophic topological spaces. (shrink)

The Fifth International Scientific Conference of the Faculty of Nursing, Port Said University 2019 Neutrosophic Information Systems and Nursing Scientific Research.

This paper is specialized with fuzzy random multi-objective unbalanced transportation data problems by using of fuzzy programming technique when the sources and destination parameters are fuzzy random variables in inequality type of constraints. In this paper, we focus on the solution procedure of the specified transportation data problems where the objective functions are minimization type and supplies and demands are replaced by the fuzzy random variables. We first convert the fuzzy random multi-objective unbalanced transportation problem into deterministic problem by using (...) fuzzy random chance constraints approach. By introducing the concept of linear membership function of fuzzy programming, multi-objective deterministic transportation problem is converted into single objective deterministic problem and then we solve it and we obtain the optimal compromise solution. Lastly a numerical example is provided for illustration the methodology. (shrink)