In this paper, we prove a common fixed point theorem for hybrid pairs of set and single valued mappings without assuming compatibility and continuity of any mapping on noncomplete metric spaces. To prove the theorem, we use a noncompatible condition, that is, weak commutativity of type (KB). We show that completeness of the whole space is not necessary for the existence of common fixed point. O...

We define sequential completeness for ⊤-quasi-uniform spaces using Cauchy pair ⊤-sequences. show that implies and ⊤-uniform with countable bases, are equivalent. As an illustration of the applicability concept, we give a fixed point theorem certain contractive self-mappings in space. This result yields, as special case, probabilistic metric spaces.

The purpose of this paper is to study common fixed point theorems for six (four single-valued and two set-valued) mappings in fuzzy metric spaces. without assuming compatibility and continuity of any mapping on non complete metric spaces. To prove the theorem, we use a non compatible condition, that is, weak commutativity of type (Kh)in fuzzy metric spaces. We show that completeness of the whol...

We prove two generalizations of results appearing in [4] involving metrical completeness and R–buildings. Firstly, we give a generalization of the Bruhat–Tits fixed point theorem also valid for non-complete R–buildings, but with the added condition that the group is finitely generated. Secondly, we generalize a criterion which reduces the problem of completeness to the wall trees of the R–build...

* Correspondence: [email protected] Department of Mathematics and Humanities, S.V. National Institute of Technology, Surat, Gujarat, India Full list of author information is available at the end of the article Abstract In this article, we point out that some recent results proved in Babu and Alemayehu are corollaries of the main result of an article due to Ali and Imdad. However, combinin...

Abstract An algebraic proof is presented for the finite strong standard completeness of Involutive Uninorm Logic with Fixed Point ( $${{\mathbf {IUL}}^{fp}}$$ IUL fp ). It may provide a first step towards settling problem $${\mathbf {IUL}}$$ , pos...

Let P be a non empty poset. Observe that there exists a chain of P which is non empty. Let I1 be a relational structure. We say that I1 is chain-complete if and only if: (Def. 1) I1 is lower-bounded and for every chain L of I1 such that L is non empty holds sup L exists in I1. One can prove the following proposition (1) Let P1, P2 be non empty posets, K be a non empty chain of P1, and h be a mo...