125 research outputs found

    Domain Representable Spaces Defined by Strictly Positive Induction

    Full text link
    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.Comment: 48 pages. Accepted for publication in Logical Methods in Computer Scienc

    The PLACES game: Integrating technology concepts

    Full text link

    Lessons from experience with ecosystem-based management

    Full text link
    corecore