Institute of Information Transmission Problems
Russian Academy of Sciences
B. Karetny 19
101447 Moscow
RUSSIA
shehtman@lpcs.math.msu.ru
The property of strong neighbourhood completeness was introduced in the first part of this paper. By modifying the ultrabouqet construction, we prove this property for all Kripke-complete normal K4-logics and for a large class of Kripke-complete polymodal logics (called `acyclic'). On the other hand, we present a simple counterexample of a polymodal logic with the f.m.p. which is not strongly neighbourhood complete.