<abstract xmlns="http://www.w3.org/1999/xhtml"><p>In 1970, D.S. Scott gave applications of Kleene’s fixed point theorem to describe the meaning of recursive denotational specifications in programming languages. Later on, in 1994, S.G. Matthews and, in 1995, M.P. Schellekens gave quantitative counterparts of the Kleene fixed point theorem which allowed to apply partial metric and quasi-metric fixed point techniques to denotational semantics and asymptotic complexity analysis of algorithms in the spirit of Scott. Recently, in 2005, J.J. Nieto and R. Rodríguez-López made an in-depth study of how to reconcile order-theoretic and metric fixed point techniques in the classical metric case with the aim of providing the existence and uniqueness of solutions to first-order differential equations admitting only the existence of a lower solution. Motivated by the aforesaid fixed point results we prove a partial quasi-metric version, when the specialization order is under consideration, of the fixed point results of Nieto and Rodríguez-López in such a way that the results of Matthews and Schellekens can be retrieved as a particular case.</p></abstract>

In 1970, D.S. Scott gave applications of Kleene’s fixed point theorem to describe the meaning of recursive denotational specifications in programming languages. Later on, in 1994, S.G. Matthews and, in 1995, M.P. Schellekens gave quantitative counterparts of the Kleene fixed point theorem which allowed to apply partial metric and quasi-metric fixed point techniques to denotational semantics and asymptotic complexity analysis of algorithms in the spirit of Scott. Recently, in 2005, J.J. Nieto and R. Rodríguez-López made an in-depth study of how to reconcile order-theoretic and metric fixed point techniques in the classical metric case with the aim of providing the existence and uniqueness of solutions to first-order differential equations admitting only the existence of a lower solution. Motivated by the aforesaid fixed point results we prove a partial quasi-metric version, when the specialization order is under consideration, of the fixed point results of Nieto and Rodríguez-López in such a way that the results of Matthews and Schellekens can be retrieved as a particular case.

New fixed point results in partial quasi-metric spaces

Applied Mathematics and Nonlinear Sciences

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

{"article-title":"New fixed point results in partial quasi-metric spaces"}

In 1970, D.S. Scott gave applications of Kleene’s fixed point theorem to describe the meaning of recursive denotational specifications in programming...

New fixed point results in partial quasi-metric spaces

Article Category: Regular Articles

Publié en ligne: 12 oct. 2017

Pages: 415 - 428

Reçu: 08 mars 2017

Accepté: 12 oct. 2017

DOI: https://doi.org/10.21042/AMNS.2017.2.00033

Mots clés
partial quasi-metric, Smyth complete, fixed point, order-contractive, monotone

© 2017 Zahra Mohammadi, Oscar Valero, published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

New fixed point results in partial quasi-metric spaces

Article Category: Regular Articles

Publié en ligne: 12 oct. 2017

Pages: 415 - 428

Reçu: 08 mars 2017

Accepté: 12 oct. 2017

DOI: https://doi.org/10.21042/AMNS.2017.2.00033

Mots cléspartial quasi-metric, Smyth complete, fixed point, order-contractive, monotone

© 2017 Zahra Mohammadi, Oscar Valero, published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Mots clés
partial quasi-metric, Smyth complete, fixed point, order-contractive, monotone