|
|
Publications in Math-Net.Ru
-
The simple substitution property for superintuitionistic propositional logics and its relation to the separability property
Izv. RAN. Ser. Mat., 67:2 (2003), 181–210
-
Separability of normalizable superintuitionistic propositional logics
Mat. Zametki, 64:4 (1998), 606–615
-
On the embeddability of some generalizations of pseudo-Boolean
algebras
Dokl. Akad. Nauk, 350:2 (1996), 174–177
-
On representation of finite pseudo-Boolean algebras and one of its applications
Mat. Zametki, 52:2 (1992), 127–137
-
On superintuitionistic propositional logics connected with partially ordered sets
Izv. Akad. Nauk SSSR Ser. Mat., 55:2 (1991), 384–406
-
Properties of superintuitionistic propositional calculi
Sibirsk. Mat. Zh., 31:6 (1990), 158–175
-
On the problem of separability for superintuitionistic propositional logics
Dokl. Akad. Nauk SSSR, 254:4 (1980), 820–823
-
A separability theorem for superintuitionistic propositional calculi
Dokl. Akad. Nauk SSSR, 229:6 (1976), 1327–1329
-
The complexity of the realization of propositional formulae
Dokl. Akad. Nauk SSSR, 195:5 (1970), 1050–1051
-
The complexity of the algorithms that are connected with the realization of logico-arithmetical and propositional formulae
Dokl. Akad. Nauk SSSR, 191:5 (1970), 1004–1006
© , 2024