Two categories of effective continuous cpos
2006 (English)In: Theoretical Computer Science, ISSN 0304-3975, Vol. 365, no 3, 216-236 p.Article in journal (Refereed) Published
This paper presents two categories of effective continuous complete partial orders (cpos). We define a new criterion on the basis of a cpo so as to make the resulting category of consistently complete continuous cpos cartesian closed. We also generalise to continuous cpos the definition of a complete set, which was used as a definition of effective bifinite domains in Hamrin and Stoltenberg-Hansen [Cartesian closed categories of effective domains, in: H. Schwichtenberg, R. Steinbruggen (Eds.), Proof and System-Reliability, Kluwer Academic Publishers, Dordrecht, 2002, pp. 1-20], and investigate the closure results that can be obtained.
Place, publisher, year, edition, pages
2006. Vol. 365, no 3, 216-236 p.
03D45Theory of numerations, effectively presented structures, domain theory, cartesian closure, effective domains
IdentifiersURN: urn:nbn:se:kth:diva-25188DOI: 10.1016/j.tcs.2006.07.049ISI: 000242061800006OAI: oai:DiVA.org:kth-25188DiVA: diva2:356463
QC 201010152010-10-122010-10-122011-11-17Bibliographically approved