Translator Disclaimer
September 2009 Enumerating types of Boolean functions
Alasdair Urquhart
Bull. Symbolic Logic 15(3): 273-299 (September 2009). DOI: 10.2178/bsl/1246453975

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

Download 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

Published: September 2009
First available in Project Euclid: 1 July 2009

zbMATH: 1181.03002
MathSciNet: MR2604956
Digital Object Identifier: 10.2178/bsl/1246453975

Rights: Copyright © 2009 Association for Symbolic Logic

JOURNAL ARTICLE
27 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.15 • No. 3 • September 2009
Back to Top