Abstract
The problem of enumerating the types of Boolean functions under the group of variable permutations and complementations was first stated by Jevons in the 1870s, but not solved in a satisfactory way until the work of Pólya in 1940. This paper explains the details of Pólya's solution, and also the history of the problem from the 1870s to the 1970s.
Citation
Alasdair Urquhart. "Enumerating types of Boolean functions." Bull. Symbolic Logic 15 (3) 273 - 299, September 2009. https://doi.org/10.2178/bsl/1246453975
Information
