CitedEvidence
User Settings
Article

SET THEORETIC MODELS FOR CLASSIFICATION AND RETRIEVAL,

Richard Jernigan,Alfred G. Dale-1964-11-01-Defense Technical Information Center (DTIC)
1

TL;DRAbstract

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)

Chat with Paper

AI Agents for this Paper

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)

Keywords

AxiomSubtractive colorMathematicsDistributive latticeLattice (music)Set (abstract data type)Distributive propertyAlgebra over a field

Chat

Click to start Chat