4 citations · 23 across the 11 of their papers we have counts for
6 papers · 1 filter
Note on paraconsistency and reasoning about fractions
Jan A. Bergstra, Inge Bethke
We apply a paraconsistent logic to reason about fractions.
On the contribution of backward jumps to instruction sequence expressiveness
Jan A. Bergstra, Inge Bethke
We investigate the expressiveness of backward jumps in a framework of formalized sequential programming called program algebra. We show that - if expressiveness is measured in term…
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…
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…
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…
A process algebra based framework for promise theory
Jan Bergstra, Inge Bethke, Mark Burgess
We present a process algebra based approach to formalize the interactions of computing devices such as the representation of policies and the resolution of conflicts. As an example…