Lindstrom's theorem states that any extension of first order logic (FOL) more expressible than FOL fails to have either compactness or Lowenheim-Skolem. When I first read Lindstrom's theorem my first reaction was: "Does it mean incompleteness of any more expressible extension of FOL? And why this obviously important question isn't discussed in standard logic texts?" Standard extensions (such as second order logic) in fact are incomplete. After some attempts of proving incompleteness I found reference to Vaught's paper in which he proves completeness of extension of FOL by adding quantifier Qx = *"there are uncountably many x such that..."* It would be very interesting (at least for me) to understand complete extensions in general. Such an extensions may be of great importance, for instance, for computer science, because FOL isn't enough expressive for its purposes.

So, my questions are:

1) Do you know some other examples of complete FOL extensions?

2) Are there some results concerning characterization of complete FOL extensions?

3) Do you know any people, papers, books... studying general properties of FOL extensions?

Thanks in advance.