%0 Journal Article
%A L. D. Beklemishev
%T A simplified proof of arithmetical completeness theorem for provability logic $\mathbf{GLP}$
%J Informatics and Automation
%D 2011
%P 32-40
%V 274
%I mathdoc
%U http://geodesic.mathdoc.fr/item/TRSPY_2011_274_a3/
%G ru
%F TRSPY_2011_274_a3