The higher dimensional propositional calculus

In recent work, the authors introduced the notion of n-dimensional Boolean algebra and the corresponding propositional logic nCL. In this paper, we introduce a sequent calculus for nCL and we show its soundness and completeness. Completeness relies on the generalisation to the n-ary case of the classical proof based on the Lindenbaum algebra of formulas and on Boolean ultrafilters.