Lev Beklemishev, Lecture Notes in Computer Science, 6618, Logic, Language, and Computation, 2011, 1
Grigori Mints, Lecture Notes in Computer Science, 6642, Logic, Language, Information and Computation, 2011, 201
G. Sereny, “How do We Know that the Godel Sentence of a Consistent Theory Is True?”, Philosophia Mathematica, 19:1 (2011), 47
Beklemishev L.D., “Kripke semantics for provability logic GLP”, Ann. Pure Appl. Logic, 161:6 (2010), 756–774
Sergei Artemov, International Mathematical Series, 5, Mathematical Problems from Applied Logic II, 2007, 1
Sergei Artemov, Studies in Logic and Practical Reasoning, 3, Handbook of Modal Logic, 2007, 927
Beklemishev L.D., Joosten J.J., Vervoort M., “A finitary treatment of the closed fragment of Japaridze's provability logic”, J. Logic Comput., 15:4 (2005), 447–463