| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 421792 | Electronic Notes in Theoretical Computer Science | 2011 | 8 Pages |
Abstract
In this paper we consider IL0, the closed fragment of the basic interpretability logic IL. We show that we can translate GL1, the one variable fragment of Gödel-Löbʼs provabilty logic GL, into IL0. Invoking result on the PSPACE completeness of GL1 we obtain the PSPACE hardness of IL0.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
