Model-theoretic methods of analysis of computer arithmetic
From MaRDI portal
Recommendations
Cited in
(11)- Lookahead analysis in exact real arithmetic with logical methods
- Computer arithmetic: Logic, calculation, and rewriting
- Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
- A Complete Axiomatization of Computer Arithmetic
- Computational model theory: an overview
- scientific article; zbMATH DE number 1979550 (Why is no real title available?)
- scientific article; zbMATH DE number 2011585 (Why is no real title available?)
- scientific article; zbMATH DE number 2047465 (Why is no real title available?)
- PBINT, a logic for modelling search problems involving arithmetic
- Algebraic structure with partial operations and computational model for the arithmetic of bounded nonnegative numbers
- Application of Łukasiewicz logics to algorithm design
This page was built for publication: Model-theoretic methods of analysis of computer arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3434489)