To the Question of the Root-Class Residuality of Free Constructions of Groups

2020 ◽  
Vol 41 (2) ◽  
pp. 260-272
Author(s):  
E. V. Sokolov ◽  
E. A. Tumanova
2000 ◽  
pp. 361-400
Author(s):  
Luis Ribes ◽  
Pavel Zalesskii

2018 ◽  
Vol 55 (1) ◽  
pp. 35-81 ◽  
Author(s):  
JESSICA COON

This paper offers an in-depth look at roots and verb stem morphology in Chuj (Mayan) in order to address a larger question: when it comes to the formation of verb stems, what information is contributed by the root, and what is contributed by the functional heads? I show first that roots in Chuj are not acategorical in the strict sense (cf. Borer 2005), but must be grouped into classes based on their stem-forming possibilities. Root class does not map directly to surface lexical category, but does determine which functional heads (i.e. valence morphology) may merge with the root. Second, I show that while the introduction of the external argument, along with clausal licensing and agreement generally, are all governed by higher functional heads, the presence or absence of aninternalargument is dictated by the root. Specifically, I show that transitive roots in Chuj always combine with an internal argument, whether it be (i) a full DP, (ii) a bare pseudo-incorporated NP, or (iii) an implicit object in an antipassive. In the spirit of work such as Levinson (2007, 2014), I connect this to the semantic type of the root; root class reflects semantic type, and semantic type affects the root’s combinatorial properties. This work also contributes to the discussion of how valence morphology operates. In line with works such as Alexiadou, Anagnostopoulou & Schäfer (2006), I argue that valence morphology applies directly to roots, rather than to some ‘inherent valence’ of a verb.


2012 ◽  
Vol 77 (1) ◽  
pp. 291-307 ◽  
Author(s):  
Frank Stephan ◽  
Jason Teutsch

AbstractThe truth-table degree of the set of shortest programs remains an outstanding problem in recursion theory. We examine two related sets, the set of shortest descriptions and the set of domain-random strings, and show that the truth-table degrees of these sets depend on the underlying acceptable numbering. We achieve some additional properties for the truth-table incomplete versions of these sets, namely retraceability and approximability. We give priority-free constructions of bounded truth-table chains and bounded truth-table antichains inside the truth-table complete degree by identifying an acceptable set of domain-random strings within each degree.


2015 ◽  
Vol 20 (1) ◽  
pp. 133-137 ◽  
Author(s):  
E. A. Tumanova

Let K be a root class of groups. It is proved that a free product of any family of residually K groups with one amalgamated subgroup, which is a retract in all free factors, is residually K. The sufficient condition for a generalized free product of two groups to be residually K is also obtained, provided that the amalgamated subgroup is normal in one of the free factors and is a retract in another.


1998 ◽  
Vol 350 (2) ◽  
pp. 571-613 ◽  
Author(s):  
O. Kharlampovich ◽  
A. Myasnikov

Sign in / Sign up

Export Citation Format

Share Document