Abstract

We propose a novel interpretation of natural-language questions using a modal predicate logic of knowledge. Our approach brings standard model-theoretic and proof-theoretic techniques from modal logic to bear on questions. Using the former, we show that our interpretation preserves Groenendijk and Stokhof's answerhood relation, yet allows an extensional interpretation. Using the latter, we get a sound and complete proof procedure for the logic for free. Our approach is more expressive; for example, it easily treats complex questions with operators that scope over questions. We suggest a semantic criterion that restricts what natural-language questions can express. We integrate and generalize much previous work on the semantics of questions, including Beck and Sharvit's families of subquestions, non-exhaustive questions, and multi-party conversations.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call