This paper addresses the semantics and pragmatics of singular and plural nominals in languages that manifest a binary morphological number distinction within this category. We review the main challenges such an account has to meet, and develop an analysis which treats the plural morpheme as semantically relevant, and the singular form as not contributing any number restriction on its own but ac...

Perhaps the best-known fact about developmental speech perception is that infants are remarkably adept at discriminating phonetic contrasts. In early infancy, this ability is unaffected by language environment, resulting in the surprising fact that infants can discriminate certain foreign contrasts that their parents cannot. For example, infants from English-speaking homes can hear the differen...

We examined the perception of Italian (IT) and Japanese (JP) consonant length contrasts (singleton vs geminate) in two groups of listeners: native speakers of IT and Australian English (OZ). Our preliminary results suggest that the IT listeners’ experience with singleton/geminate contrasts was more beneficial than the OZ listeners’ experience with vowel length contrasts in processing JP singlet...

18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 Fruit color changes during ripening are typically viewed as an adaptation to increase signal efficacy to seed dispersers. Plants can increase signal efficacy by enhancing chromatic (wavelength-related) and/or achromatic (intensity-related) contrasts between fruit and background. To assess how these contrasts determine the d...

in this paper, some results of singh, gopalakrishna and kulkarni (1970s) have been extended to higher order derivatives. it has been shown that, if $sumlimits_{a}theta(a, f)=2$ holds for a meromorphic function $f(z)$ of finite order, then for any positive integer $k,$ $t(r, f)sim t(r, f^{(k)}), rrightarrowinfty$ if $theta(infty, f)=1$ and $t(r, f)sim (k+1)t(r, f^{(k)}), rrightarrowinfty$ if $th...

Let A be a zero-sum free subset of Zn with |A| = k. We compute for k ≤ 7 the least possible size of the set of all subset-sums of A.

0≤n<x:n≡l( mod m) (−1)g In the case q = 2 we write Sm,l,2 = Sm,l, σ2(n) = σ(n). We call (2) a generalized Newman sum. In [7] we gave a quite another proof of the Coquet’s estimates for S3,0(x) and a fast algorithm for its calculation. Professor J.-P.Allouche kindly informed me about a misprint in Coquet’s theorem: for odd x η = η(x) = (−1) (but (−1) as in [2]; sf. [1], pp.98-99) An important ro...