  In this paper, the author presents algorithms that allow determining the
number of fixed points in permutations of a set of monotone Boolean functions.
Then, using Burnside's lemma, the author determines the number of inequivalent
monotone Boolean functions of 8 variables. The number obtained is
1,392,195,548,889,993,358.
