定义划分上任意布尔运算的图论方法
A Graph-theoretic Method to Define any Boolean Operation on Partitions
摘要：
在19世纪，格运算join和meet被定义用于集合划分，但是在20世纪，没有新的关于划分的逻辑运算被定义和研究。然而，这里有一个简单而自然的图论方法来定义任何n元布尔运算。还定义了一个等价的闭包理论方法。最后，问题是解决为什么花了这么长的时间来定义所有的布尔操作的分区。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
