On languages with non-homogeneous strings of quantifiers

It is shown that every linear string of quantifiers can be replaced by a well-ordered sequence of quantifiers. The results of this paper was part of the author’s Master Thesis, which was submitted to the Hebrew University in August, 1967. The work was done under the guidance of Professor H. Gaifman, whom I thank for his kind guidance, and his help to clarify the exposition in this article.