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
70 Chapter 3 Definition of computer arithmetic
D
Theorem 3.7
M
n
D
Theorem 2.7
Theorem 2.6
CD
Theorem 2.7
Theorem 2.6
R
M
n
R
Theorem 2.7
Theorem 2.6
CR
S
M
n
S
CS
Theorem 2.6
Theorem 2.6
Theorem 2.6
M
n
CDM
n
CRM
n
CS
Theorem 3.7
Figure 3.2. The traditional definition of computer a rithmetic leading to ringoids.
resulting structures can be described in terms of ordered or weakly ordered ringoids
and vectoids.
This will also be one of the main results of the definition of the arithmetic in the sub-
sets by means of semimorphisms, which we discuss in Section 3.4. The definition of
the arithmetic by semimorphisms goes further, leading to simple compatibility prop-
erties such as (RG1,
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