Learn More
In this paper we consider the question of how much space is needed to represent a set. Given a finite universe U and some subset V (called the vocabulary), an <underline>exact membership tester</underline> is a procedure that for each element s in U determines if s is in V. An <underline>approximate membership tester</underline> is allowed to make mistakes:(More)
Given partially ordered sets (posets) P and Q, it is often useful to construct maps g:P&#x02192;Q which are chain-continuous: least upper bounds (supremums) of nonempty linearly ordered subsets are preserved. Chaincontinuity is analogous to topological continuity and is generally much more difficult to verify than isotonicity: the preservation of the order(More)