Aguilera Ozuna, J. P., & Bydžovský, J. (2024). Fundamental Logic Is Decidable. ACM Transactions on Computational Logic, 25(3), 1–14. https://doi.org/10.1145/3665328
Fundamental logic; non-classical logic; orthologic; sequent calculus
en
Abstract:
It is shown that Holliday's propositional Fundamental Logic is decidable in polynomial time and that first-order Fundamental Logic is decidable in double-exponential time. The proof also yields a double-exponential-time decision procedure for first-order orthologic.
