Voir la notice de l'article provenant de la source Math-Net.Ru
@article{TM_2011_274_a3, author = {L. D. Beklemishev}, title = {A simplified proof of arithmetical completeness theorem for provability logic $\mathbf{GLP}$}, journal = {Trudy Matematicheskogo Instituta imeni V.A. Steklova}, pages = {32--40}, publisher = {mathdoc}, volume = {274}, year = {2011}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/TM_2011_274_a3/} }
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 -
%0 Journal Article %A L. D. Beklemishev %T A simplified proof of arithmetical completeness theorem for provability logic $\mathbf{GLP}$ %J Trudy Matematicheskogo Instituta imeni V.A. Steklova %D 2011 %P 32-40 %V 274 %I mathdoc %U http://geodesic.mathdoc.fr/item/TM_2011_274_a3/ %G ru %F TM_2011_274_a3
L. D. Beklemishev. A simplified proof of arithmetical completeness theorem for provability logic $\mathbf{GLP}$. Trudy Matematicheskogo Instituta imeni V.A. Steklova, Algorithmic aspects of algebra and logic, Tome 274 (2011), pp. 32-40. http://geodesic.mathdoc.fr/item/TM_2011_274_a3/