Documentation

Studies.Dayal2004

Dayal (2004): Number marking and (in)definiteness in kind terms #

Dayal argues that bare nominals are kind terms or definites, never genuine indefinites, and that number morphology decides how a kind term is marked for definiteness. Revised Meaning Preservation, (39c), ranks ι with ∩ above ∃, where Chierchia ranked ∩ alone on top, so wherever ι is unblocked a bare nominal is a kind or a definite even where ∩ is undefined. ∩ is undefined for a singular count noun, whose kind term is formed by ι over the taxonomic domain instead, (77d). Section 4 places ι above ∩ on a scale of definiteness: a language's definite determiner lexicalizes ι alone or ι and ∩, and the Blocking Principle applies to its canonical meaning ι and may or may not apply to ∩.

Main definitions #

Main results #

Implementation notes #

TODO #

References #

Revised Meaning Preservation (Section 2.5) #

Wherever ι is unblocked, as in a language without articles, a bare nominal for which ∩ is defined is a kind or a definite, ∩ and ι both applying, and never an indefinite, (39c).

Under Chierchia's ranking kind formation pre-empts the definite, so a bare nominal for which ∩ is defined could not be a definite, against (17) and (18), where Hindi, Russian and Chinese bare nominals are kinds and definites alike.

Where ∩ is undefined, as for is mashiin ke TukRe 'parts of this machine', ι still outranks ∃ under Dayal's ranking, so the Hindi bare plural is a non-familiar definite with no wide-scope existential reading, (45); Chierchia's ranking would let ∃ apply beside ι.

English the blocks ι and, being used anaphorically, ι^x, so the two rankings choose alike for English bare nominals and (43) and (44) do not decide between them.

With ι and ι^x blocked and ∃ open, ∃ applies exactly where ∩ is undefined. So an English bare plural like parts of this machine shifts by ∃ and interacts in scope with negation, (43), while spots on the floor takes only the narrow scope of DKP, (44); and a bare singular shifts by ∃ in a language with a definite but no indefinite article, as p. 443 predicts, which Hebrew's (90) and (91) support and Doron's (94) contradicts.

An English bare singular has no shift, (88a), since ∩ is undefined for it, the blocks ι and ι^x, and a blocks ∃.

Singular kinds (Section 3.4) #

The kind term of a nominal of number num is formed by ∩, except that ∩ is undefined for a singular count noun, whose kind term is formed by ι over the taxonomic domain, which picks out the unique sub-kind, (77d). A mass term is number-neutral, fn. 25, and a nominal of a language that does not mark number aligns with plurals, p. 413.

Equations
Instances For

    The scale of definiteness (Section 4) #

    A lexicalization records the shifts a language's definite determiner encodes and the shifts the Blocking Principle keeps from applying covertly. On the scale of definiteness ι is above ∩, so the determiner encodes ι and possibly ∩ but never ∩ alone, p. 437, and Blocking applies to the canonical meaning ι wherever it is lexicalized and possibly to the non-canonical ∩, p. 442.

    Instances For
      theorem Dayal2004.Lexicalization.ext {x y : Lexicalization} (lexicalized : x.lexicalized = y.lexicalized) (blocked : x.blocked = y.blocked) :
      x = y

      The lexicalization of a language without a definite determiner, as Hindi, Russian and Chinese.

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

        The lexicalization of English, whose the lexicalizes ι alone.

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

          The lexicalization of Italian and the Romance languages, whose definite determiner lexicalizes and blocks ι and ∩, p. 438.

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

            The lexicalization of German, whose definite determiner lexicalizes ι and ∩ but blocks only the canonical ι, p. 442.

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

              The principles admit exactly the four attested types.

              The kind term of a nominal can take the definite determiner when its shift is lexicalized.

              Equations
              Instances For

                The kind term of a nominal can be bare when its shift is not blocked.

                Equations
                Instances For
                  @[instance_reducible]
                  Equations
                  @[instance_reducible]
                  Equations

                  Every kind term has a form, since a shift the Blocking Principle bars is lexicalized.

                  Singular kind terms are never optionally definite, (87), since the canonical ι is blocked wherever it is lexicalized.

                  A language can have bare singular kind terms only if it allows plural and mass kind terms to be bare, p. 422.

                  English-in-reverse, p. 447, is impossible: a language forming plural kind terms with the definite determiner while allowing singular kind terms to be bare, since ∩ is lexicalized only with ι.

                  German-in-reverse, p. 448, is impossible: a language requiring the definite determiner on plural and mass kind terms, the latter number-neutral, but leaving it optional on singular ones, since Blocking cannot spare the canonical ι.

                  The paper's analysis gives Hindi, Russian and Mandarin no definite determiner, English the ι, Italian il ι and ∩, p. 438, and German der ι and ∩ with Blocking enforced for ι alone, p. 442; a language is named by its Glottocode.

                  Equations
                  Instances For

                    The data #

                    inductive Dayal2004.Form :

                    A kind term is bare or carries the definite determiner.

                    Instances For
                      @[instance_reducible]
                      instance Dayal2004.instDecidableEqForm :
                      DecidableEq Form
                      Equations

                      A kind term of number num can take the form f under l.

                      Equations
                      Instances For
                        @[instance_reducible]
                        instance Dayal2004.instDecidablePredFormLicit (l : Lexicalization) (num : Number) :
                        DecidablePred (l.Licit num)
                        Equations
                        • One or more equations did not get rendered due to their size.
                        structure Dayal2004.Row :

                        A row records the language's lexicalization, the number of the noun, the form of its kind term, and the judgment.

                        Instances For
                          def Dayal2004.Row.ofDatum (d : Datum) :
                          Option Row

                          A row from a datum's language and features; a mass term is number-neutral, fn. 25.

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

                            The kind terms of (6a), (14) to (16), (46), (78), (86) and (87a).

                            Equations
                            Instances For
                              theorem Dayal2004.ofDatum_isSome (d : Datum) :
                              d ∈ Examples.all → (Row.ofDatum d).isSome = true

                              Each kind term is judged acceptable exactly where its language's lexicalization licenses its form.