  We discuss the modifications of the Kripke trick simulating binary predicate
letters of classical first-order formulas with monadic modal first-order
formulas and the situations where the trick does not work. As a result, we
obtain results on algorithmic upper bounds for monadic fragments of some modal
and superintuitionistic first-order logics.
