Docs / Studies / Studies.Aloni2001

Quantification under Conceptual Covers

Aloni, M. (2001). PhD thesis, University of Amsterdam

An individual concept is a function from worlds to individuals, and a conceptual cover is a set of concepts such that in each world each individual is the value of exactly one of them. Each cover is a way of identifying the individuals across worlds; the name cover identifies each by its constant concept. Aloni lets quantifiers range over the concepts of a contextually given cover, so that a question partitions the worlds by which concepts of the cover have the questioned property, and a de re report is true when some concept of the cover picks out the res and has the property in every belief world.

Main definitions

Implementation notes

  • Worlds and individuals are types and concepts total functions, as in Definition 4.1.1.
  • A question or a report takes its cover as an argument. The conceptual perspectives of Definition 1.4.1, which assign covers to variable indices, multiple-constituent questions, the dynamic semantics of Chapter 3 and the pragmatics of cover selection of Chapter 4 are not formalized.
  • A question under a cover is GroenendijkStokhof1984.who with the concepts of the cover as the individuals.

References

Conceptual covers

L57–59

The existence and uniqueness conditions of Section 1.4.1 say that in each world each individual is the instantiation of exactly one concept of the cover.

theorem isCover_iff_existsUniqueL61–70
{W : Type u_1} {D : Type u_2} {C : Set (W → D)} :
IsCover C ↔ ∀ (w : W) (d : D), ∃! c : W → D, c ∈ C ∧ c w = d

Built from

L72–74
L76–79
L81
L83–89

The name cover

A cover of rigid concepts is the name cover, the one rigid cover, against which the others identify the individuals descriptively (Section 4.1).

theorem IsCover.eq_namesL104–115
{W : Type u_1} {D : Type u_2} {C : Set (W → D)} [Nonempty W] (h : IsCover C) (hr : ∀ c ∈ C, IsRigid c) :
C = names

Built from ,

Covers as cross-identifications

L123–124
L133–154

Over finitely many worlds and individuals there are (|D|!)^(|W|-1) covers (Proposition 4.1.3).

theorem card_coversL169–178
{W : Type u_1} {D : Type u_2} [Finite W] [Finite D] [Nonempty W] :
Nat.card { C : Set (W → D) // IsCover C } = (Nat.card D).factorial ^ (Nat.card W - 1)

Built from

Covers as methods of cross-identification (Section 4.2)

The name cover identifies each individual of a world with itself in every other world, the rigid method of cross-identification.

theorem crossId_namesL186–189
{W : Type u_1} {D : Type u_2} {x x' : W × D} :
crossId names x x' ↔ x.2 = x'.2

Built from ,

L191–194
L196–200
L220–222
L224–226
L228–231
L233–234
L246–272

Questions under cover

L278–282
L284–286

De re belief under cover

The cards (Sections 1.4.1 and 4.1)