A shallow sequent calculus for FIK is introduced, shown cut-admissible, and used to prove EXPSPACE decidability, improving on the non-elementary conjecture for IK.
In: Proceed- ings of the 1st Conference on Theoretical Aspects of Reasoning about Knowledge (TARK) , pp
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Taming Complexity in Intuitionistic Modal Logic: The Case of FIK and Its Shallow Calculus
A shallow sequent calculus for FIK is introduced, shown cut-admissible, and used to prove EXPSPACE decidability, improving on the non-elementary conjecture for IK.