About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
A uniform approach to inductive posets and inductive closure
Abstract
The definition scheme, "A poset P is Z-inductive if it has a subposet B of Z-compact lements such that for every element of p of P there is a Z-set S in B such that p = {big square union}S, becomes meaningful when we replace the symbol of Z by such adjectives as "sirected", "chain", "pairwise compatible", "singleton", etc. Furthermore, several theorems have been proved that seem to differ only in their instantiations of Z. A simialr phenomena occurs when we comsider concepts such as Z-completeness of Z-comtinuity. This suggests that in all these different cases we are really talking about Z same thing. In this paper we show that this is indeed the case by abstracting out the essential common properties of the different instantiations of Z and proving common theorems within the resulting abstract framework. © 1978.