Learn More
We study the expressive power of open formulas of dependence logic introduced in Väänänen [Dependence logic (Vol. 70 of London Mathematical Society Student Texts), 2007]. In particular, we answer a question raised by Wilfrid Hodges: how to characterize the sets of teams definable by means of identity only in dependence logic, or equivalently in independence(More)
We study definability in terms of monotone generalized quantifiers satisfying Isomorphism closure, Conservativity and Extension. Among the quantifiers with the latter three properties — here called CE quan-tifiers — one finds the interpretations of determiner phrases in natural languages. The property of monotonicity is also linguistically ubiquitous ,(More)