DOMAIN REPRESENTABLE SPACES DEFINED BY STRICTLY POSITIVE INDUCTION

作者：Kober Petter Kristian^*

来源：Logical Methods in Computer Science, 2010, 6(3): 9.

DOI：10.2168/LMCS-6(3:9)2010

• Domain Theory
• Computable Analysis
• Domain representations
• qcb(0) spaces
• Inductive definitions
• Least fixed points

Recursive domain equations have natural solutions. In particular there are domains defined by strictly positive induction. The class of countably based domains gives a computability theory for possibly non-countably based topological spaces. A qcb(0) space is a topological space characterized by its strong representability over domains.
In this paper, we study strictly positive inductive definitions for qcb(0) spaces by means of domain representations, i.e. we show that there exists a canonical fixed point of every strictly positive operation on qcb(0) spaces.

• 出版日期2010