  In this paper we prove that the uniform one-dimensional guarded fragment,
which is a natural polyadic generalization of the guarded two-variable logic,
has the Craig interpolation property. We will also prove that the
satisfiability problem of uniform guarded fragment is NEXPTIME-complete.
