The complexity space of a valued linearly ordered set
From MaRDI portal
Recommendations
- THE A-COMPLEXITY OF A SPACE
- Computable linear orders and the Ershov hierarchy
- Computable linear orders and the ershov hierarchy
- The Complexity of the Collection of Countable Linear Orders of the form I + I
- Relative complexity for computable presentations of the conventional linear order on the set of naturals
- scientific article; zbMATH DE number 1985659
- Computable linearizations of well-partial-orderings
- Cleavability in ordered spaces
- On the complexity of the successivity relation in computable linear orderings
- scientific article; zbMATH DE number 165129
Cites work
- Bicompleting weightable quasi-metric spaces and partial metric spaces
- Cauchy sequences in quasi-pseudo-metric spaces
- scientific article; zbMATH DE number 4094358 (Why is no real title available?)
- scientific article; zbMATH DE number 3789474 (Why is no real title available?)
- scientific article; zbMATH DE number 3512981 (Why is no real title available?)
- scientific article; zbMATH DE number 3549841 (Why is no real title available?)
- scientific article; zbMATH DE number 1101628 (Why is no real title available?)
- scientific article; zbMATH DE number 1107511 (Why is no real title available?)
- scientific article; zbMATH DE number 1784847 (Why is no real title available?)
- scientific article; zbMATH DE number 3103212 (Why is no real title available?)
- Partial Metric Topology
- Quasi-metric properties of complexity spaces
- The correspondence between partial metrics and semivaluations
- The quasi-metric of complexity convergence
- The Smyth Completion
- Weightable quasi-metric semigroups and semilattices
Cited in
(3)
This page was built for publication: The complexity space of a valued linearly ordered set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2843630)