2 citations · 3 across the 3 of their papers we have counts for
1 paper · 1 filter
Luka Mikec, Fedor Pakhomov, Mladen Vuković
We show that the decision problem for the basic system of interpretability logic IL is PSPACE-complete. For this purpose we present an algorithm which uses polynomial space with re…