7
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      The Computational Complexity of Provability in Systems of Modal Propositional Logic

      SIAM Journal on Computing
      Society for Industrial & Applied Mathematics (SIAM)

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Related collections

          Author and article information

          Journal
          SIAM Journal on Computing
          SIAM J. Comput.
          Society for Industrial & Applied Mathematics (SIAM)
          0097-5397
          1095-7111
          September 1977
          September 1977
          : 6
          : 3
          : 467-480
          Article
          10.1137/0206033
          d6c88f94-fa4c-4b41-b0bb-2990ab381a65
          © 1977
          History

          Comments

          Comment on this article