A Complete Axiomatization of Computer Arithmetic

DOI10.2307/2007607MaRDI QIDQ3694696zbMATH OpenOpenAlexFDO

Authors Richard Mansfield

Publication date 1984

Full work available at URL https://doi.org/10.2307/2007607

zbMATH Keywords

algebra of computer arithmeticaxiom system for rounded arithmeticnormal form theoremordered fieldordered groupordered integral domainreduction systemrounding function

Mathematics Subject Classification ID

Model theory (03C99) Algebraic structures (08A99) Field extensions (12F99) Ordered fields (12J15) Roundoff error (65G50) Theory of computing (68Q99)

Recommendations

• 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

Cited in

(5)

• 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)