Documentation

Linglib.Fragments.Latin.Coordination

Latin Coordination Morphemes #

[Has07]

Latin has a rich coordination system with both free and bound forms. The J/MU decomposition ([MS14], [MS16]) maps cleanly:

The et...et pattern ("both...and") and neque...neque pattern are bisyndetic uses of J particles.

Connection to Typology.lean: Haspelmath2007.latin encodes the structural patterns (a_co_b, a_b'co, co'a_b'co).

et — primary conjunction, J particle. Free, prepositive. "Caesar et Brutus" = "Caesar and Brutus". Also used correlatively: "et A et B" = "both A and B".

Equations
Instances For

    -que — enclitic conjunction, MU particle. Bound, postpositive. "senatus populusque" = "senate and people". Historically connected to the additive/inclusive particle.

    Equations
    • One or more equations did not get rendered due to their size.
    Instances For

      atque / ac — emphatic conjunction, J variant. ac before consonants, atque before vowels. "atque" < *ad-que (lit. "and to that").

      Equations
      • One or more equations did not get rendered due to their size.
      Instances For

        neque / nec — negative coordination. "neque A neque B" = "neither A nor B". Morphologically ne + -que (negation + MU enclitic).

        Equations
        • One or more equations did not get rendered due to their size.
        Instances For

          aut — exclusive/strong disjunction. "aut A aut B" = "either A or B (but not both)".

          Equations
          Instances For

            vel — inclusive/weak disjunction. "vel A vel B" = "A or B (or both)".

            Equations
            Instances For

              sed — adversative conjunction. "non A sed B" = "not A but B".

              Equations
              Instances For
                Equations
                • One or more equations did not get rendered due to their size.
                Instances For
                  theorem Latin.Coordination.one_bound_morpheme :
                  (List.filter (fun (x : Coordinator) => x.boundness == Boundness.bound) allEntries).length = 1

                  Latin has exactly one bound morpheme: -que.

                  theorem Latin.Coordination.bound_is_mu :
                  ((List.filter (fun (x : Coordinator) => x.boundness == Boundness.bound) allEntries).all fun (x : Coordinator) => x.role == Coordinator.Role.mu) = true

                  The bound morpheme is the MU particle -que.

                  theorem Latin.Coordination.correlative_entries :
                  (List.filter (fun (x : Coordinator) => x.correlative) allEntries).length = 4

                  Latin has correlative uses of J, disjunction, and negative coordination.