A graph-theoretic method to define any Boolean operation on partitions

DOI10.26493/2590-9770.1259.9D5MaRDI QIDQ5198036zbMATH OpenOpenAlexWikidataFDO

Authors David P. Ellerman

Publication date 2 October 2019

Published in The Art of Discrete and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1906.04539

zbMATH Keywords

Boolean operationsclosure-theoretic methodsgraph-theoretic methodsset partitions

Mathematics Subject Classification ID

Logical aspects of lattices and related structures (03G10) Partitions of sets (05A18)

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.

Recommendations

• scientific article; zbMATH DE number 4028949
• Visualizing Boolean operations on a hypercube
• Boolean graphs -- a survey
• Coverings of Boolean graphs
• scientific article; zbMATH DE number 4033798

Cites work

• An introduction to partition logic
• General Theory of Natural Equivalences
• scientific article; zbMATH DE number 1577993 (Why is no real title available?)
• scientific article; zbMATH DE number 5838699 (Why is no real title available?)
• scientific article; zbMATH DE number 3796014 (Why is no real title available?)
• scientific article; zbMATH DE number 937365 (Why is no real title available?)
• Identities in Finite Partition Lattices
• The logic of partitions: introduction to the dual of the logic of subsets
• Theory of equivalence relations

Cited in

(1)

• Factoring Boolean functions using graph partitioning

This page was built for publication: A graph-theoretic method to define any Boolean operation on partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5198036)