The higher dimensional propositional calculus

In recent research, some of the present authors introduced the concept of an n-dimensional Boolean algebra and its corresponding propositional logic nCL, generalizing the Boolean propositional calculus to n ≥ 2 perfectly symmetric truth values. This paper presents a sound and complete sequent calculus for nCL, named nLK. We provide two proofs of completeness: one syntactic and one semantic. The former implies as a corollary that nLK enjoys the cut admissibility property. The latter relies on the generalization to the n-ary case of the classical proof based on the Lindenbaum algebra of formulas and Boolean ultrafilters.