4 citations found. Retrieving documents...
A. Edalat, "Domains for Computation in Mathematics, Physics and Exact Real Arithmetic", The Bulletin of Symbolic Logic, vol. 3 (1997), pp. 401--452.

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Topology and Computability - Bauer (1998)   (1 citation)  (Correct)

....R R) The proofs of 1.4(1) 4) are standard. See [8] 24] and [1] as a general reference. The proof of 1. 4(5) is best given by using the methods of realnumber computability in certain effectively presented domains as developed by Abbas Edalat and his collaborators in a series of papers, see [12] for a comprehensive overview. Our method here, however, extends ideas of computability to many more types beyond domains. We point out again that when [F ] 2 ] A B) for two types A and B in PER(P) the same computable representative F : P P also represents a morphism [F ] A ] B. In ....

....8 Can we simplify and generalize some of the results on computability of topological spaces by working in PER(P) with topological objects instead of just countably based countable T 0 spaces 3. 1 Metric Spaces Computability in metric spaces has been studied extensively, see for example Edalat [12], Wagner [35] Smyth [31] and America and Rutter [3] Every 14 metric space (M; d) with the topology induced by the metric is a T 0 space; in fact, it is a normal Hausdorff space. It is countably based if, and only if, it is separable, i.e. it contains a countable dense set. The topology on a ....

[Article contains additional citation context not shown here]

A. Edalat, "Domains for Computation in Mathematics, Physics and Exact Real Arithmetic", The Bulletin of Symbolic Logic, vol. 3 (1997), pp. 401--452.


Topology and Computability - Thesis Proposal Andrej   Self-citation (Edalat)   (Correct)

No context found.

A. Edalat, "Domains for Computation in Mathematics, Physics and Exact Real Arithmetic", The Bulletin of Symbolic Logic, vol. 3 (1997), pp. 401--452.


Topology and Computability - Thesis Proposal Andrej   Self-citation (Edalat)   (Correct)

No context found.

A. Edalat, "Domains for Computation in Mathematics, Physics and Exact Real Arithmetic", The Bulletin of Symbolic Logic, vol. 3 (1997), pp. 401--452.


From Intervals to? Towards a General Description of.. - Kreinovich, Dimuro.. (2004)   (Correct)

No context found.

A. Edalat, "Domains for computation in mathematics, physics, and exact real arithmetic", Bulletin of Symbolic Logic, 1997, Vol. 3, No. 4, pp. 401-- 452.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC