1. All Finitely Axiomatizable Tense Logics of Linear Time Flows Are CoNP-complete

   • Tadeusz Litak
   • Frank Wolter

   OriginalPaper Pages: 153 - 165

2. Łukasiewicz-Moisil Relation Algebras

   • Andrei Popescu

   OriginalPaper Pages: 167 - 189

3. Proof-Theoretic Functional Completeness for the Hybrid Logics of Everywhere and Elsewhere

   • Torben Braüner

   OriginalPaper Pages: 191 - 226

4. Structural Subsumption and Least Common Subsumers in a Description Logic with Existential and Number Restrictions

   • Ralf Küsters
   • Ralf Molitor

   OriginalPaper Pages: 227 - 259

5. On the Predicate Logic of Linear Kripke Frames and some of its Extensions

   • Dmitrij Skvortsov

   OriginalPaper Pages: 261 - 282

6. 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

   • Ewa Palka

   Book Reviews Pages: 283 - 292