This article provides the first systematic account of relativization in Likpakpaln, an understudied Mabia (Gur) language of Ghana. Broadly speaking, Likpakpaln features two types of relative clauses: restrictive and non-restrictive. Both types of relative clauses are finite and marked by a relative pronoun as well as a clausal definite determiner. The first type is always headed by an indefinite noun. The second is invariably headed by a definite head noun, is additionally marked by a prosodic break, and is usually under focus. The relative pronoun is a composite form comprised of a noun class agreement marker and an invariant relative marker. A number of the features of relative clauses in Likpakpaln align it with other Mabia languages of the region, whereas others distinguish it from these languages. This analysis situates Likpakpaln within its genealogical and areal context while providing new typological perspectives on the Mabia languages as a whole.

We here examine the expressive power of first order logic with generalized quantifiers over finite ordered structures. In particular, we address the following problem: Given a family Q of generalized quantifiers expressing a complexity class C, what is the expressive power of first order logic FO(Q) extended by the quantifiers in Q? From previously studied examples, one would expect that FO(Q) captures LC, i.e., logarithmic space relativized to an oracle in C. We show that this is not always true. However, after studying the problem from a general point of view, we derive sufficient conditions on C such that FO(Q) captures LC. These conditions are fulfilled by a large number of relevant complexity classes, in particular, for example, by NP. As an application of this result, it follows that first order logic extended by Henkin quantifiers captures LNP. This answers a question raised by Blass and Gurevich [Ann. Pure Appl. Logic, vol. 32, 1986]. Furthermore we show that for many families Q of generalized quantifiers (including the family of Henkin quantifiers), each FO(Q)-formula can be replaced by an equivalent FO(Q)-formula with only two occurrences of generalized quantifiers. This generalizes and extends an earlier normal-form result by I. A. Stewart [Fundamenta Inform, vol. 18, 1993].