Specifications by quantifier-free theory of superlinear inequalities and complexity of its decidability. - Nikolai Kossovski; Artem Tishkov (Sci. Ann. Cuza Univ., 1998)

The Propositional n-Agent Logic. - Nikolai Kossovski; Artem Tishkov; V. Iaroslavski (CEEMAS, 1999)

Computational complexity of quantifier-free negationless theory of field of rational numbers. - Nikolai Kossovski (Ann. Pure Appl. Log., 2001)