SET THEORETIC MODELS FOR CLASSIFICATION AND RETRIEVAL

Abstract : The appropriateness of lattice models as analogues of classification and retrieval systems is analyzed. Models considered include simple distributive lattices, and implicative and subtractive lattices. A particular topological model is also considered. It is shown that any set of topological axioms will be reducible to a Boolean algebra when applied to finite spaces. (Author)