Interrogative dependencies and the constructive content of inquisitive proofs

This paper shows how dichotomous inquisitive semantics gives rise to a general notion of entailment that unifies standard declara- tive entailment with answerhood and interrogative dependency, the rela- tion holding when an answer to a question determines an answer to an- other. We investigate the associated logic, presenting a new completeness proof based on an explicit canonical model construction. On the way to this proof, we establish a new result, the resolution theorem, which shows that inquisitive proofs have a natural computational interpretation. We conclude arguing that, as a logic of dependencies, inquisitive logic has certain theoretical and practical advantages over related systems

Interrogative Dependencies and the Constructive Content of Inquisitive Proofs

This paper shows how dichotomous inquisitive semantics gives rise to a general notion of entailment that unifies standard declara- tive entailment with answerhood and interrogative dependency, the rela- tion holding when an answer to a question determines an answer to an- other. We investigate the associated logic, presenting a new completeness proof based on an explicit canonical model construction. On the way to this proof, we establish a new result, the resolution theorem, which shows that inquisitive proofs have a natural computational interpretation. We conclude arguing that, as a logic of dependencies, inquisitive logic has certain theoretical and practical advantages over related systems