1. G. S. Boolos.The Logic of Provability. Cambridge University Press, 1993.
2. F. Bou. Complexity of strict implication. InAdvances in Modal Logic 5, pages 1-16, 2005.
3. S. R. Buss. The Boolean formula value problem is in ALOGTIME. InProc. 19th STOC, pages 123-131. ACM Press, 1987.
4. A. V. Chagrov. On the complexity of propositional logics. InComplexity Problems in Mathematical Logic, pages 80-90. Kalinin State University, 1985. In Russian.
5. A. V. Chagrov and M. N. Rybakov. How many variables does one need to prove PSPACE-hardness of modal logics. InAdvances in Modal Logic, volume 4, pages 71-82, 2002.