Abstract
In this paper from 2011 we consider , the closed fragment of the basic interpretability logic . We show that we can translate , the one variable fragment of Gödel-Löb's provabilty logic , into . Invoking a result on the PSPACE completeness of we obtain the PSPACE hardness of .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.