Skip to Main Content
Computer Arithmetic and Validity
book

Computer Arithmetic and Validity

by Ulrich Kulisch
April 2013
Intermediate to advanced content levelIntermediate to advanced
456 pages
16h 7m
English
De Gruyter
Content preview from Computer Arithmetic and Validity
Section 3.4 Definition of computer arithmetic by semimorphisms 75
S.SincefS,
+
,
g is a screen ringoid, there exists only one such element x De.
Therefore, D .e, o/ is the only element in CS that satisfies (D5).
(b), (c) and (d) are simple consequences of Theorem 3.5.
The operations defined in M
n
S and CS by Theorems 3.9 and 3.10 are quite different
from those defined in the same sets by the traditional definition of arithmetic in these
subsets in Theorems 2.6 and 2.7.
Theorems 3.9 and 3.10 already specify the definition of the arithmetic by semimor-
phisms for several of the sets displayed under D in Figure 3.2. As an example, let
R denote the linearly ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Arithmetic and Logic in Computer Systems

Arithmetic and Logic in Computer Systems

Mi Lu
Interval Analysis

Interval Analysis

Günter Mayer

Publisher Resources

ISBN: 9783110301731