Complexity of Non-Classical Logics via Fragments
Published:Dec 29, 2025 14:47
•1 min read
•ArXiv
Analysis
This paper explores the computational complexity of non-classical logics (superintuitionistic and modal) by demonstrating polynomial-time reductions to simpler fragments. This is significant because it allows for the analysis of complex logical systems by studying their more manageable subsets. The findings provide new complexity bounds and insights into the limitations of these reductions, contributing to a deeper understanding of these logics.
Key Takeaways
Reference
“Propositional logics are usually polynomial-time reducible to their fragments with at most two variables (often to the one-variable or even variable-free fragments).”