| |
| 2001 | ||
|---|---|---|
| 3 | Nikolai Kossovski: Computational complexity of quantifier-free negationless theory of field of rational numbers. Ann. Pure Appl. Logic 113(1-3): 175-180 (2001) | |
| 1999 | ||
| 2 | Nikolai Kossovski, Artem Tishkov, V. Iaroslavski: The Propositional n-Agent Logic. CEEMAS 1999 | |
| 1998 | ||
| 1 | Nikolai Kossovski, Artem Tishkov: Specifications by quantifier-free theory of superlinear inequalities and complexity of its decidability. Sci. Ann. Cuza Univ. 8: 114-120 (1998) | |
| 1 | V. Iaroslavski | [2] |
| 2 | Artem Tishkov | [1] [2] |