Petter Kristian Køber - Domain Representable Spaces Defined by Strictly Positive Induction

lmcs:955 - Logical Methods in Computer Science, August 26, 2010, Volume 6, Issue 3 - https://doi.org/10.2168/LMCS-6(3:9)2010
Domain Representable Spaces Defined by Strictly Positive InductionArticle

Authors: Petter Kristian Køber

    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.


    Volume: Volume 6, Issue 3
    Published on: August 26, 2010
    Imported on: October 22, 2009
    Keywords: Computer Science - Logic in Computer Science,F.1.1, F.4.1

    Consultation statistics

    This page has been seen 2437 times.
    This article's PDF has been downloaded 279 times.