Domains for Computation in Mathematics, Physics and Exact Real Arithmetic
DOI10.2307/421098zbMATH Open0946.03055OpenAlexW2114953769MaRDI QIDQ4382500FDOQ4382500
Authors: Abbas Edalat 
Publication date: 25 October 2000
Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/fd21350b4c915c525b1ccfa067441f168cb2ee0d
Recommendations
algorithmssurveychaosfractal geometryiterated function systemsstatistical physicselementary functionscontinuous domainsreal arithmeticmeasure and integrationexact computer arithmeticeffective presentation
Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Fractals (28A80) Elementary functions (26A09) Set functions and measures on topological spaces (regularity of measures, etc.) (28C15) Dimension theory in general topology (54F45) Semantics in the theory of computing (68Q55) Higher-type and set recursion theory (03D65) Applications of computability and recursion theory (03D80)
Cites Work
- PCF extended with real numbers
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Devaney's Definition of Chaos
- LCF considered as a programming language
- Continuous information systems
- Information systems for continuous posets
- Title not available (Why is that?)
- Spaces of maximal points
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The universal metric properties of nonlinear transformations
- Title not available (Why is that?)
- Domain theory and integration
- Power domains and iterated function systems
- The Hausdorff dimension of self-affine fractals
- Domain representability of metric spaces
- Power domains
- Dynamical systems, measures, and fractals via domain theory
- When Scott is weak on the top
- CPO's of measures for nondeterminism
- Effectively given domains
- Total objects of domains
- Embedding metric spaces into CPO's
- Multifractality in forgetful memories
- Complete local rings as domains
- Self-similar sets as Tarski's fixed points
- Real number computability and domain theory
- FRACTAL IMAGE COMPRESSION
- Existence theorems for measures on continous posets, with applications to random set theory.
- Automata, languages and programming. 24th international colloquium, ICALP '97, Bologna, Italy, July 7--11, 1997. Proceedings
- Title not available (Why is that?)
- Information categories
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (41)
- 2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08
- \(L\)-fuzzy strongest postcondition predicate transformers as \(L\)-idempotent linear or affine operators between semimodules of monotonic predicates
- Bounded complete domains and their logical form
- Computable and Continuous Partial Homomorphisms on Metric Partial Algebras
- An extension of chaotic probability models to real-valued variables
- Polish spaces, computable approximations, and bitopological spaces
- Combinatorics for computing relativistic several complex variable domains
- A domain-theoretic framework for robustness analysis of neural networks
- A new fixed point theorem in domain theory
- Outline of partial computability in computable topology
- A constructive theory of continuous domains suitable for implementation
- Two categories of effective continuous cpos
- Computable Banach spaces via domain theory
- Decidable fan theorem and uniform continuity theorem with continuous moduli
- Domain theoretic second-order Euler's method for solving initial value problems
- Topological games in domain theory
- Domain representations of partial functions, with applications to spatial objects and constructive volume geometry.
- Reducibility of domain representations and Cantor–Weihrauch domain representations
- Recursive solution of initial value problems with temporal discretization
- Completeness of hyperspaces of compact subsets of quasi-metric spaces
- Computable de Finetti measures
- Can partial indexings be totalized?
- Probabilistic operational semantics for the lambda calculus
- Effectiveness in RPL, with applications to continuous logic
- Extension of valuations on locally compact sober spaces
- A topology on lattice-ordered groups
- A domain-theoretic approach to Brownian motion and general continuous stochastic processes
- Ambiguous representations of semilattices, imperfect information, and predicate transformers
- Wadge hardness in Scott spaces and its effectivization
- Computability and the morphological complexity of some dynamics on continuous domains
- A domain-theoretic approach to computability on the real line
- Borel and Hausdorff hierarchies in topological spaces of Choquet games and their effectivization
- A Domain-Theoretic Approach to Integration in Hausdorff Spaces
- Confined modified realizability
- Computable total functions on metric algebras, universal algebraic specifications and dynamical systems
- Foundation of a computable solid modelling.
- Effectivity and effective continuity of multifunctions
- Some reasons for generalising domain theory
- Function-space compactifications of function spaces
- On computational environments of topological spaces
- Some results related to the continuity problem
This page was built for publication: Domains for Computation in Mathematics, Physics and Exact Real Arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4382500)
