Conceptual Covers
- ne recent application
Maria Aloni
ILLC/Philosophy Department University of Amsterdam
Conceptual Covers one recent application Maria Aloni - - PowerPoint PPT Presentation
Conceptual Covers one recent application Maria Aloni ILLC/Philosophy Department University of Amsterdam LoLaCo 26/11/2012 Conceptual covers Sets of individual concepts modeling methods of cross-world identification Early applications
ILLC/Philosophy Department University of Amsterdam
◮ Background
◮ Concealed questions: basic data ◮ Existing analyses of concealed questions ◮ Groenendijk & Stokhof (1984) on questions and knowledge ◮ Quantification under conceptual covers (Aloni 2001)
◮ Proposals
◮ Concealed questions under cover (Aloni 2008) ◮ Perspectives on concealed questions (Roelofsen & Aloni 2008, 2011)
◮ Outstanding problems and conclusions ◮ Appendix: Resolution and Conceptual Cover Selection
◮ Some challenging data ◮ Constraints on resolution and CC selection
◮ Type dimension: CQs denote question extensions, i.e. propositions; ◮ Their interpretation depends on the particular perspective that is
◮ We’d rather not assume a special purpose lexical item knowcq
◮ Type dimension: CQs denote question extensions, i.e. propositions; ◮ Their interpretation depends on the particular perspective that is
◮ Identification methods can be formalized as conceptual covers:
◮ In the cards scenario, 3 salient covers/ways of identifying the cards:
◮ Evaluation of (20) depends on which of these covers is adopted:
◮ xn ranges over {the capital of Germany, the capital of Italy, . . . } ◮ xm ranges over {Berlin, Rome, . . . }
◮ xn ranges over {the capital of Germany, the capital of Italy, . . . } ◮ xm ranges over {Berlin, Rome, . . . }
◮ Quantified CQs are ambiguous between pair-list and set readings:
◮ Set readings are particularly salient when the CQ noun is
◮ Aloni (2008) only captures the pair-list reading.
◮ Aloni (2008) derives the ambiguity of (30) as a de re/de dicto
◮ But the account of quantified CQs assumes a de re representation:
◮ Therefore, reading B of a quantified CCQ like (32) is not captured:
◮ n is some contextually determined conceptual cover; ◮ P is a contextually determined property:
◮ Either the property of being identical to xn:
◮ Or another salient property (generally the one expressed by CQ noun
◮ n → {Ann’s phone number, Bill’s phone number, . . . } ◮ m → {5403, 5431, . . . }
◮ n, m → {5403, 5431, . . . }
◮ Pair-list: for every country such that Fred knows its capital, John
◮ Set: for every capital of which Fred knows that it is a capital, John
◮ Pair-list: for every country such that Fred knows its capital, John
◮ Set: for every capital of which Fred knows that it is a capital, John
◮ xm ranges over {the capital of Italy, the capital of France, . . . } ◮ yn and yh range over {Rome, Berlin, Paris, . . . }
◮ xm ranges over {Rome, Berlin, Paris, . . . }
◮ xm range over {the capital of Italy, the capital of France, . . . } ◮ yn ranges over {Rome, Berlin, Paris, . . . }
◮ xm {Rome, Berlin, Paris, . . . }
◮ Sentence (46-a) involves quantification over set (46-b):
◮ In a conceptual cover:
◮ in each world each individual is identified by at least one concept
◮ in no world is an individual identified twice (uniqueness).
◮ But (46-b) need not be a conceptual cover:
◮ Milk and butter might have the same price (no uniqueness) ◮ 1 euro need not be the price of anything (no existence) ◮ The price of milk might have not been fixed yet (no total functions)
◮ Same problem with temperatures, dates of birth, etc.
◮ Only basic covers must satisfy the original requirements of
◮ Derived covers are obtained from basic covers C and functions f as:
◮ Once we let in overlapping concepts, problems arise for de dicto
◮ While sentence (50-a) is intuitively false in scenario (51), analysis
◮ Possible solutions: (i) Ban de dicto readings; (ii) more structure in
◮ Conceptual covers: useful tool for perspicuous representations of CQ
◮ Set-readings & B-readings accounted by predicational shifts; ◮ General pragmatic constraints on cover selection and P-resolution.
◮ Address open problem ◮ CQs embedding verbs: know CQ, #believe CQ, #wonder CQ ◮ Logic: quantified modal logic + CC → axiomatized in Aloni 2001
◮ . . .
◮ Aloni, 2007. Concealed Questions under Cover, Grazer Philosophische
◮ Frana, 2006. The de re analysis of concealed questions, SALT 16. ◮ Frana, 2010. Concealed questions. In search of answers. PhD. thesis,
◮ Harris, 2007. Revealing Concealment, MA thesis, ILLC-UvA. ◮ Heim, 1979. Concealed Questions. In Semantics from Different Points of
◮ Nathan, 2006. On the interpretation of concealed questions. PhD thesis,
◮ Roelofsen & Aloni (2008). Perspectives on concealed questions, SALT 18. ◮ Romero, 2005. Concealed Questions and Specificational Subjects. L&P. ◮ Romero, 2007. Connectivity in a Unified Analysis of Specificational
◮ Schwager, 2007. Keeping prices low: an answer to a concealed question.
◮ These counterexamples are hard, if not impossible, to explain on a
◮ Our pragmatic theory is flexible enough to capture exceptions to a
◮ To avoid excess meanings we need to properly constrain the
◮ P is typically resolved to
◮ the identity property; ◮ the property expressed by the CQ noun phrase.
◮ Cover indices n are typically resolved to
◮ the rigid cover (if available); ◮ naming; ◮ a derived cover based on a relational CQ noun (if salient).
◮ Salient cover: naming ◮ Salient properties: identity, murderer-of-Smith
◮ For (59-a): P → Id & n → naming
◮ For (59-b): P → m-of-S & m → naming
◮ Salient cover: naming ◮ Salient properties: identity, city-visited-on-honeymoon, capital
◮ For (60-a): P → capital
◮ For (60-b): P → capital & m → naming
◮ Blocking check: Is there another more effective way to express this
◮ Salient cover: naming, presidents ◮ Salient properties: identity, your-father, . . .
◮ For (61-a): either trivial [P → your-father] or irrelevant [P → Id] ◮ For (61-b): P → Id & m → presidents & n → naming
◮ Blocking check: Is there another more effective way to express this
◮ Salient cover: naming, capitals ◮ Salient properties: identity, capital-M-knows, capital-L-knows, . . .
◮ For (62-a): all either trivial or irrelevant ◮ For (62-b): 0 → capitals & P0 → cap-L-knows & P1 → Id & 2 →
◮ Blocking check: Is there another more effective way to express this