Boolean Algebra Of Partitions
Boolean Algebra of Partitions is a mathematical structure that organizes the set of all partitions of a given set into a Boolean algebra, where the operations of join and meet are defined by the refinement and coarsening of partitions, respectively, and complementation is defined via a symmetric difference analog, thereby forming a lattice-theoretic analog of a Boolean algebra in the context of partition logic.
7
Publications
121
Citations
12
Authors
8
Institutions
Publications per year
2017–2026
0
Parents
7
Boolean Hierarchies of Partitions over a Reducible Base
Victor Selivanov · Algebra and Logic · 2004 · 28 citations
1–5 of 7
12
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 12
8

University of Milan
Milan, Italy
2 h-index
4 publications
57 citations

Institute for Advanced Study
Princeton, United States
1 h-index
1 publications
10 citations
Aurel Vlaicu University of Arad
Arad, Romania
1 h-index
1 publications
19 citations

Spiru Haret University
Bucharest, Romania
1 h-index
2 publications
38 citations
National Center for Mathematics and Interdisciplinary Sciences
Beijing, China
1 h-index
1 publications
22 citations

Capital Normal University
Beijing, China
1 h-index
2 publications
44 citations

Novosibirsk State Technical University
Novosibirsk, Russia
1 h-index
1 publications
28 citations

Zhejiang University
Hangzhou, China
1 h-index
1 publications
22 citations
1–8 of 8
1 publications · 10 citations
1
h-index
1 publications · 22 citations
1
h-index
1 publications · 15 citations
1
h-index
1 publications · 15 citations
1
h-index
1 publications · 12 citations
1
h-index
1–5