A Graph-theoretic Method to Define any Boolean Operation on Partitions

The Art of Discrete and Applied Mathematics 2 (2):1-9 (2019)
  Copy   BIBTEX

Abstract

The lattice operations of join and meet were defined for set partitions in the nineteenth century, but no new logical operations on partitions were defined and studied during the twentieth century. Yet there is a simple and natural graph-theoretic method presented here to define any n-ary Boolean operation on partitions. An equivalent closure-theoretic method is also defined. In closing, the question is addressed of why it took so long for all Boolean operations to be defined for partitions.

Author's Profile

David Ellerman
University of Ljubljana

Analytics

Added to PP
2019-06-11

Downloads
280 (#52,733)

6 months
51 (#71,005)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?