Search

A recurring hypothesis about the agreement phenomena generalized as closest‐conjunct agreement takes this pattern to result from reduced clausal conjunction, simply displaying the agreement of the verb with the nonconjoined subject of the clause whose content survives ellipsis (Aoun, Benmamoun & Sportiche 1994, 1999; see also Wilder 1997). Closest‐conjunct agreement is the dominant agreement pattern in the South Slavic languages Slovenian and Bosnian/Croatian/Serbian. A natural question is whether closest‐conjunct agreement in these varieties may indeed be analyzed as entirely derived from conjunction reduction. In this article, we report on two experiments conducted to test this. The results reject the hypothesis as far as these languages are concerned, thereby upholding the relevance of models developed to account for closest‐conjunct agreement within theories of agreement. [ABSTRACT FROM AUTHOR]

We test the hypothesis that children acquire knowledge of the successor function — a foundational principle stating that every natural number n has a successor n + 1 — by learning the productive linguistic rules that govern verbal counting. Previous studies report that speakers of languages with less complex count list morphology have greater counting and mathematical knowledge at earlier ages in comparison to speakers of more complex languages (e.g., Miller & Stigler, 1987). Here, we tested whether differences in count list transparency affected children's acquisition of the successor function in three languages with relatively transparent count lists (Cantonese, Slovenian, and English) and two languages with relatively opaque count lists (Hindi and Gujarati). We measured 3.5- to 6.5-year-old children's mastery of their count list's recursive structure with two tasks assessing productive counting, which we then related to a measure of successor function knowledge. While the more opaque languages were associated with lower counting proficiency and successor function task performance in comparison to the more transparent languages, a unique within-language analytic approach revealed a robust relationship between measures of productive counting and successor knowledge in almost every language. We conclude that learning productive rules of counting is a critical step in acquiring knowledge of recursive successor function across languages, and that the timeline for this learning varies as a function of count list transparency. [ABSTRACT FROM AUTHOR]