4 citations · 23 across the 11 of their papers we have counts for
Showing 2009 · cs.LOShow all
3 papers · 2 filters
cs.LO2009
Straight-line instruction sequence completeness for total calculation on cancellation meadows
Jan A. Bergstra, Inge Bethke
A combination of program algebra with the theory of meadows is designed leading to a theory of computation in algebraic structures which use in addition to a zero test and copying…
cs.LO2009★ 3 cited
The structure of finite meadows
Inge Bethke, Piet Rodenburg, Arjen Sevenster
A meadow is a commutative ring with a total inverse operator satisfying 0^{-1}=0. We show that the class of finite meadows is the closure of the class of Galois fields under finite…
cs.LO2009★ 2 cited
Square root meadows
Jan A. Bergstra, I. Bethke
Let Q_0 denote the rational numbers expanded to a meadow by totalizing inversion such that 0^{-1}=0. Q_0 can be expanded by a total sign function s that extracts the sign of a rati…