Finite complements trigger reality responses in attitude verb acquisition… but so do non-finite complements

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximal complements in finite groups

Let G be a finite group with a non-abelian minimal normal subgroup N which is a direct product of the simple group X. The maximal subgroups of G which complement N and their conjugacy classes are parametrised in terms of certain homomorphisms taking values in AutX and satisfying particular conditions.

متن کامل

Star Complements and Connectivity in Finite Graphs

Let G be a finite graph with H as a star complement for an eigenvalue other than 0 or −1. Let κ(G), δ(G) denote respectively the vertex-connectivity and minimum degree of G. We prove that κ(G) is controlled by δ(G) and κ(H). In particular, for each k ∈ IN there exists a smallest non-negative integer f(k) such that κ(G) ≥ k whenever κ(H) ≥ k and δ(G) ≥ f(k). We show that f(1) = 0, f(2) = 2, f(3)...

متن کامل

Finite Sets as Complements of Finite Unions of Convex Sets

Suppose S ⊆ R is a set of (finite) cardinality n whose complement can be written as the union of k convex sets. It is perhaps intuitively appealing that when n is large k must also be large. This is true, as is shown here. First the case in which the convex sets must also be open is considered, and in this case a family of examples yields an upper bound, while a simple application of a theorem ...

متن کامل

The overgeneralization of non-finite complements to finite contexts: the case of decide.

Current views on the acquisition of PRO can roughly be divided into two areas: lexical and syntactic accounts. We present data on one verb, decide, that yields data that not only differs from the data for other similar verbs with the same children, but does not lend itself easily to either type of account. Data from a sentence elicitation task conducted with 20 typically-developing children (4;...

متن کامل

Matching Subspaces with Complements in Finite Vector Spaces

Let C (n; q) denote the graph whose vertices are the subspaces of the n dimensional vector space V over GF (q) and whose edges are the pairs fX; Y g where X Y = V. We show that C (n; q) has a perfect matching if and only if q is odd or n is odd. If q and n are even and q > 2 we show there exist matchings which omit only one vertex.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the Linguistic Society of America

سال: 2020

ISSN: 2473-8689

DOI: 10.3765/plsa.v5i1.4701