Fields, meadows and abstract data types
| Authors |
|
|---|---|
| Publication date | 2008 |
| Host editors |
|
| Book title | Pillars of computer science: Essays dedicated to Boris (Boaz) Trakhtenbrot on the occasion of his 85th birthday |
| ISBN |
|
| Series | Lecture notes in computer science, 4800 |
| Pages (from-to) | 166-178 |
| Number of pages | 681 |
| Publisher | Berlin: Springer |
| Organisations |
|
| Abstract |
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 [2]. |
| Document type | Chapter |
| Published at | https://doi.org/10.1007/978-3-540-78127-1_10 |
| Permalink to this page | |
