  We present a proof system for the provability logic GLP in the formalism of
nested sequents and prove the cut elimination theorem for it. As an
application, we obtain the reduction of GLP to its important fragment called J
syntactically.
