✦ LIBER ✦

Quasi-uniform isomorphisms in fuzzy quasi-metric spaces, bicompletion andD-completion

✍ Scribed by S. Romaguera; A. Sapena; O. Valero

Publisher: Akadmiai Kiad
Year: 2007
Tongue: English
Weight: 218 KB
Volume: 114
Category: Article
ISSN: 1588-2632
DOI: 10.1007/s10474-006-0512-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bicompletion of Lowen fuzzy quasi-unifor

Bicompletion of Lowen fuzzy quasi-uniform spaces

✍ Kamal El-Saady 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 231 KB

A quasi-metric space without complete qu

A quasi-metric space without complete quasi-uniformity

✍ Hans-Peter A. Künzi; Stephen Watson 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 266 KB

Completeness in quasi-uniform spaces

✍ J. L. Sieber; W. J. Pervin 📂 Article 📅 1965 🏛 Springer 🌐 English ⚖ 239 KB

Left K-Completeness in Quasi-Metric Spac

Left K-Completeness in Quasi-Metric Spaces

✍ Salvador Romaguera 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 580 KB

## Abstract Regular left __K__‐sequentially complete quasi‐metric spaces are characterized. We deduce that these spaces are complete Aronszajn and that every metrizable space admitting a left __K__‐sequentially complete quasi‐metric is completely metrizable. We also characterize quasi‐metric spaces

Fixed point theorems for fuzzy mappings

Fixed point theorems for fuzzy mappings in quasi-metric spaces

✍ Valentı́n Gregori; Salvador Romaguera 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 106 KB 👁 1 views

We obtain ÿxed point theorems for fuzzy mappings in Smyth-complete and left K-complete quasi-metric spaces, respectively. Well-known theorems are special cases of our results.

Quicksort algorithm: Application of a fi

Quicksort algorithm: Application of a fixed point theorem in intuitionistic fuzzy quasi-metric spaces at a domain of words

✍ Reza Saadati; S. Mansour Vaezpour; Yeol J. Cho 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 478 KB

In this paper, we apply an intuitionistic fuzzy quasi-metric version of a fixed point theorem, to obtain the existence of solution for a recurrence equation associated with the analysis of Quicksort algorithms.