A Complete Axiomatization of Computer Arithmetic
The author defines an axiom system for rounded arithmetic to be complete iff from any model of the axioms we can recover the exact algebra from whence it came. There are some earlier attempts to axiomatize the algebra of computer arithmetic, but none of them considers the problem of giving a complete axiomatization (in the above sense). The author gradually introduces 45 axioms, culminating with a proof of the following Theorem: If \(<S,\leq 0,1,+,-,*,r_*>\) satisfies axioms 1- 45, then there is an ordered field F extending S and a rounding function O mapping F onto S satisfying the conditions: \(O(O(x))=O(x)\), \(x\leq y\) implies O(x)\(\leq O(y)\), \(O(0)=0\), \(O(1)=1\) and \(O(-x)=-O(x).\) The proof of the above theorem occupies nearly 10 printed pages and as main steps in the proof we mention a (weak) normal form theorem for some reduction system and the ordered group and ordered integral domain case of the main theorem.
- A computational interpretation of the axiom of determinacy in arithmetic
- scientific article; zbMATH DE number 1531922
- scientific article; zbMATH DE number 3322506
- The computational content of arithmetical proofs
- scientific article; zbMATH DE number 3904571
- Model-theoretic methods of analysis of computer arithmetic
- On strictly arithmetical completeness in logics of programs
- Computable Structure Theory
- Logical Approaches to Computational Barriers
- On the available partial respects in which an axiomatization for real valued arithmetic can recognize its consistency
- Proofs of conjectures on machine arithmetic lying at the base of localizing computations
- scientific article; zbMATH DE number 4039134 (Why is no real title available?)
- Algorithmic Procedures
- Zur Axiomatisierung logarithmischer und halblogarithmischer Zahlensysteme. (On the axiomatization of logarithmic and semi-logarithmic number systems)
This page was built for publication: A Complete Axiomatization of Computer Arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3694696)