Abstract

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 arithmetic [9, 5, 8]. This
system plays an important role in some recent applications of provability algebras in proof theory [2, 3]. However, an obstacle in the study
of GLP is
... read more