Enumerating types of Boolean functions
Urquhart, Alasdair
Bull. Symbolic Logic, Tome 15 (2009) no. 1, p. 273-299 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
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.
Publié le : 2009-09-15
Classification:  
@article{1246453975,
     author = {Urquhart, Alasdair},
     title = {Enumerating types of Boolean functions},
     journal = {Bull. Symbolic Logic},
     volume = {15},
     number = {1},
     year = {2009},
     pages = { 273-299},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1246453975}
}

Urquhart, Alasdair. Enumerating types of Boolean functions. Bull. Symbolic Logic, Tome 15 (2009) no. 1, pp.  273-299. http://gdmltest.u-ga.fr/item/1246453975/