An Undecidable Problem in Correspondence Theory. - L. A. Chagrova (J. Symb. Log., 1991)

The Decidability of Dependency in Intuitionistic Propositional Logic. - Dick De Jongh; L. A. Chagrova (J. Symb. Log., 1995)

Algorithmic problems concerning first-order definability of modal formulas on the class of all finite frames. - Alexander V. Chagrov; L. A. Chagrova (Stud Logica, 1995)

On the Degree of Neighborhood Incompleteness of Normal Modal Logics. - Lilia Chagrova (Advances in Modal Logic, 1996)

The Truth About Algorithmic Problems in Correspondence Theory. - Alexander V. Chagrov; Lilia Chagrova (Advances in Modal Logic, 2006)