A simplified proof of arithmetical completeness theorem for provability logic GLP (Q2510758)

From MaRDI portal
Revision as of 12:15, 5 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A simplified proof of arithmetical completeness theorem for provability logic GLP
scientific article

    Statements

    title
    A simplified proof of arithmetical completeness theorem for provability logic GLP (English)
    0 references
    author
    Lev D. Beklemishev
    0 references
    publication date
    4 August 2014
    0 references

    Identifiers

    zbMATH DE Number
    6324471
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2510758&oldid=2833257"
      Powered by MediaWiki