The rational numbers as an abstract data type
From MaRDI portal
(Redirected from Publication:3546326)
Recommendations
- Simple equational specifications of rational arithmetic
- Logical Approaches to Computational Barriers
- Elementary Algebraic Specifications of the Rational Complex Numbers
- Most General Algebraic Specifications for an Abstract Datatype of Rational Numbers
- Meadows and the equational specification of division
Cited in
(36)- Meadows and the equational specification of division
- Division safe calculation in totalised fields
- Rational terms and rational numbers
- An abstract data type for real numbers
- Division by zero in non-involutive meadows
- Partial arithmetical data types of rational numbers and their equational specification
- Arithmetical datatypes with true fractions
- The wheel of rational numbers as an abstract data type
- The structure of finite meadows
- Equations for formally real meadows
- Simple equational specifications of rational arithmetic
- Fracpairs and fractions over a reduced commutative ring
- Transformation of fractions into simple fractions in divisive meadows
- A process calculus with finitary comprehended terms
- Inversive meadows and divisive meadows
- Most General Algebraic Specifications for an Abstract Datatype of Rational Numbers
- Division by zero in common meadows
- Straight-line instruction sequence completeness for total calculation on cancellation meadows
- Elementary Algebraic Specifications of the Rational Complex Numbers
- Datatype defining rewrite systems for naturals and integers
- Logical Approaches to Computational Barriers
- Eager Equality for Rational Number Arithmetic
- Symmetric transrationals: the data type and the algorithmic degree of its equational theory
- On system rollback and totalized fields: an algebraic approach to system change
- Imperative process algebra and models of parallel computation
- Which arithmetical data types admit fracterm flattening?
- Towards an enumeration of finite common meadows
- Strolling through common meadows
- Logical models of mathematical texts: the case of conventions for division by zero.
- Bridging meadows and sheaves
- Logical models of mathematical texts. II: legality conventions for division by zero in inconsistent contexts
- Semantics of division for polynomial solvers
- For rational numbers with Suppes-Ono division, equational validity is one-one equivalent with Diophantine unsolvability
- A complete finite axiomatisation of the equational theory of common meadows
- Instruction sequence processing operators
- MetiTarski: An automatic theorem prover for real-valued special functions
This page was built for publication: The rational numbers as an abstract data type
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546326)
