  We apply domino problems to give short proofs for some known theorems for the
classical predicate logic and to obtain lower bounds for complexity of modal
predicate logics defined by Noetherian orders as Kripke frames.
