Trudy Matematicheskogo Instituta imeni V.A. Steklova
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Forthcoming papers
Archive
Impact factor
Guidelines for authors
License agreement

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Trudy Mat. Inst. Steklova:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Trudy Matematicheskogo Instituta imeni V.A. Steklova, 2011, Volume 274, Pages 32–40 (Mi tm3313)  
This article is cited in 10 scientific papers (total in 10 papers)

A simplified proof of arithmetical completeness theorem for provability logic $\mathbf{GLP}$

L. D. Beklemishev

Steklov Mathematical Institute, Russian Academy of Sciences, Moscow, Russia
Full-text PDF (199 kB) Citations (10)
References:
PDF
HTML
Abstract: We present a simplified proof of Japaridze's arithmetical completeness theorem for the well-known polymodal provability logic $\mathbf{GLP}$. The simplification is achieved by employing a fragment $\mathbf J$ of $\mathbf{GLP}$ that enjoys a more convenient Kripke-style semantics than the logic considered in the papers by Ignatiev and Boolos. In particular, this allows us to simplify the arithmetical fixed point construction and to bring it closer to the standard construction due to Solovay.
Received in November 2010
English version:
Proceedings of the Steklov Institute of Mathematics, 2011, Volume 274, Pages 25–33
DOI: https://doi.org/10.1134/S0081543811060046
Bibliographic databases:
Document Type: Article
UDC: 510.652+510.643
Language: Russian
Citation: L. D. Beklemishev, “A simplified proof of arithmetical completeness theorem for provability logic $\mathbf{GLP}$”, Algorithmic aspects of algebra and logic, Collected papers. Dedicated to Academician Sergei Ivanovich Adian on the occasion of his 80th birthday, Trudy Mat. Inst. Steklova, 274, MAIK Nauka/Interperiodica, Moscow, 2011, 32–40; Proc. Steklov Inst. Math., 274 (2011), 25–33
Citation in format AMSBIB
\Bibitem{Bek11}
\by L.~D.~Beklemishev
\paper A simplified proof of arithmetical completeness theorem for provability logic $\mathbf{GLP}$
\inbook Algorithmic aspects of algebra and logic
\bookinfo Collected papers. Dedicated to Academician Sergei Ivanovich Adian on the occasion of his 80th birthday
\serial Trudy Mat. Inst. Steklova
\yr 2011
\vol 274
\pages 32--40
\publ MAIK Nauka/Interperiodica
\publaddr Moscow
\mathnet{http://mi.mathnet.ru/tm3313}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2962934}
\elib{https://elibrary.ru/item.asp?id=16766470}
\transl
\jour Proc. Steklov Inst. Math.
\yr 2011
\vol 274
\pages 25--33
\crossref{https://doi.org/10.1134/S0081543811060046}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000295983200003}
\elib{https://elibrary.ru/item.asp?id=23964488}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84885298538}
Linking options:
  • https://www.mathnet.ru/eng/tm3313
  • https://www.mathnet.ru/eng/tm/v274/p32
    • This publication is cited in the following 10 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Труды Математического института имени В. А. Стеклова Proceedings of the Steklov Institute of Mathematics
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024