Fundamental Logic Is Decidable
Juan P. Aguilera, Jan Bydžovský · ACM Transactions on Computational Logic · 2024
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.