Since relational monadic first-order logic has finite model property, its SAT problem is decidable. In H.Behmann's paper, he extended this result to fragment of SOL where all predicates, free and bound are monadic. I am not familiar with SOL and his paper was not written in English. Can you give me any hint to prove this result?

Thanks!