Informatica

In this paper we establish some properties of fuzzy quasi-pseudo-metric spaces. An important result is that any partial ordering can be defined by a fuzzy quasi-metric, which can be applied both in theoretical computer science and in information theory, where it is usual to work with sequences of objects of increasing information. We also obtain decomposition theorems of a fuzzy quasi-pseudo metric into a right continuous and ascending family of quasi-pseudo metrics. We develop a topological foundation for complexity analysis of algorithms and programs, and based on our results a fuzzy complexity space can be considered. Also, we built a fertile ground to study some types of fuzzy quasi-pseudo-metrics on the domain of words, which play an important role on denotational semantics, and on the poset $\mathit{B}\mathit{X}$ of all closed formal balls on a metric space.