Information orders play a central role in the mathematical foundations of Computer Science. Concretely, they are a suitable tool to describe processes in which the information increases successively in each step of the computation. In order to provide numerical quantifications of the amount of information in the aforementioned processes, S.G. Matthews introduced the notions of partial metric and Scott-like topology. The success of partial metrics is given mainly by two facts. On the one hand, they can induce the so-called specialization partial order, which is able to encode the existing order structure in many examples of spaces that arise in a natural way in Computer Science. On the other hand, their associated topology is Scott-like when the partial metric space is complete and, thus, it is able to describe the aforementioned increasing information processes in such a way that the supremum of the sequence always exists and captures the amount of information, measured by the partial metric; it also contains no information other than that which may be derived from the members of the sequence. R. Heckmann showed that the method to induce the partial order associated with a partial metric could be retrieved as a particular case of a celebrated method for generating partial orders through metrics and non-negative real-valued functions. Motivated by this fact, we explore this general method from an information orders theory viewpoint. Specifically, we show that such a method captures the essence of information orders in such a way that the function under consideration is able to quantify the amount of information and, in addition, its measurement can be used to distinguish maximal elements. Moreover, we show that this method for endowing a metric space with a partial order can also be applied to partial metric spaces in order to generate new partial orders different from the specialization one. Furthermore, we show that given a complete metric space and an inf-continuous function, the partially ordered set induced by this general method enjoys rich properties. Concretely, we will show not only its order-completeness but the directed-completeness and, in addition, that the topology induced by the metric is Scott-like. Therefore, such a mathematical structure could be used for developing metric-based tools for modeling increasing information processes in Computer Science. As a particular case of our new results, we retrieve, for a complete partial metric space, the above-explained celebrated fact about the Scott-like character of the associated topology and, in addition, that the induced partial ordered set is directed-complete and not only order-complete.
