<div class="csl-bib-body">
<div class="csl-entry">Aguilera Ozuna, J. P., & Bydžovský, J. (2024). Fundamental Logic Is Decidable. <i>ACM Transactions on Computational Logic</i>, <i>25</i>(3), 1–14. https://doi.org/10.1145/3665328</div>
</div>
-
dc.identifier.issn
1529-3785
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/209206
-
dc.description.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.