Omitting uncountable types and the strength of [0,1]-valued logics

We study a class of [0,1]-valued logics. The main result of the paper is a maximality theorem that characterizes these logics in terms of a model-theoretic property, namely, an extension of the omitting types theorem to uncountable languages.