The higher dimensional propositional calculus
Antonio Bucciarelli, Pierre-Louis Curien, Antonio Ledda, Francesco Paoli, Antonino Salibra
Abstract
In recent research, some of the present authors introduced the concept of an n-dimensional Boolean algebra and its corresponding propositional logic nCL, generalising 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 generalisation to the n-ary case of the classical proof based on the Lindenbaum algebra of formulas and Boolean ultrafilters.
Create a lesson
Related papers
A Hoare Logic for Continuous-Time Stochastic Processes
Kei Imada, Justin Hsu
Properties of Public Announcements as Operators: Commutativity, Monotonicity, Idempotence, Fixed Points, and Stabilization
Eiji Yamada
Declarative DNS - Resolving Recursive Resolution
Felix Linker, Yue Huang, David Basin et al.
Spectral Stability, Fatou Basin Contraction, and Machine-Checked Multipliers in Holomorphic Extensions of Generalized Syracuse Dynamics
Volkan Dağlı, Zerrin Dağlı, Dağhan Dağlı et al.
Addressing Bias Early in the AI Lifecycle: Social Determinants of Health in Functional and Cognitive Assessment Labels of Nursing Home Residents
Isabel Amaya-Rodríguez, Cristina Martin, Nekane Larburu et al.
Decidability of Elementary Modal Logics is Undecidable
Jakub Michaliszyn