Degree achievements and degree morphemes in competition in Southern Aymara

Linguistics and Philosophy 44 (3):695-735 (2020)
  Copy   BIBTEX

Abstract

In this paper, I give an account of degree achievements in Southern Aymara, an understudied Andean language. I focus on degree achievements that are derived from gradable bases by means of the verbal suffix -cha, e.g., llusk’a -cha-ña ‘to straighten’ or q’añu -cha-ña ‘to dirty’. I provide arguments suggesting that Aymara should be analyzed as a degree language :1–48, 2015b). I further propose an analysis of Aymara degree achievements in terms of a differential measure function Adjectives and adverbs: syntax, semantics and discourse. Oxford University Press, Oxford, pp 156–182, 2008) The main point argued for in this paper is that this language has two degree morphemes in competition Semantik: ein internationales Handbuch der zeitgenössischen Forschung. Mouton de Gruyter, Berlin, pp 487–535, 1991) combining with degree achievements, namely, a covert verbal positive morpheme v.pos and the overt morpheme -su. The latter restricts the standard of comparison to change where maximal values are reached, so it is preferred over v.pos when such values are targeted. v.pos is thus felicitous when the maximum is not reached. I propose an initial typology that distinguishes how telicity is achieved cross-linguistically when degree achievements are considered.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,897

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On Lachlan’s major sub-degree problem.S. Barry Cooper & Angsheng Li - 2008 - Archive for Mathematical Logic 47 (4):341-434.
An almost-universal cupping degree.Jiang Liu & Guohua Wu - 2011 - Journal of Symbolic Logic 76 (4):1137-1152.
An exact measure of paradox.A. C. Paseau - 2013 - Analysis 73 (1):17-26.
Parasitic degree phrases.Jon Nissenbaum & Bernhard Schwarz - 2011 - Natural Language Semantics 19 (1):1-38.
Array nonrecursiveness and relative recursive enumerability.Mingzhong Cai - 2012 - Journal of Symbolic Logic 77 (1):21-32.
Isolation and the high/low hierarchy.Shamil Ishmukhametov & Guohua Wu - 2002 - Archive for Mathematical Logic 41 (3):259-266.
A minimal pair joining to a plus cupping Turing degree.Dengfeng Li & Angsheng Li - 2003 - Mathematical Logic Quarterly 49 (6):553-566.
Nonisolated degrees and the jump operator.Guohua Wu - 2002 - Annals of Pure and Applied Logic 117 (1-3):209-221.
Prime models of computably enumerable degree.Rachel Epstein - 2008 - Journal of Symbolic Logic 73 (4):1373-1388.
Bounding computably enumerable degrees in the Ershov hierarchy.Angsheng Li, Guohua Wu & Yue Yang - 2006 - Annals of Pure and Applied Logic 141 (1):79-88.
Strange Relatives of the Third Kind.Alexander Grosu & Fred Landman - 1998 - Natural Language Semantics 6 (2):125-170.

Analytics

Added to PP
2020-06-05

Downloads
19 (#799,523)

6 months
7 (#430,360)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Semantics in generative grammar.Irene Heim & Angelika Kratzer - 1998 - Malden, MA: Blackwell. Edited by Angelika Kratzer.
Scorekeeping in a language game.David Lewis - 1979 - Journal of Philosophical Logic 8 (1):339--359.
Scorekeeping in a Language Game.David Lewis - 1979 - Journal of Philosophical Logic 8 (3):339.
Context and logical form.Jason Stanley - 2000 - Linguistics and Philosophy 23 (4):391--434.
Context and Logical Form.Jason Stanley - 2013 - In Maite Ezcurdia & Robert J. Stainton (eds.), The Semantics-Pragmatics Boundary in Philosophy. Broadview Press. pp. 316.

View all 22 references / Add more references