On the equivalence of boolean and weighted searching based on the convertibility of query forms

Consideration is given to the nature of the retrieval process with emphasis on the selection algorithm employed, and its relation to document set and query form. Proof is given of the equivalence of Boolean and weighted search methods, this proof being based on the ability to convert any Boolean search request to weighted form and, similarly, any weighted request to Boolean form.