For any given consistently constructed message system M which contains within it a message schema M.F that describes M, a sufficiently complex message m cannot be unambiguously typed using only the information found in m.f.
Okay, it's probably not strictly true, but it seems to be that way often enough in practice.
