✦ LIBER ✦

An effective fixed-point theorem in intuitionistic diagonalizable algebras

✍ Scribed by Giovanni Sambin

Publisher: Springer Netherlands
Year: 1976
Tongue: English
Weight: 967 KB
Volume: 35
Category: Article
ISSN: 0039-3215
DOI: 10.1007/bf02123402

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The fixed-point theorem for diagonalizab

The fixed-point theorem for diagonalizable algebras

✍ Claudio Bernardi 📂 Article 📅 1975 🏛 Springer Netherlands 🌐 English ⚖ 651 KB

The uniqueness of the fixed-point in eve

The uniqueness of the fixed-point in every diagonalizable algebra

✍ Claudio Bernardi 📂 Article 📅 1976 🏛 Springer Netherlands 🌐 English ⚖ 495 KB

Common fixed point theorems in intuition

Common fixed point theorems in intuitionistic fuzzy metric spaces

✍ D. Turkoglu; C. Alaca; Y. J. Cho; C. Yildiz 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 211 KB

Fixed Point Theorems with an Application

Fixed Point Theorems with an Application in Generalized Games

✍ Y.S. Huang 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 308 KB

A Fixed Point Theorem in Probabilistic M

A Fixed Point Theorem in Probabilistic Metric Spaces and an Application

✍ E. Pap; O. Hadžić; R. Mesiar 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 198 KB 👁 1 views

The notion of a ⌿, C -contraction type multivalued mapping is introduced. This notion is a generalization of the notion of C-contraction introduced by T. L. Hicks Ž .

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.