Domains for Computation in Mathematics, Physics and Exact Real Arithmetic

DOI10.2307/421098zbMath0946.03055OpenAlexW2114953769MaRDI QIDQ4382500

Publication date: 25 October 2000

Published in: Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/fd21350b4c915c525b1ccfa067441f168cb2ee0d

zbMATH Keywords

survey algorithms chaos statistical physics iterated function systems exact computer arithmetic elementary functions fractal geometry continuous domains real arithmetic measure and integration effective presentation

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Semantics in the theory of computing (68Q55) Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45) Fractals (28A80) Dimension theory in general topology (54F45) Applications of computability and recursion theory (03D80) Elementary functions (26A09) Set functions and measures on topological spaces (regularity of measures, etc.) (28C15) Higher-type and set recursion theory (03D65)

Related Items

Topological games in domain theory, Domain theoretic second-order Euler's method for solving initial value problems, Probabilistic operational semantics for the lambda calculus, Two categories of effective continuous cpos, A domain-theoretic approach to Brownian motion and general continuous stochastic processes, Decidable fan theorem and uniform continuity theorem with continuous moduli, Recursive solution of initial value problems with temporal discretization, Some results related to the continuity problem, A domain-theoretic framework for robustness analysis of neural networks, A new fixed point theorem in domain theory, Completeness of hyperspaces of compact subsets of quasi-metric spaces, Effectiveness in RPL, with applications to continuous logic, Computability and the morphological complexity of some dynamics on continuous domains, Reducibility of domain representations and Cantor–Weihrauch domain representations, Some reasons for generalising domain theory, On computational environments of topological spaces, Computable and Continuous Partial Homomorphisms on Metric Partial Algebras, Effectivity and effective continuity of multifunctions, \(L\)-fuzzy strongest postcondition predicate transformers as \(L\)-idempotent linear or affine operators between semimodules of monotonic predicates, An extension of chaotic probability models to real-valued variables, Can partial indexings be totalized?, Computable total functions on metric algebras, universal algebraic specifications and dynamical systems, Borel and Hausdorff hierarchies in topological spaces of Choquet games and their effectivization, Wadge hardness in Scott spaces and its effectivization, Outline of partial computability in computable topology, 2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08, A topology on lattice-ordered groups, A domain-theoretic approach to computability on the real line, Computable de Finetti measures, Confined modified realizability, Computable Banach spaces via domain theory, Ambiguous representations of semilattices, imperfect information, and predicate transformers, A Domain-Theoretic Approach to Integration in Hausdorff Spaces, Bounded complete domains and their logical form, Extension of valuations on locally compact sober spaces, Polish spaces, computable approximations, and bitopological spaces, Domain representations of partial functions, with applications to spatial objects and constructive volume geometry., Foundation of a computable solid modelling., Function-space compactifications of function spaces

Cites Work