Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Simple Equational Sp ...
Article

Simple Equational Specifications of Rational Arithmetic

Lawrence S. Moss (1)
(1) Department of mathematics [Bloomington]
Download article
Open on HAL
Imported on
March 26, 2015
Published on
January 1, 2001
Last modified on
March 31, 2025
Volume 4
vol. 4:2
DOI
10.46298/dmtcs.280
License
https://about.hal.science/hal-authorisation-v1
Indicators
638
Views
659
Downloads

Simple Equational Specifications of Rational Arithmetic

Lawrence S. Moss (1)
(1) Department of mathematics [Bloomington]
Abstract
We exhibit an initial specification of the rational numbers equipped with addition, subtraction, multiplication, greatest integer function, and absolute value. Our specification uses only the sort of rational numbers. It uses one hidden function; that function is unary. But it does not use an error constant, or extra (hidden) sorts, or conditional equations. All of our work is elementary and self-contained.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • equational specification
  • hidden function symbols
  • rational numbers
Cited by

Source: OpenCitations

  • Meadows and the equational specification of division

    Theoretical Computer Science

    Authors : J.A. Bergstra ORCID, Y. Hirshfeld, J.V. Tucker ORCID

    Journal reference : Volume 410, 2008, pp. 1261-1271

    DOI : 10.1016/j.tcs.2008.12.015

  • Cancellation Meadows: A Generic Basis Theorem and Some Applications

    arXiv (Cornell University)

    Authors : J. A. Bergstra, I. Bethke, A. Ponse ORCID

    Journal reference : Volume 56, 2012, pp. 3-14

    DOI : 10.1093/comjnl/bxs028
Preview
Loading PDF preview...