Switch to: References

Add citations

You must login to add citations.
  1. Enumerating types of Boolean functions.Alasdair Urquhart - 2009 - Bulletin of Symbolic Logic 15 (3):273-299.
    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.
    Download  
     
    Export citation  
     
    Bookmark