Qualitative versus quantitative fixed point techniques in computer science

DOI10.2989/16073606.2017.1373712MaRDI QIDQ5236147zbMATH OpenOpenAlexFDO

Authors María López-Ramírez, O. 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

algorithmic complexitycompletedenotational semanticsfixed pointpartial metricpartial orderquasi-metric

Mathematics Subject Classification ID

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

Recommendations

• On 0-complete partial metric spaces and quantitative fixed point techniques in denotational semantics
• Fixed Points In Quantitative Semantics
• A fixed point theorem in partial quasi-metric spaces and an application to software engineering
• The contraction principle as a particular case of Kleene's fixed point theorem

Cites work

• A quantitative computational model for complete partial metric spaces via formal balls
• An Application of Generalized Complexity Spaces to Denotational Semantics via the Domain of Words
• Bicompleting weightable quasi-metric spaces and partial metric spaces
• Cauchy sequences in quasi-pseudo-metric spaces
• scientific article; zbMATH DE number 3793435 (Why is no real title available?)
• scientific article; zbMATH DE number 1142322 (Why is no real title available?)
• scientific article; zbMATH DE number 1784847 (Why is no real title available?)
• scientific article; zbMATH DE number 194916 (Why is no real title available?)
• New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces
• Non-Hausdorff topology and domain theory. Selected topics in point-set topology
• On 0-complete partial metric spaces and quantitative fixed point techniques in denotational semantics
• On the Yoneda completion of a quasi-metric space
• Partial Metric Topology
• Quasi-metric properties of complexity spaces
• The contraction principle as a particular case of Kleene's fixed point theorem
• The Smyth Completion

Cited in

(2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5236147)