Back to Search
Start Over
Fundamental Logic Is Decidable.
- Source :
- ACM Transactions on Computational Logic; Jul2024, Vol. 25 Issue 3, p1-14, 14p
- Publication Year :
- 2024
-
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. [ABSTRACT FROM AUTHOR]
- Subjects :
- FIRST-order logic
PROPOSITION (Logic)
POLYNOMIAL time algorithms
LOGIC
CALCULUS
Subjects
Details
- Language :
- English
- ISSN :
- 15293785
- Volume :
- 25
- Issue :
- 3
- Database :
- Complementary Index
- Journal :
- ACM Transactions on Computational Logic
- Publication Type :
- Academic Journal
- Accession number :
- 178736160
- Full Text :
- https://doi.org/10.1145/3665328