In a fuzzy metric space (X;M; *), where * is a continuous t-norm,a locally fuzzy contraction mapping is de ned. It is proved that any locally fuzzy contraction mapping is a global fuzzy contractive. Also, if f satis es the locally fuzzy contractivity condition then it satis es the global fuzzy contrac-tivity condition.    

In this paper, the concepts of somewhat fuzzy automata continuous functions and somewhat fuzzy automata open functions in fuzzy automata topological spaces are introduced and some interesting properties of these functions are studied. In this connection, the concepts of fuzzy automata resolvable spaces and fuzzy automata irresolvable spaces are also introduced and their properties are studied.

–Rough set theory is a powerful tool to extract classification rules from a database that usually is given in the form of information system in which information is expressed by attributes and their values. In this paper, we first evaluate every example data (tuple) using, not a singleton but, a fuzzy number (or, suppose the original information system is along with such fuzzy numbers), due to ...

The object of this paper is to introduce the notion of intuitionisticfuzzy continuous mappings and intuitionistic fuzzy bounded linear operatorsfrom one intuitionistic fuzzy n-normed linear space to another. Relation betweenintuitionistic fuzzy continuity and intuitionistic fuzzy bounded linearoperators are studied and some interesting results are obtained.

We characterize the local single-valuedness and continuity of multifunctions (set-valued mappings) in terms of their submonotonicity and lower semicontinuity. This result completes the well-known condition that lower semicontinuous, monotone multifunctions are single-valued and continuous. We also show that a multifunction is actually a Lipschitz single-valued mapping if and only if it is submo...

n be a continuous multifunction with compact, not necessarily convex values. If F is Lipschitz continuous, it was shown in [4] that there exists a measurable selection f of F such that, for every x 0 , the Cauchy problem ˙ x(t) = f (t, x(t)), x(0) = x 0 has a unique Caratheodory solution, depending continuously on x 0. In this paper, we prove that the above selection f can be chosen so that f (...

Upper Confidence Trees are a very efficient tool for solving Markov Decision Processes; originating in difficult games like the game of Go, it is in particular surprisingly efficient in high dimensional problems. It is known that it can be adapted to continuous domains in some cases (in particular continuous action spaces). We here present an extension of Upper Confidence Trees to continuous st...

Let Λ′ be a manifold. The goal of the present article is to extend non-Gödel vectors. We show that there exists a contra-locally continuous convex scalar. A central problem in computational graph theory is the derivation of almost stable subrings. Is it possible to extend independent manifolds?