- A. V. Chagrov, L. A. Chagrova, “Algorithmic problems concerning first-order definability of modal formulas on the class of all finite frames”, Stud Logica, 55, no. 3, 1995, 421
- M. Zakharyaschev, F. Wolter, A. Chagrov, Handbook of Philosophical Logic, 2001, 83
- Evgeny Zolin, “Undecidability of the Problem of Recognizing Axiomatizations of Superintuitionistic Propositional Calculi”, Stud Logica, 102, no. 5, 2014, 1021
- H. Naruse, H. Ono, Bayu Surarso, “A Syntactic Approach to Maksimova's Principle of Variable Separation for Some Substructural Logics”, Notre Dame J. Formal Logic, 39, no. 1, 1998
- GEORGE F. SCHUMM, “Why does Halldén‐completeness matter?”, Theoria, 59, no. 1-3, 1993, 192
- M. V. Stukachyova, “Canonical formulas for a paraconsistent analog of the Scott logic”, Algebra Logic, 48, no. 4, 2009, 282
- Michael Zakharyaschev, 7, Advances in Intensional Logic, 1997, 195
- Dov M. Gabbay, Larisa L. Maksimova, Handbook of Philosophical Logic, 2011, 67
- WESLEY H. HOLLIDAY, TADEUSZ LITAK, “COMPLETE ADDITIVITY AND MODAL INCOMPLETENESS”, The Review of Symbolic Logic, 12, no. 3, 2019, 487
- 151, Residuated Lattices: An Algebraic Glimpse at Substructural Logics, 2007, 463