We obtain a quasi-metric generalization of Caristi's fixed point theorem for a kind of
complete quasi-metric spaces. With the help of a suitable modification of its proof, we …

Schellekens [The Smyth completion: A common foundation for denotational semantics and
complexity analysis, Electron. Notes Theor. Comput. Sci. 1 (1995), pp. 211–232.] introduced …

Involving w-distances we prove a fixed point theorem of Caristi-type in the realm of (non-
necessarily T 1) quasi-metric spaces. With the help of this result, a characterization of quasi …

In this paper, we study those functions that allows us to combine a family of quasi-metrics,
defined all of them on the same set, into a single one, which will be called quasi-metric …

In Denotational Semantics one of the aims consists of giving mathematical models of
programming languages so that the meaning of a recursive algorithm can be obtained as an …

In this paper we continue the study of fixed point theory in partial quasi-metric spaces and its
usefulness in complexity analysis of algorithms. Concretely we prove two new fixed point …

We study domain theoretic properties of complexity spaces. Although the so-called
complexity space is not a domain for the usual pointwise order, we show that, however, each …

The problem of how to merge, by means of a function, a family of metrics into a single one
was studied deeply by J. Borsík and J. Doboš [On a product of metric spaces, Math. Slovaca …

We obtain a common fixed point theorem of Boyd-Wong type for four mappings satisfying a
Ciric-type contraction on a complete partial metric space. Our result generalizes and unifies …

In 1981, J. Borsík and J. Doboš studied and solved the problem of how to merge, by means
of a function, a (not necessarily finite) collection of metrics in order to obtain a single one as …