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

Download Edit this record How to cite View on PhilPapers
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.
PhilPapers/Archive ID
Revision history
Archival date: 2019-06-11
View upload history
References found in this work BETA
An Introduction to Partition Logic.David Ellerman - 2014 - Logic Journal of the IGPL 22 (1):94-125.
General Theory of Natural Equivalences.MacLane, Saunders & Eilenberg, Samuel

Add more references

Citations of this work BETA

No citations found.

Add more citations

Added to PP index

Total views
84 ( #35,876 of 50,385 )

Recent downloads (6 months)
22 ( #26,753 of 50,385 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks to external links.