- Fields, meadows and abstract data types
- Book title
- Pillars of computer science: Essays dedicated to Boris (Boaz) Trakhtenbrot on the occasion of his 85th birthday
- Pages (from-to)
- Number of pages
- Berlin: Springer
- Lecture notes in computer science
- Volume | Edition (Serie)
- Document type
- Faculty of Science (FNWI)
- Informatics Institute (IVI)
Fields and division rings are not algebras in the sense of "Universal Algebra", as inverse is not a total function. Mending the inverse by any definition of 0(-1) will not suffice to axiomatize the axiom of inverse x(-1) · x = 1, by an equation. In particular the theory of fields cannot be used for specifying the abstract data type of the rational numbers.
We define equational theories of Meadows and of Skew Meadows, and we prove that these theories axiomatize the equational properties of fields and of division rings, respectively, with 0(-1) = 0. Meadows are then used in the theory of Von Neumann regular ring rings to characterize strongly regular rings as those that support an inverse operation that turns it into a skew meadow. To conclude, we present in this framework the specification of the abstract type of the rational numbers, as developed by the first and third authors in .
- go to publisher's site
If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library, or send a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.