Computer Science – Logic in Computer Science
Scientific paper
2010-06-29
LMCS 6 (3:9) 2010
Computer Science
Logic in Computer Science
48 pages. Accepted for publication in Logical Methods in Computer Science
Scientific paper
10.2168/LMCS-6(3:9)2010
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.
No associations
LandOfFree
Domain Representable Spaces Defined by Strictly Positive Induction does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Domain Representable Spaces Defined by Strictly Positive Induction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Domain Representable Spaces Defined by Strictly Positive Induction will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-314443