A semantic relation between a family of sets of formulas and a set of formulas, dubbed generalized entailment, and its subrelation, called constructive generalized entailment, are defined and examined. Entailment construed in the usual way and multiple-conclusion entailment can be viewed as special cases of generalized entailment. The concept of constructive generalized entailment, in turn, enables an explication of some often used notion of interrogative entailment, and coincides with inquisitive entailment at the propositional level. Some interconnections between constructive generalized entailment and Inferential Erotetic Logic are also analysed.
The concept of proper multiple-conclusion entailment is introduced. For any sets X, Y of formulas, we say that Y is properly mc-entailed by X iff Y is mc-entailed by X, but no A ∈ Y is single-conclusion entailed by X. The concept has a natural interpretation in terms of question evocation. A sound and complete axiom system for the propositional case of proper mc-entailment is presented.
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.