All Finitely Axiomatizable Tense Logics of Linear Time Flows Are CoNP-complete
Łukasiewicz-Moisil Relation Algebras
Proof-Theoretic Functional Completeness for the Hybrid Logics of Everywhere and Elsewhere
Structural Subsumption and Least Common Subsumers in a Description Logic with Existential and Number Restrictions
On the Predicate Logic of Linear Kripke Frames and some of its Extensions
Igor Lavrov and Larisa Maksimova, Problems in Set Theory, Mathematical Logic and the Theory of Algorithms, Edited by Giovanna Corsi, Translated by Valentin Shehtman, Kluwer Academic/Plenum Publishers, New York, 2003, US$141.00, pp. xi + 282, ISBN 0-306-47712-2, hardbound