Semantic recursion in numerical expressions : Evidence from Polish and Japanese
| Authors | |
|---|---|
| Year of publication | 2022 |
| Type | Appeared in Conference without Proceedings |
| MU Faculty or unit | |
| Citation | |
| Description | In this talk, we investigate previously unnoticed cases of linguistic recursion arising without Merge, i.e., within terminals. Based on the cross-linguistic behavior of the numerical expression double and two-time, we demonstrate that certain NPs give rise to a purely semantic recursion and formulate restrictions under which this effect emerges. The puzzle, we show, lies in that such recursion is neither fed by Merge, nor is it overtly marked. We propose that recursion arises as the only way to circumvent the emergence of an unbound and unrestricted variable. |
| Related projects: |