Author:
Ono Hiroakira,Nakamura Akira
Publisher
Springer Science and Business Media LLC
Subject
History and Philosophy of Science,Logic
Reference6 articles.
1. S.A. Cook,The complexity of theorem proving procedures, Proceedings of Third Annual ACM Symposium on Theory of Computing (1971) 151?158.
2. R.E. Ladner,The computational complexity of provability in systems of modal prepositional logic, SIAM J. on Computing, 6 (1977) 467?480.
3. R.P. McArthur,Tense logic D. Reidel, 1976.
4. H. Ono andA. Nakamura,The computational complexity of satisfiability of modal propositional logic S4.3. Tech. Rep. No.C-5, Dept. of Applied Math., Hiroshima Univ. (1979).
5. H. Rasiowa andR. Sikorski,The mathematics of metamathematics,Monografie Matematyczne 41, PWN, 1963.
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献