Documentation

Studies.Carstens2026

Carstens (2026): The grammar of gender #

In Xhosa, conjoined singulars of genders 1/2, 7/8 and 9/10 take gender-matching plural agreement, while those of 3/4 and 5/6, like mismatched conjuncts, take the semantic agreement of class 2 for humans and class 8 for the rest. Carstens reads the split as interpretability. Every Bantu nominal is a stacked nP, a core n bearing a semantic gender (i[human], i[animal] and i[inanimate] in Xhosa, i[human] and i[non-human] in Shona) under the n that fixes its class. Following Adamson and Anagnostopoulou, only interpretable gender features percolate to &P, where they are intersected, so a u-gender contributes nothing; the arbitrary members of an interpretable gender carry a bare i[entity] flavor and still match.

Two grammars read the intersection: Highest Wins takes the shared visible gender and Best Semantic Match the shared core, the source of the minority choices. Where neither matches, the conjunction is ineffable. In Shona six of the eight genders are uninterpretable, so matching agreement is the exception.

Implementation notes #

References #

Nominals and the two grammars (§4–§5) #

structure Carstens2026.Nominal (G : Type u_3) :
Type u_3

A Bantu nominal is a core nP of the gender that carries the semantic flavor of what it denotes, wrapped, when its visible class belongs to another gender, in an outer nP of that gender, (10) and (72)–(73).

  • core : G
  • outer : Option G
Instances For
    @[instance_reducible]
    instance Carstens2026.instDecidableEqNominal {G✝ : Type u_3} [DecidableEq G✝] :
    DecidableEq (Nominal G✝)
    Equations
    def Carstens2026.instDecidableEqNominal.decEq {G✝ : Type u_3} [DecidableEq G✝] (x✝ x✝¹ : Nominal G✝) :
    Decidable (x✝ = x✝¹)
    Equations
    Instances For
      @[instance_reducible]
      instance Carstens2026.instReprNominal {G✝ : Type u_3} [Repr G✝] :
      Repr (Nominal G✝)
      Equations
      def Carstens2026.instReprNominal.repr {G✝ : Type u_3} [Repr G✝] :
      Nominal G✝ → ℕ → Std.Format
      Equations
      • One or more equations did not get rendered due to their size.
      Instances For
        def Carstens2026.Nominal.visible {G : Type u_1} (n : Nominal G) :
        G

        The visible gender, the outer layer's or the core's.

        Equations
        Instances For
          def Carstens2026.Nominal.genders {G : Type u_1} (n : Nominal G) :
          List G

          The genders of the nominal's n's, innermost first.

          Equations
          Instances For
            theorem Carstens2026.Nominal.visible_eq_agreeingGender {G : Type u_1} (n : Nominal G) (r : DistributedMorphology.Root) (d : G) :
            n.visible = DistributedMorphology.agreeingGender some d ({ root := r, heads := n.genders }.lastCycle fun (x : G) => True) ∧ n.visible = DistributedMorphology.agreeingGender some d n.genders.reverse

            The visible gender is the agreeing gender of the Highest Gender Hypothesis, the gender a probe finds in the last cycle of the nominal; since every n bears a gender, a probe searching every n finds it too.

            The visible gender's feature as percolation sees it, annotated with the interpretability of the gender's n.

            Equations
            Instances For
              def Carstens2026.Nominal.stack {G : Type u_1} [DecidableEq G] (c g : G) :

              The nominal of a noun of gender g over the core c, an outer nP of gender g stacked above the core unless the two coincide, (72)–(73).

              Equations
              Instances For
                @[simp]
                theorem Carstens2026.Nominal.visible_stack {G : Type u_1} [DecidableEq G] (c g : G) :
                (stack c g).visible = g
                def Carstens2026.highestWins {G : Type u_1} {C : Type u_2} (status : G → Bantu.GenderStatus) (pluralClass : G → C) [DecidableEq G] (a b : Nominal G) :
                Option C

                Highest Wins (79), where the visible genders percolate and intersect, the shared gender valuing its plural class.

                Equations
                • One or more equations did not get rendered due to their size.
                Instances For
                  def Carstens2026.bestSemanticMatch {G : Type u_1} {C : Type u_2} (pluralClass : G → C) [DecidableEq G] (a b : Nominal G) :
                  Option C

                  Best Semantic Match (80), where the cores intersect, a total match of gender with flavor, the shared core valuing its plural class.

                  Equations
                  Instances For
                    def Carstens2026.Values {G : Type u_1} {C : Type u_2} (status : G → Bantu.GenderStatus) (pluralClass : G → C) [DecidableEq G] (a b : Nominal G) (c : C) :

                    c values plural agreement on &P under one of the two grammars (§5.1).

                    Equations
                    Instances For
                      @[instance_reducible]
                      instance Carstens2026.instDecidableValuesOfDecidableEq {G : Type u_1} {C : Type u_2} (status : G → Bantu.GenderStatus) (pluralClass : G → C) [DecidableEq G] (a b : Nominal G) [DecidableEq C] (c : C) :
                      Decidable (Values status pluralClass a b c)
                      Equations
                      • One or more equations did not get rendered due to their size.
                      theorem Carstens2026.highestWins_eq {G : Type u_1} {C : Type u_2} (status : G → Bantu.GenderStatus) (pluralClass : G → C) [DecidableEq G] {a b : Nominal G} :
                      highestWins status pluralClass a b = if interpretability (status a.visible) = Minimalist.Interpretability.interpretable ∧ a.visible = b.visible then some (pluralClass a.visible) else none
                      theorem Carstens2026.bestSemanticMatch_eq {G : Type u_1} {C : Type u_2} (pluralClass : G → C) [DecidableEq G] {a b : Nominal G} :
                      bestSemanticMatch pluralClass a b = if a.core = b.core then some (pluralClass a.core) else none
                      theorem Carstens2026.matching_iff {G : Type u_1} {C : Type u_2} (status : G → Bantu.GenderStatus) (pluralClass : G → C) [DecidableEq G] {a b : Nominal G} (h : a.visible = b.visible) :
                      highestWins status pluralClass a b = some (pluralClass a.visible) ↔ interpretability (status a.visible) = Minimalist.Interpretability.interpretable

                      Uniform conjuncts pair with gender-matching plural agreement exactly when their gender is interpretable, (52a–b) and (54).

                      theorem Carstens2026.values_iff_of_uninterpretable {G : Type u_1} {C : Type u_2} (status : G → Bantu.GenderStatus) (pluralClass : G → C) [DecidableEq G] {a b : Nominal G} (hu : interpretability (status a.visible) = Minimalist.Interpretability.uninterpretable) (c : C) :
                      Values status pluralClass a b c ↔ bestSemanticMatch pluralClass a b = some c

                      A u-gender stacked above a core is ignored, the cores alone valuing agreement (77).

                      theorem Carstens2026.two_grammars {G : Type u_1} {C : Type u_2} (status : G → Bantu.GenderStatus) (pluralClass : G → C) [DecidableEq G] {a : Nominal G} {g : G} (ho : a.outer = some g) (hi : interpretability (status g) = Minimalist.Interpretability.interpretable) :
                      highestWins status pluralClass a a = some (pluralClass g) ∧ bestSemanticMatch pluralClass a a = some (pluralClass a.core)

                      An arbitrary member of an interpretable gender stacked above a core carries both i-genders to &P, uniform conjuncts match twice, and the two grammars value the visible and the core plural respectively, (78)–(80).

                      theorem Carstens2026.highestWins_eq_bestSemanticMatch {G : Type u_1} {C : Type u_2} (status : G → Bantu.GenderStatus) (pluralClass : G → C) [DecidableEq G] {a b : Nominal G} (ha : a.outer = none) (hb : b.outer = none) (hi : interpretability (status a.core) = Minimalist.Interpretability.interpretable) :
                      highestWins status pluralClass a b = bestSemanticMatch pluralClass a b

                      Single-layer conjuncts of an interpretable gender give the two grammars nothing to disagree about.

                      theorem Carstens2026.not_values {G : Type u_1} {C : Type u_2} (status : G → Bantu.GenderStatus) (pluralClass : G → C) [DecidableEq G] {a b : Nominal G} (hv : a.visible ≠ b.visible) (hc : a.core ≠ b.core) (c : C) :
                      ¬Values status pluralClass a b c

                      With neither the visible genders nor the cores matching, no class values agreement and the conjunction is ineffable, (91)–(92) and (111)–(112).

                      Xhosa (71)–(73) #

                      Each flavor is borne by exactly one gender, A [human], E [animal] and D [inanimate] (71).

                      The core of a noun, the gender whose n bears the flavor of what it denotes.

                      Equations
                      Instances For

                        A noun's nominal, its core from what it denotes and its gender stacked above, (72)–(73).

                        Equations
                        Instances For

                          Shona (§3.5, §5.2) #

                          Each flavor is borne by exactly one gender, A [human] and D [non-human].

                          The core of a noun, the gender whose n bears the flavor of what it denotes.

                          Equations
                          Instances For

                            A Shona noun's nominal, where a diminutive's u-gender 12/13 stacks above its core (98).

                            Equations
                            Instances For

                              The rows #

                              def Carstens2026.rows (glottocode : String) :
                              List Datum

                              The rows of one language.

                              Equations
                              Instances For
                                def Carstens2026.conjuncts {G : Type u_1} {N : Type u_3} (nouns : List N) (form : N → String) (nominal : N → Nominal G) (e : Datum) :
                                Option (Nominal G × Nominal G)

                                A row's conjuncts, the nominals of the nouns it names.

                                Equations
                                • One or more equations did not get rendered due to their size.
                                Instances For
                                  def Carstens2026.Predicts {G : Type u_1} {C : Type u_2} [DecidableEq G] (status : G → Bantu.GenderStatus) (pluralClass : G → C) (classOf : String → Option C) (p : Nominal G × Nominal G) (e : Datum) :

                                  The two grammars predict a row on the conjuncts p when every class it accepts values agreement under one of them and no class it rejects does.

                                  Equations
                                  • One or more equations did not get rendered due to their size.
                                  Instances For
                                    @[instance_reducible]
                                    instance Carstens2026.instDecidablePredictsOfDecidableEq {G : Type u_1} {C : Type u_2} [DecidableEq G] (status : G → Bantu.GenderStatus) (pluralClass : G → C) (classOf : String → Option C) [DecidableEq C] (p : Nominal G × Nominal G) (e : Datum) :
                                    Decidable (Predicts status pluralClass classOf p e)
                                    Equations
                                    • One or more equations did not get rendered due to their size.

                                    The Xhosa rows are predicted, (6)–(9), (37)–(49), (55), (81)–(91) and (111).

                                    The Shona rows are predicted, matching agreement confined to 1/2 and 7/8, (58)–(68).

                                    theorem Carstens2026.table13 (e : Datum) :
                                    e ∈ rows "xhos1239" → ∀ m ∈ e.nat? "matching", ∀ d ∈ e.nat? "default", ∀ p ∈ conjuncts Xhosa.Nouns.all (fun (x : Xhosa.Noun) => x.form) xhosaNominal e, d ≤ m ↔ interpretability p.1.visible.status = Minimalist.Interpretability.interpretable

                                    Gender-matching agreement is chosen at least as often as default exactly in the cells whose gender is interpretable, Table 13 and (52a–b).

                                    Taraldsen et al.'s reading (§3.2.3) #

                                    The same failures read structurally by [TTML18]. The genders whose singular and plural prefixes share one classifier N are exactly the interpretable genders, the paper's diagnostic and their partition of the Xhosa data coinciding.