Table 1.

Algorithms.

Algorithm 1	If y is a member of a population and Y is a category (or a description of a category), then “y tte Y” can invoke the category Y, and propose the incumbency of y in Y (denoted y∈Y).
Algorithm 2	For a member of a population y and a category Y, if it has been established that y∈Y, then the subsequent marking of another member of the population x with mo “x mo” can assign x to the same category Y (i.e., x∈Y).
Algorithm 3	For a member of a population y and a category Y, if it has been established that y∈Y, then the subsequent marking of another member of the population x with wa “x wa” can exclude x from the category Y and simultaneously propose the existence of another category X to which x belongs, and a membership categorization device M in which X and Y are co-class categories (i.e., X is in the complement of Y in M).
Corollary to Algorithm 3	As a special case of Algorithm 3 above, if a category Y has been defined in such a way as to set up a binary opposition, then the membership categorization device M proposed will consist of only two categories Y and X, where X = ~Y (i.e., X is equal to the complement of Y)
Algorithm 4	For a member of a population x, if wa has been used to mark x but no membership categorization device has been implicitly or explicitly specified, then “x wa” may activate a “search procedure” to identify a membership categorization device M containing categories X and Y such that x ∈ X and Y is a co-class category of X in M.