in this paper, the notion of cyclic $varphi$-contraction in fuzzymetric spaces is introduced and a fixed point theorem for this typeof mapping is established. meantime, an example is provided toillustrate this theorem. the main result shows that a self-mappingon a g-complete fuzzy metric space has a unique fixed point if itsatisfies the cyclic $varphi$-contraction. afterwards, some results inco...

We shall consider generated pseudo-operations of the following form: x⊕ y = g(−1) (g(x) + g(y)) , x ̄ y = g(−1) (g(x)g(y)) , where g is a positive strictly monotone generating function and g(−1) is its pseudo-inverse. Using this type of pseudo-operations, the Riemann-Stieltjes type integral will be introduced and investigated.

In this paper the turnpike property is established for convex optimal control problems, involving undiscounted utility function and differential inclusions defined by multi-valued mapping having convex graph. Utility function is concave but not necessarily strictly concave. The turnpike theorem is proved under the main assumption that over any given line segment, either multi-valued mapping is ...

The purpose of this paper is to introduce a new type contraction called fuzzy F-contraction. As compared the F-contraction in existing literature, our much simpler and more straightforward, since it contains only one condition—that is, function F strictly increasing. Moreover, some fixed-point theorems for are presented. Further, examples given illustrate its validity superiority. In addition, ...

We investigate the complexity of enumerating pseudo-intents in the lectic order. We look at the following decision problem: Given a formal context and a set of n pseudo-intents determine whether they are the lectically first n pseudo-intents. We show that this problem is coNPhard. We thereby show that there cannot be an algorithm with a good theoretical complexity for enumerating pseudo-intents...

A mapping f : X → X from a set X to itself has a fixed point if there is an x ∈ X such that f(x) = x. The simplest fixed point theorem is that a continuous function f : [a, b] → [a, b] has at least one fixed point. This is a consequence of the intermediate value theorem from calculus, as follows. Since f(a) ≥ a and f(b) ≤ b, we have f(b) − b ≤ 0 ≤ f(a) − a. The difference f(x)−x is continuous, ...

we show that the variational inequality $vi(c,a)$ has aunique solution for a relaxed $(gamma , r)$-cocoercive,$mu$-lipschitzian mapping $a: cto h$ with $r>gamma mu^2$, where$c$ is a nonempty closed convex subset of a hilbert space $h$. fromthis result, it can be derived that, for example, the recentalgorithms given in the references of this paper, despite theirbecoming more complicated, are not...