Enumerating types of Boolean functions

Bulletin of Symbolic Logic 15 (3):273-299 (2009)
  Copy   BIBTEX

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,168

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2010-09-13

Downloads
24 (#659,625)

6 months
11 (#242,683)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Alasdair Urquhart
University of Toronto, St. George Campus

Citations of this work

No citations found.

Add more citations

References found in this work

The Development of Logic.William Kneale & Martha Kneale - 1962 - Studia Logica 15:308-310.
Symbolic Logic.John Venn - 1881 - Mind 6 (24):574-581.
The Principles of Science. A Treatise on Logic and Scientific Method.W. Stanley Jevons - 1960 - British Journal for the Philosophy of Science 11 (43):260-261.
On the Shoulders of Hipparchus.F. Acerbi - 2003 - Archive for History of Exact Sciences 57 (6):465-502.
Sur Les types Des propositions composees.G. Pólya - 1940 - Journal of Symbolic Logic 5 (3):98 - 103.

View all 8 references / Add more references