The Smyth Completion

DOI10.1016/S1571-0661(04)00029-5zbMath0910.68135OpenAlexW1557973150MaRDI QIDQ4222778

Publication date: 13 December 1998

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1571-0661(04)00029-5

zbMATH Keywords

denotational semantics complexity analysis of programs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Semantics in the theory of computing (68Q55) Uniform structures and generalizations (54E15)

Related Items

A new contribution to the fixed point theory in partial quasi-metric spaces and its applications to asymptotic complexity analysis of algorithms ⋮ On fixed point theory in topological posets, extended quasi-metric spaces and an application to asymptotic complexity of algorithms ⋮ A characterization of Smyth complete quasi-metric spaces via Caristi's fixed point theorem ⋮ The Goldstine theorem for asymmetric normed linear spaces ⋮ A characterisation of weightable quasi-metric generating functions ⋮ A fixed point theorem for preordered complete fuzzy quasi-metric spaces and an application ⋮ On Matthews' relationship between quasi-metrics and partial metrics: an aggregation perspective ⋮ The Banach fixed point theorem in fuzzy quasi-metric spaces with application to the domain of words ⋮ Hyperspaces of a weightable quasi-metric space: application to models in the theory of computation ⋮ Liminf convergence in \(\Omega\)-categories ⋮ Characterizations of quasi-metric and \(G\)-metric completeness involving \(w\)-distances and fixed points ⋮ The complexity probabilistic quasi-metric space ⋮ Applications of utility functions defined on quasi-metric spaces ⋮ New fixed point results in partial quasi-metric spaces ⋮ Weakly contractive multivalued maps and \(w\)-distances on complete quasi-metric spaces ⋮ A unique common fixed-point theorem for two maps under \(\psi\)-\(\phi\) contractive condition in partial metric spaces ⋮ Fixed point theory for cyclic generalized weak \(\phi\)-contraction on partial metric spaces ⋮ Unnamed Item ⋮ A characterization of partial metrizability: Domains are quantifiable. ⋮ On the triangle equality ⋮ Semi-Lipschitz functions and best approximation in quasi-metric spaces ⋮ Closed graph and open mapping theorems for normed cones ⋮ New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces ⋮ On Fixed Point Theory in Partially Ordered (Quasi-)metric Spaces and an Application to Complexity Analysis of Algorithms ⋮ The complexity space of partial functions: a connection between complexity analysis and denotational semantics ⋮ Applications of the complexity space to the general probabilistic divide and conquer algorithms ⋮ Unnamed Item ⋮ Applications and common coupled fixed point results in ordered partial metric spaces ⋮ Compactness in asymmetric normed spaces ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Fixed point theorems in generalized metric spaces with applications to computer science ⋮ New perspectives of granular computing in relation geometry induced by pairings ⋮ The Baire partial quasi-metric space: a mathematical tool for asymptotic complexity analysis in computer science ⋮ A Kirk type characterization of completeness for partial metric spaces ⋮ Complexity spaces as quantitative domains of computation ⋮ \(Q\)-functions on quasimetric spaces and fixed points for multivalued maps ⋮ Weightable quasi-metric semigroups and semilattices ⋮ The Hausdorff fuzzy quasi-metric ⋮ Fixed points of contractive maps on dcpo's ⋮ Complexity analysis via approach spaces ⋮ New results on the Baire partial quasi-metric space, fixed point theory and asymptotic complexity analysis for recursive programs ⋮ A Nemytskii-Edelstein type fixed point theorem for partial metric spaces ⋮ Characterizations of metrizable topological vector spaces and their asymmetric generalizations in terms of fuzzy (quasi-)norms ⋮ Quasi-metrics and monotone normality ⋮ Quotient normed cones ⋮ The average running time of an algorithm as a midpoint between fuzzy sets ⋮ 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 correspondence between partial metrics and semivaluations ⋮ On 0-complete partial metric spaces and quantitative fixed point techniques in denotational semantics ⋮ Qualitative versus quantitative fixed point techniques in computer science ⋮ \(\mathcal{MOQA}\); unlocking the potential of compositional static average-case analysis ⋮ Continuous operators on asymmetric normed spaces ⋮ On fixed point theory in partially ordered sets and an application to asymptotic complexity of algorithms ⋮ Bicompleting weightable quasi-metric spaces and partial metric spaces ⋮ Unnamed Item ⋮ Fixed point theorems for fuzzy mappings in quasi-metric spaces

Cites Work

This page was built for publication: The Smyth Completion