## The Bulletin of Symbolic Logic, Volume 3 |

### From inside the book

Results 1-3 of 20

Page 409

its effective representation with an algebraic domain is equivalent to the classical

computability theory of the

that effective presentations by algebraic and continuous domains are indeed ...

its effective representation with an algebraic domain is equivalent to the classical

computability theory of the

**real numbers**and it can be shown, from results in [18],that effective presentations by algebraic and continuous domains are indeed ...

Page 438

Exact

provides floating-point numbers for

well-known, they can give rise to serious problems such as round-off errors and ...

Exact

**real number**computation. Nearly every computer programming languageprovides floating-point numbers for

**real number**computation. However, as it iswell-known, they can give rise to serious problems such as round-off errors and ...

Page 439

Nielsen and Kornerup [92] have developed a general framework for representing

a

linear fractional transformations (1ft). Following Scott's idea of the domain of ...

Nielsen and Kornerup [92] have developed a general framework for representing

a

**real number**as an infinite product of matrices or as an infinite composition oflinear fractional transformations (1ft). Following Scott's idea of the domain of ...

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Articles | 9 |

Set theory generated by Abelian group theory by Paul C Eklof | 17 |

On the decision problem for twovariable firstorder logic by Erich Gradel | 58 |

Copyright | |

11 other sections not shown

### Other editions - View all

### Common terms and phrases

abstract algebraic algorithm argument-text arithmetic Association for Symbolic axioms Borel Borel equivalence relation bounded Cambridge Canada cardinality Church Coll Comp complete Computer Science construction countable defined definition denote Department of Mathematics Dept domain E-mail editors elements equivalence relation finite model first-order first-order logic fixed point formal formula Germany given Godel graph induction Info Inst interpretation intuitionistic intuitionistic logic isomorphism Japan Journal of Symbolic lambda calculus language Lemma linear linear logic Matematica Math metric space modal logic model theory natural numbers notation notion ordinal P.O. Box paper Philos predicate presheaf problem programming proof theory Proposition prove real number recursion theory recursive functions reduction result satisfies semantics sentence sequence set theory Skolem Springer-Verlag Stanford structure subset Symbolic Logic Tarski Theorem topological Turing type theory Univ University variables Well-Ordering Theorem Zermelo