Qualitative versus quantitative fixed point techniques in computer science

DOI10.2989/16073606.2017.1373712OpenAlexW2754440033MaRDI QIDQ5236147FDOQ5236147

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

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

zbMATH Keywords

fixed pointpartial orderpartial metricdenotational semanticscompletequasi-metricalgorithmic complexity

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (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

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)