Definability properties and the congruence closure (Q810007)

The author defines a notion of a thin quantifier and uses it to prove some interesting general results of the failure of the \(\Delta\)- interpolation theorem and Beth's definability theorem in logics defined from generalized quantifiers. Many of the results of the paper are connected to the failure of the uniform reduction property for quotients. A Lindström quantifier Q is \(\kappa\)-thin, if \((A,R_ 1,...,R_ n)\in Q\) and card(A)\(\geq \kappa\) imply that none of the relations \(R_ i\), \(i=1,...,m\), admits a set of card(A) indiscernibles. (A set \(I\subseteq Field(R)\) is a set of indiscernibles, if for all \(x_ 1,...,x_ n\in I\) and \(y_ 1,...,y_ n\in I\), \((x_ 1,...,x_ n)\in R\) iff \((y_ 1,...,y_ n)\in R.)\) Then a Lindström quntifier Q is called thin, if there is \(n\in \omega\) and a cardinal \(\kappa_ 0\) such that for all \(\kappa \geq \kappa_ 0\), Q is definable in models of power \(\kappa\) by means of a sentence of \(L_{\infty \omega}(T_{\kappa})\) of quantifier rank \(<n\), where \(T_{\kappa}\) is the collection of all \(\kappa\)-thin quantifiers. The thin quantifiers include (negations of) cardinality quantifiers, cofinality quantifiers, (negations of) Ramsey quantifiers, and several others.