Some fixed point results in ordered partial metric spaces

In this paper, we establish some fixed point theorems in ordered partial metric spaces. An example is given to illustrate our obtained results.

💡 Research Summary

The paper introduces a new framework called an ordered partial metric space, which combines a partial metric—a distance‑like function that may assign a non‑zero value to the distance of a point from itself—with a partial order defined on the underlying set. This hybrid structure is motivated by applications in computer science and information theory where asymmetrical or self‑referential distances naturally arise (e.g., program semantics, non‑symmetric network latency, and approximate database consistency). The authors aim to extend classical fixed‑point results, traditionally formulated for complete metric spaces or ordered complete metric spaces, to this more general setting.

After a concise introduction, the authors formalize the basic notions. A partial metric (p: X \times X \to