• Corpus ID: 96443280

UvA-DARE ( Digital Academic Repository ) Inversive meadows and divisive meadows

  title={UvA-DARE ( Digital Academic Repository ) Inversive meadows and divisive meadows},
  author={Jan A. Bergstra and Cornelis A. Middelburg},
Inversive meadows are commutative rings with a multiplicative identity element and a total multiplicative inverse operation satisfying 0−1 = 0. Divisive meadows are inversive meadows with the multiplicative inverse operation replaced by a division operation. We give finite equational specifications of the class of all inversive meadows and the class of all divisive meadows. It depends on the angle from which they are viewed whether inversive meadows or divisive meadows must be considered more… 

UvA-DARE ( Digital Academic Repository ) Decision Taking versus Promise Issuing

An alignment is developed between the terminology of outcom e riented decision taking and a terminology for promise issuing and two forms are distinguished: the exter nal outcome delivering form and internalized decision taking.



Inversive meadows and divisive meadows

Arithmetical meadows

This work introduces variants of inversive and divisive meadows without an additive identity element and an additive inverse operation and gives equational axiomatizations of several classes of such variants.

Meadows and the equational specification of division

Skew Meadows

A skew meadow is a non-commutative ring with an inverse operator satisfying two special equations and in which 0−1 = 0. All skew fields and products of skew fields can be viewed as skew meadows.

A generic basis theorem for cancellation meadows

Let Q0 denote the rational numbers expanded to a “meadow”, that is, after taking its zero-totalized form (0 1 = 0) as the preferred interpretation. In this paper we consider “cancellation meadows”,

The initial meadows

The initial algebra of the meadows of characteristic 0 is determined and a normal form theorem is proved for it and the decidability of the closed term problem for meadows and the computability of their initial object is obtained.

Partial Komori fields and imperative Komori fields

This paper gives a simple account of how mathematicians deal with 1 / 0 in which a customary convention among mathematicians plays a prominent part, and makes plausible that a convincing account by means of some logic of partial functions is not attainable.

The rational numbers as an abstract data type

An equational specification of the field operations on the rational numbers under initial algebra semantics using just total field operations and 12 equations is given, which results in 0−1 = 0, an interesting equation consistent with the ring axioms and many properties of division.

Categories of theories and interpretations

In this paper we study categories of theories and interpretations. In these categories, notions of sameness of theories, like synonymy, bi-interpretability and mutual interpretability, take the

Theorem Proving with the Real Numbers

HOL extends Church's system by allowing also 'type variables' which give a form of polymorphism, and is capable not only of deciding whether it has a type, but inferring a most general type for it if it does.