In this paper, we prove a common fixed point theorem for semi-compatible and weakly compatible mappings in Fuzzy metric space using the property (E.A.) and implicit relation. Our result generalizes the result of Singh and Jain [14].

The aim of this paper is to present a common fixed point theorem in a metric space which extends the result of P.C.Lohani & V.H.Bhadshah using the weaker conditions such as Reciprocally continuous, Compatible mappings, Weakly compatible and Associated sequence.

The objects of study of mathematics are often sets with some additional information. E. g. for a group the additional information is the binary operation, for a topological space the family of open sets, for a graph the set of its edges. Equivalences and mutual relations between objects are studied by means of a special class of mappings which is chosen according to the pourpose of the study. T...

 The main purpose of this paper is to study the existence of afixed point in locally convex topology generated by fuzzy n-normed spaces.We prove our main results, a fixed point theorem for a self mapping and acommon xed point theorem for a pair of weakly compatible mappings inlocally convex topology generated by fuzzy n-normed spaces. Also we givesome remarks in locally convex topology generate...

In this paper, we investigate a principled approach for defining and discovering probabilistic mappings between two taxonomies. First, we compare two ways of modeling probabilistic mappings which are compatible with the logical constraints declared in each taxonomy. Then we describe a generate and test algorithm (called ProbaMap) which minimizes the number of calls to the probability estimator ...

In this paper, we investigate a principled approach for defining and discovering probabilistic mappings between two taxonomies. First, we compare two ways of modeling probabilistic mappings which are compatible with the logical constraints declared in each taxonomy. Then we describe a generate and test algorithm which minimizes the number of calls to the probability estimator for determining th...

A common xed theorem is proved for two pairs of compatible mappings on a normed vector space.

In this paper, we investigate a principled approach for defining and discovering probabilistic mappings between two taxonomies. First, we compare two ways of modeling probabilistic mappings which are compatible with the logical constraints declared in each taxonomy. Then we describe a generate and test algorithm which minimizes the number of calls to the probability estimator for determining th...