The Computational Complexity of Provability in Systems of Modal Propositional Logic
- 1 September 1977
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 6 (3) , 467-480
- https://doi.org/10.1137/0206033
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- Space-bounded reducibility among combinatorial problemsJournal of Computer and System Sciences, 1975
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970
- Semantical Analysis of Modal Logic I Normal Modal Propositional CalculiMathematical Logic Quarterly, 1963
- Some theorems about the sentential calculi of Lewis and HeytingThe Journal of Symbolic Logic, 1948