English

Domain Representable Spaces Defined by Strictly Positive Induction

Logic in Computer Science 2015-07-01 v2

Abstract

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 qcb0 qcb_{0} space is a topological space characterized by its strong representability over domains. In this paper, we study strictly positive inductive definitions for qcb0 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 qcb0qcb_{0} spaces.

Cite

@article{arxiv.1006.5561,
  title  = {Domain Representable Spaces Defined by Strictly Positive Induction},
  author = {Petter Kristian Køber},
  journal= {arXiv preprint arXiv:1006.5561},
  year   = {2015}
}

Comments

48 pages. Accepted for publication in Logical Methods in Computer Science

R2 v1 2026-06-21T15:42:18.244Z