Embedded finite complements, indexical shift, and binding in Tsez
نویسندگان
چکیده
منابع مشابه
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)...
متن کاملNow: Between Indexical Thoughts and Indexical Thought
It has long been argued that rational action necessitates having indexical thoughts. The ability to understand and generate indexical expressions is also a precondition for interacting in natural language. A rational acting agent that interacts in natural language is, thus, required to develop a proper treatment of indexicality. Treatments of indexicality in the literature have, almost always, ...
متن کاملON THE STRUCTURE OF FINITE PSEUDO- COMPLEMENTS OF QUADRILATERALS AND THEIR EMBEDDABILITY
A pseudo-complement of a quadrilateral D of order n, n, > 3, is a non-trivial (n+l)- regular linear space with n - 3n + 3 points and n + n - 3 lines. We prove that if n > 18 and D has at least one line of size n - 1, or if n > 25 , then the set of lines of D consists of three lines of size n -1, 6(n - 2) lines of size n - 2, and n - 5n + 6 lines of size n - 3. Furthermore, if n > 21 and D...
متن کامل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 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Languages of the Caucasus
سال: 2015
ISSN: 2375-2068
DOI: 10.5070/l911029245