𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Roundoff-Free Number Fields for Interval Computations

✍ Scribed by Vladik Kreinovich

Book ID
110302932
Publisher
Springer
Year
2001
Tongue
English
Weight
118 KB
Volume
7
Category
Article
ISSN
1385-3139

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Computational complexity of quantifier-f
Computational complexity of quantifier-free negationless theory of field of rational numbers
✍ Nikolai Kossovski πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 70 KB

The following result is an approximation to the answer of the question of Kokorin (Logical Notebook, Unsolved Problems of Mathematics, Novosibirsk, 1986, 41pp; in Russian) about decidability of a quantiΓΏer-free theory of ΓΏeld of rational numbers. Let Q0 be a subset of the set of all rational numbers