TY  - JOUR
AU  - L. D. Beklemishev
TI  - A simplified proof of arithmetical completeness theorem for provability logic $\mathbf{GLP}$
JO  - Trudy Matematicheskogo Instituta imeni V.A. Steklova
PY  - 2011
SP  - 32
EP  - 40
VL  - 274
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/TM_2011_274_a3/
LA  - ru
ID  - TM_2011_274_a3
ER  -