in this paper, we firstly show that the $n$-dual operation of the right residual implication, which is induced by a left-conjunctive right arbitrary $vee$-distributive left semi-uninorm, is the right residual coimplication induced by its $n$-dual operation. as a dual result, the $n$-dual operation of the right residual coimplication, which is induced by a left-disjunctive right arbitrary $wedge...

In this paper, we give some results on the common fixed point of self-mappings defined on complete $b$-metric spaces. Our results generalize Kannan and Chatterjea fixed point theorems on complete $b$-metric spaces. In particular, we show that two self-mappings satisfying a contraction type inequality have a unique common fixed point. We also give some examples to illustrate the given results.

In this paper, we firstly show that the $N$-dual operation of the right residual implication, which is induced by a left-conjunctive right arbitrary $vee$-distributive left semi-uninorm, is the right residual coimplication induced by its $N$-dual operation. As a dual result, the $N$-dual operation of the right residual coimplication, which is induced by a left-disjunctive right arbitrary $wedge...

Riemannian first-passage percolation (FPP) is a continuum analogue of standard FPP on the lattice, where the discrete passage times of standard FPP are replaced by a random Riemannian metric. We prove a shape theorem for this model— that balls in this metric grow linearly in time—and from this conclude that the metric is complete.

In this paper, we define the concept of compatible and weakly compatible mappings in b-metric spaces and inspired by the Ciric and et. al method, we produce appropriate conditions for given the unique common fixed point for a family of the even number of self-maps with together another two self-maps in a complete b-metric spaces. Also, we generalize this common fixed point theorem for a seq...

Traditional automata accept or reject their input, and are therefore Boolean. Lattice automata generalize the traditional setting and map words to values taken from a lattice. In particular, in a fully-ordered lattice, the elements are 0, 1, . . . , n − 1, ordered by the standard ≤ order. Lattice automata, and in particular lattice automata defined with respect to fully-ordered lattices, have i...

in this paper, we give some results on the common fixed point of self-mappings defined on complete $b$-metric spaces. our results generalize kannan and chatterjea fixed point theorems on complete $b$-metric spaces. in particular, we show that two self-mappings satisfying a contraction type inequality have a unique common fixed point. we also give some examples to illustrate the given results.

In this paper, we prove a general fixed point theorem in $textrm{S}$-metric spaces for maps satisfying an implicit relation on complete metric spaces. As applications, we get many analogues of fixed point theorems in metric spaces for $textrm{S}$-metric spaces.