Abstract
Abstract In recent research, some of the present authors introduced the concept of an $n$-dimensional Boolean algebra and its corresponding propositional logic $n\textrm{CL}$, generalizing the Boolean propositional calculus to $n\geq 2$ perfectly symmetric truth values. This paper presents a sound and complete sequent calculus for $n\textrm{CL}$, named $n\textrm{LK}$. We provide two proofs of completeness: one syntactic and one semantic. The former implies as a corollary that $n\textrm{LK}$ 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
