Speaker: Adam Przepiórkowski (Warsaw / MIT)
Title: Cases are partially ordered: Evidence from Estonian
Time: Thursday, April 17th, 5pm – 6pm
Location: 32-D769
Abstract: Caha 2009 et seq. argues that cases are universally totally ordered: NOM < ACC < GEN < PAR < obliques, with obliques also totally ordered. Arguments for this include case syncretisms and morphological containments in various languages, including Estonian. The aim of this talk is to present arguments from Estonian for a partial ordering, where in particular GEN(initive) and PAR(titive) are unordered: NOM < ACC < {GEN, PAR} < obliques. Some of the arguments are morphological (syncretism, containment), but I also adduce a syntactic argument, from covert case stacking in so-called pseudopartitives (‘piece of bread’, etc.). This provides support for the views that case hierarchies are only partially ordered (e.g., Bárány 2021, Graf 2019, Zompì 2019), as well as for the view in Zompì 2023 that *ABA is not violated as long as there exists at least one path between the two A items that does not violate *ABA.