1. Ariola, Z. M., and H. Herbelin, Minimal classical logic and control operators, in J. C. M. Baeten, J. K. Lenstra, J. Parrow, and G. J. Woeginger (eds.), Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP 2003), Vol. 2719 of Lecture Notes in Computer Science, Springer, Berlin, 2003, pp. 871–885.
2. Bokov, G. V., Completeness problem in the propositional calculus, Intellectual Systems 13(1–4):165–182, 2009, (Russian), http://www.intsys.msu.ru/magazine/archive/v13(1-4)/bokov-165-182.pdf , (A correction in 17(1-4):543–544, 2013).
3. Chagrov, A, Undecidable properties of superintuitionistic logics, in S. V. Jablonskij, (ed.), Mathematical Problems of Cybernetics, Physmatlit, Moscow, Vol. 5, 1994, pp. 62–108, (Russian).
4. Chagrov A., Zakharyaschev M.: The undecidability of the disjunction property of propositional logics and other related problems. The Journal of Symbolic Logic 58(3), 967–1002 (1993)
5. Chagrov A., Zakharyaschev M.: Modal Logic, Vol. 35 of Oxford Logic Guides. Oxford University Press, New York (1997)