Complete partial metric spaces have partially metrizable computational models
From MaRDI portal
Publication:5891574
DOI10.1080/00207160.2011.559229zbMath1238.05256arXiv1012.3252MaRDI QIDQ5891574
Miguel Romance, Regino Criado, Jesús Gómez-Gardeñes, Julio Flores, Alejandro García del Amo
Publication date: 15 May 2012
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1012.3252
05C90: Applications of graph theory
05C82: Small world graphs, complex networks (graph-theoretic aspects)
Related Items
Line graphs for a multiplex network, On the edges’ PageRank and line graphs, Structure of triadic relations in multiplex networks, Pinning adaptive synchronization of a class of uncertain complex dynamical networks with multi-link against network deterioration, On 0-complete partial metric spaces and quantitative fixed point techniques in denotational semantics, Eigenvector centrality of nodes in multiplex networks
Cites Work
- Generalized ultrametric spaces in quantitative domain theory
- A computational model for metric spaces
- Computable Banach spaces via domain theory
- Weighted colimits and formal balls in generalized metric spaces
- Approximation of metric spaces by partial metric spaces
- A characterization of partial metrizability: Domains are quantifiable.
- Quantitative continuous domains
- Bounded complete models of topological spaces
- The constructive maximal point space and partial metrizability
- Domain theoretic characterisations of quasi-metric completeness in terms of formal balls
- The space of formal balls and models of quasi-metric spaces
- A quantitative computational model for complete partial metric spaces via formal balls
- A quasi-metric computational model from modular functions on monoids
- Partial Metric Topology
- Spaces of maximal points
- Denotational semantics for programming languages, balanced quasi-metrics and fixed points
- Partial metrisability of continuous posets
