Enumerating types of Boolean functions
Alasdair Urquhart
Source: Bull. Symbolic Logic Volume 15, Issue 3 (2009), 273-299.
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.
Full-text: Access denied (no subscription detected)
Permanent link to this document: http://projecteuclid.org/euclid.bsl/1246453975
Digital Object Identifier: doi:10.2178/bsl/1246453975
Zentralblatt MATH identifier:
05608377
