Algebra of Approximate Computation
Karl Aberer · Birkhäuser Boston eBooks · 1995
In the following we study the construction of combinatory models that contain approximations to structures that satisfy a theory T with underlying first order language L. This will allow us to manipulate such approximations algebraically. The domain of these algebraic structures consists of approximations represented by sets of first order formulas, and the operations are the operations lifted from those of L. The domain of our combinatory model forms a complete lattice and thus provides a natural notion of approximation.