Qualitative versus quantitative fixed point techniques in computer science

DOI10.2989/16073606.2017.1373712OpenAlexW2754440033MaRDI QIDQ5236147

María López-Ramírez, Oscar Valero

Publication date: 15 October 2019

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2989/16073606.2017.1373712

zbMATH Keywords

fixed pointalgorithmic complexitypartial orderdenotational semanticscompletepartial metricquasi-metric

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complete metric spaces (54E50) Linearly ordered topological spaces, generalized ordered spaces, and partially ordered spaces (54F05) Fixed-point theorems (47H10) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

On Fixed Point Theory in Partially Ordered (Quasi-)metric Spaces and an Application to Complexity Analysis of Algorithms ⋮ On fixed point theory in partially ordered sets and an application to asymptotic complexity of algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cauchy sequences in quasi-pseudo-metric spaces
• The contraction principle as a particular case of Kleene's fixed point theorem
• On the Yoneda completion of a quasi-metric space
• Quasi-metric properties of complexity spaces
• On 0-complete partial metric spaces and quantitative fixed point techniques in denotational semantics
• Bicompleting weightable quasi-metric spaces and partial metric spaces
• An Application of Generalized Complexity Spaces to Denotational Semantics via the Domain of Words
• A quantitative computational model for complete partial metric spaces via formal balls
• The Smyth Completion
• Partial Metric Topology
• New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces
• Non-Hausdorff Topology and Domain Theory

This page was built for publication: Qualitative versus quantitative fixed point techniques in computer science