The Computational Complexity of Provability in Systems of Modal Propositional Logic (Q4149442)

From MaRDI portal
Revision as of 06:14, 26 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 3580505
Language Label Description Also known as
English
The Computational Complexity of Provability in Systems of Modal Propositional Logic
scientific article; zbMATH DE number 3580505

    Statements

    title
    The Computational Complexity of Provability in Systems of Modal Propositional Logic (English)
    0 references
    author
    Richard E. Ladner
    0 references
    publication date
    1977
    0 references

    Identifiers

    DOI
    10.1137/0206033
    0 references
    zbMATH DE Number
    3580505
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4149442&oldid=8614046"
      Powered by MediaWiki