1. H. Sinaceur, “Address at the Princeton University bicentennial conference on problems of mathematics (December 17-19, 1946),” by Alfred Tarski, Bull. Symb. Log., 6, No. 1, 1-44 (2000).
2. S. Linial and E. L. Post, “Recursive unsolvability of the deducibility, Tarski’s completeness, and independence of axioms problems of the propositional calculus,” Bull. Am. Math. Soc., 55, 50 (1949).
3. A. V. Kuznetsov, “Undecidability of general problems of completeness, decidability and equivalence for propositional calculi,” Algebra Logika, 2, No. 4, 47-66 (1963).
4. G. V. Bokov, “Undecidability of the problem of recognizing axiomatizations for propositional calculi with implication,” Log. J. IGPL, 23, No. 2, 341-353 (2015).
5. G. V. Bokov, “Undecidable problems for propositional calculi with implication,” Log. J. IGPL, 24, No. 5, 792-806 (2016).