We introduce a new property for classes of structures (or relational database instances), that we call bounded FO types. Then we prove that on such classes the expressive power of SOF collapses to rst order logic FO. As a consequence of this we prove that SOF is strictly included in SO.