Norm-weightable riesz spaces and the dual complexity space

Electronic Notes in Theoretical Computer Science

Volumn 74, Issue , 2003, Pages 105-121

  O'Keeffe, M ^a   Romaguera, S ^b   Schellekens, M ^a  

^a UNIVERSITY COLLEGE CORK   (Ireland)

^b UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

Dual complexity space; Join semilattice; Negative cone; Norm weightable; Quasi metric space; Quasi norm; Quasi uniform space; Riesz space

Indexed keywords

ALGORITHMS; METRIC SYSTEM; NUMBER THEORY; SET THEORY; THEOREM PROVING;

BANACH FIXED POINT THEOREM; COMPLEXITY SPACES; DUAL COMPLEXITY; SEMIVALUATION SPACES;

COMPUTATIONAL COMPLEXITY;

EID: 23844473865     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80769-2     Document Type: Conference Paper

References (27)

1. [Bir84] G. Birkhoff, Lattice Theory, AMS Colloquium Publications 25, Providence, Rhode Island, 1984.
2. [BOU52] N. Bourbaki, Eléments de Mathématique XIII, Intégration (Livre VI, Chapitre III), 1952.
3. [BS97] M. A. Bukatin, J. S. Scott, Towards computing distances between programs via Scott domains, in: S. Adian, A. Nerode, eds., Logical Foundations of Computer Science, Lecture Notes in Computer Science, 1234, 33-43, Springer, 1997.
4. [BSh97] M. A. Bukatin, S. Y. Shorina, Partial metrics and Co-continuous Valuations, in M. Nivat, ed., Foundations of Software Science and Computation Structures, Lecture Notes in Computer Science, 1378, 125-139, Springer, 1998.
5. [FL82] P. Fletcher, W. F. Lindgren, Quasi-Uniform Spaces, Marcel Dekker, New York, 1982.
6. [Gie80] G. Gierz, K. H. Hofmann, K. Keimel, J. D. Lawson, M. Mislove and D. S. Scott, A compendium of continuous lattices, Springer Verlag, Berlin, Heidelberg, New York, 1980.
7. [JP89] C. Jones, G. Plotkin, A probabilistic powerdomain of evaluations. In: LICS '89, IEEE Computer Society Press, 186 - 195, 1989.
8. [Jon89] C. Jones, Probabilistic Non-determinism, PhD-thesis, University of Edinburgh, 1989.
9. [KR92] K. Keimel, W. Roth, Ordered Cones and Approximation, Springer-Verlag, Berlin, Heidelberg, 1992.
10. [Kün93] H. P. Künzi, Nonsymmetric topology, in: Proc. Szekszárd Conference, Bolyai Soc. Math. Studies 4, 303-338, 1993.
11. [KV94] H. P. Künzi, V. Vajner, Weighted quasi-metrics, in: Proc. 8th Summer Conference on General Topology and Applications. Ann. New York Acad. Sci., 728, 64-77, 1994.
12. [Law95] J. D. Lawson, Valuations on continuous lattices. In: Continuous Lattices and Related Topics (R. E. Hoffman, Ed.), Mathematik Arbeitspapiere 27, Universität Bremen, 1995.
13. [Mat94] S. G. Matthews, Partial metric topology, in: Proc. 8th Summer Conference on General Topology and Applications. Ann. New York Acad. Sci. 728, 183-197, 1994.
14. [Mat95] S. G. Matthews, An extensional treatment of lazy data flow deadlock, Theoretical Computer Science 151, 195 - 205, 1995.
15. [O'N97] S. J. O'Neill, Partial metrics, valuations and domain theory. In S. Andima et al., eds., Proc. 11th Summer Conference on General Topology and Applications, Annals New York Academy of Sciences, 806, 304-315, New York, 1997.
16. [Plo83] G. Plotkin, Domains. University of Edinburgh, 1983.
17. [RS96] S. Romaguera, M. Schellekens, Quasi-metric properties of Complexity Spaces, Topology and its Applications 98, 311-322, 1999.
18. [RS98] S. Romaguera, M. Schellekens, Duality and quasi-normability for complexity spaces, Appl. Gen. Topology 3, 91-112, 2002.
19. [Sch95] M. P. Schellekens, The Smyth Completion: A Common Foundation for Denotational Semantics and Complexity Analysis, in: proc. MFPS 11, Electronic Notes in Theoretical Computer Science, Vol. I, Elsevier, 211-232, 1995.
20. [Sch96] M. P. Schellekens, On upper weightable spaces, in: Proc. 11th Summer Conference on General Topology and Applications. Ann. New York Acad. Sci. 806, 348-363, 1996.
21. [Sch97] M. P. Schellekens, Complexity Spaces: Lifting & Directedness, Topology Proceedings 22, 403 - 425, 1999.
22. [Sch02a] M. P. Schellekens, The correspondence between partial metrics and semivaluations, Theoretical Computer Science, accepted for publication, to appear.
23. [Sch02b] M. P. Schellekens, A characterization of partial metrizability, Domains are quantifiable, Theoretical Computer Science, accepted for publication, to appear.
24. [Smy91] M. B. Smyth, Totally bounded spaces and compact ordered spaces as domains of computation, in G. M. Reed, A. W. Roscoe and R. F. Wachter, editors, Topology and Category Theory in Computer Science, 207-229, Oxford University Press, 1991.
25. [TCS90] Handbook of Theoretical Computer Science, Vol. B, Formal Models and Semantics, editor: J. Van Leeuwen, MIT Press, 1990.
26. [Web91] H. Weber, Uniform Lattices I: A generalization of topological Riesz spaces and topological Boolean Rings. Ann. Mat. Pura Appl. 160, 347 - 370, 1991.
27. [Web] H. Weber, Uniform lattices and modular functions, preprint.