125 research outputs found
Domain Representable Spaces Defined by Strictly Positive Induction
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 space is a topological space characterized by
its strong representability over domains. In this paper, we study strictly
positive inductive definitions for spaces by means of domain
representations, i.e. we show that there exists a canonical fixed point of
every strictly positive operation on spaces.Comment: 48 pages. Accepted for publication in Logical Methods in Computer
Scienc
Evaluation of hydrologic equilibrium in a mountainous watershed: incorporating forest canopy spatial adjustment to soil biogeochemical processes
A laboratory-intensive course on the experimental study of protein-protein interactions
The Normal Detonation Shock Velocity–Curvature Relationship for Materials with Nonideal Equation of State and Multiple Turning Points
Absorption spectroscopy of the complexation between superpotent guanidinium sweeteners and specific monoclonal antibodies
Analysis of diversity of nucleotide and amino acid distributions in the VD and DJ joining regions in Ig heavy chains
- …
