Abstract
A 0-totalised field is a field in which division is a total operation with 0−1=0. Equational reasoning in such fields is greatly simplified but in deriving a term one still wishes to know whether or not the calculation has invoked 0−1. If it has not then we call the derivation division safe. We propose three methods of guaranteeing division safe calculations in 0-totalised fields.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Bergstra, J.A.: Elementary algebraic specifications of the rational function field. In: Beckmann, A., et al. (eds.) Logical Approaches to Computational Barriers. Proceedings of Computability in Europe 2006. Lecture Notes in Computer Science, vol. 3988, pp. 40–54. Springer, New York (2006)
Bergstra, J.A., Tucker, J.V.: The completeness of the algebraic specification methods for data types. Inf. Control 54, 186–200 (1982)
Bergstra, J.A., Tucker, J.V.: Initial and final algebra semantics for data type specifications: two characterisation theorems. SIAM J. Comput. 12, 366–387 (1983)
Bergstra, J.A., Tucker, J.V.: Algebraic specifications of computable and semicomputable data types. Theor. Comput. Sci. 50, 137–181 (1987)
Bergstra, J.A., Tucker, J.V.: Equational specifications, complete term rewriting systems, and computable and semicomputable algebras. J. ACM 42, 1194–1230 (1995)
Bergstra, J.A., Tucker, J.V.: The data type variety of stack algebras. Ann. Pure Appl. Log. 73, 11–36 (1995)
Bergstra, J.A., Tucker, J.V.: Elementary algebraic specifications of the rational complex numbers. In: Futatsugi, K., et al. (eds.) Algebra, Meaning and Computation. Goguen Festschrift. Lecture Notes in Computer Science, vol. 4060, pp. 459–475. Springer, New York (2006)
Bergstra, J.A., Tucker, J.V.: The rational numbers as an abstract data type. J. ACM 54(2), Article 7 (April 2007), 25 pages
Calkin, N., Wilf, H.S.: Recounting the rationals. Am. Math. Mon. 107, 360–363 (2000)
Goguen, J.A., Thatcher, J.W., Wagner, E.G.: An initial algebra approach to the specification, correctness and implementation of abstract data types. In: Yeh, R.T. (ed.) Current Trends in Programming Methodology. IV. Data Structuring, pp. 80–149. Prentice-Hall, Englewood Cliffs (1978)
Hirschfeld, Y.: Personal communication (August 2006)
Hodges, W.: Model Theory. Cambridge University Press, Cambridge (1993)
Kamin, S.: Some definitions for algebraic data type specifications. SIGLAN Not. 14(3), 28 (1979)
Meinke, K., Tucker, J.V.: Universal algebra. In: Abramsky, S., Gabbay, D., Maibaum, T. (eds.) Handbook of Logic in Computer Science. Mathematical Structures, vol. I, pp. 189–411. Oxford University Press, Oxford (1992)
Meseguer, J., Goguen, J.A.: Initiality, induction, and computability. In: Nivat, M. (ed.) Algebraic Methods in Semantics, pp. 459–541. Cambridge University Press, Cambridge (1986)
Moss, L.: Simple equational specifications of rational arithmetic. Discret. Math. Theor. Comput. Sci. 4, 291–300 (2001)
Stoltenberg-Hansen, V., Tucker, J.V.: Effective algebras. In: Abramsky, S., Gabbay, D., Maibaum, T. (eds.) Handbook of Logic in Computer Science. Semantic Modelling, vol. IV, pp. 357–526. Oxford University Press, Oxford (1995)
Stoltenberg-Hansen, V., Tucker, J.V.: Computable rings and fields. In: Griffor, E. (ed.) Handbook of Computability Theory, pp. 363–447. Elsevier, Amsterdam (1999)
Terese, K.: Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science, vol. 55. Cambridge University Press, Cambridge (2003)
Wechler, W.: Universal Algebra for Computer Scientists. EATCS Monographs in Computer Science. Springer, New York (1992)
Wirsing, M.: Algebraic specifications. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science. Formal Models and Semantics, vol. B, pp. 675–788. North-Holland, Amsterdam (1990)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License ( https://creativecommons.org/licenses/by-nc/2.0 ), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Bergstra, J.A., Tucker, J.V. Division Safe Calculation in Totalised Fields. Theory Comput Syst 43, 410–424 (2008). https://doi.org/10.1007/s00224-007-9035-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-007-9035-4