Symmetric transrationals: the data type and the algorithmic degree of its equational theory

DOI10.1007/978-3-031-15629-8_4zbMath1524.68199MaRDI QIDQ6163881

Jan A. Bergstra, J. V. Tucker

Publication date: 26 July 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

floating-point arithmeticDiophantine problemrational numberscomputer arithmeticdata typescommon meadowstransrationals

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fracpairs and fractions over a reduced commutative ring
• Equational theories and universal theories of fields
• Hybrid I/O automata.
• Division by zero in non-involutive meadows
• The wheel of rational numbers as an abstract data type
• The Theory of Timed I/O Automata
• The rational numbers as an abstract data type
• Splinters of recursive functions
• Wheels on division by zero
• Logical Analysis of Hybrid Systems
• Division by Zero in Common Meadows
• Eager Equality for Rational Number Arithmetic

This page was built for publication: Symmetric transrationals: the data type and the algorithmic degree of its equational theory