scientific article

Ingrid Lindström, Edward R. Griffor, Viggo Stoltenberg-Hansen

Publication date: 23 January 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

fixed points domains topology representation theory basic recursion theory domain theory complete partial orders effective domains domain equations power domains universal domain domains as models of formal theories partial element representability in domains

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Ordered sets (06A99) Continuous lattices and posets, applications (06B35) Recursive functions and relations, subrecursive hierarchies (03D20) Theory of numerations, effectively presented structures (03D45) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to ordered structures (06-01)

Related Items (56)

Generalized Scott topology on sets with families of pre-orders ⋮ Generalised information systems capture L-domains ⋮ Atomicity, coherence of information, and point-free structures ⋮ Typed vs. Untyped Realizability ⋮ Two categories of effective continuous cpos ⋮ Towards a descriptive set theory for domain-like structures ⋮ Formal spaces and their effective presentations ⋮ The best interval representations of t-norms and automorphisms ⋮ The connection between initial and unique solutions of domain equations in the partial order and metric approach ⋮ A type theoretic interpretation of constructive domain theory ⋮ Representability of locally compact regular spaces by domains and formal spaces ⋮ Schulze voting as evidence carrying computation ⋮ Towards interval uncertainty propagation control in bivariate aggregation processes and the introduction of width-limited interval-valued overlap functions ⋮ Dynamics of diffusion on monoplex and multiplex networks: a message-passing approach ⋮ Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces ⋮ Higher-order concepts for the potential infinite ⋮ Normal forms, linearity, and prime algebraicity over nonflat domains ⋮ How much partiality is needed for a theory of computability? ⋮ Fixed points and completeness in metric and generalized metric spaces ⋮ On degree spectra of topological spaces ⋮ Nonflatness and totality ⋮ Generalized metrics and uniquely determined logic programs. ⋮ Domain Equations Based on Sets with Families of Pre-orders ⋮ Reducibility of domain representations and Cantor–Weihrauch domain representations ⋮ Web spaces and worldwide web spaces: topological aspects of domain theory ⋮ Unnamed Item ⋮ On monotone modalities and adjointness ⋮ Thompson aggregators, Scott continuous koopmans operators, and least fixed point theory ⋮ Self-sustaining autocatalytic networks within open-ended reaction systems ⋮ Domain representability of metric spaces ⋮ Domain representations of spaces of compact subsets ⋮ Denotational semantics for thread algebra ⋮ Information systems revisited -- the general continuous case ⋮ A Relationship between Equilogical Spaces and Type Two Effectivity ⋮ Various Constructions of Continuous Information Systems ⋮ On Finite-time Computability Preserving Conversions ⋮ Program Self-reference in Constructive Scott Subdomains ⋮ Program self-reference in constructive Scott subdomains ⋮ A differential operator and weak topology for Lipschitz maps ⋮ Implementing Services by Partial State Machines ⋮ Meet continuity properties of posets ⋮ Continuous Functions on Final Coalgebras ⋮ Processes with local and global liveness requirements ⋮ A constructive theory of continuous domains suitable for implementation ⋮ A domain-theoretic approach to computability on the real line ⋮ Effective λ-models versus recursively enumerable λ-theories ⋮ Comparing recursive equilibrium in economies with dynamic complementarities and indeterminacy ⋮ Equilogical spaces ⋮ Effective domain representations of \({\mathcal H}(X)\), the space of compact subsets ⋮ Concrete models of computation for topological algebras ⋮ Computation by `While' programs on topological partial algebras ⋮ A term calculus for (co-)recursive definitions on streamlike data structures ⋮ Topology, domain theory and theoretical computer science ⋮ Uniform approximation of topological spaces ⋮ Domain representations of topological spaces ⋮ Domain representations of partial functions, with applications to spatial objects and constructive volume geometry.

This page was built for publication: