Abstract

The concepta question is reducible to a non-empty set of questions is defined and examined. The basic results are: (1) each question which is sound relative to some of its presuppositions is reducible to some set of binary (i.e. having exactly two direct answers) questions; (b) each question which has a finite number of direct answers is reducible to some finite set of binary questions; (c) if entailment is compact, then each normal question (i.e. sound relative to its presuppositions) is reducible to some finite set of binary questions.