In this paper we prove that Japaridze's Polymodal Logic is PSPACE-decidable. To show this, we describe a decision procedure for satisfiability on hereditarily ordered frames t...
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...