Multiple -conclusion logic extends formal logic by allowing arguments to have a set of conclusions instead of a single one, the truth lying somewhere among the conclusions if all the premises are true. The extension opens up interesting possibilities based on the symmetry between premises and conclusions, and can also be used to throw fresh light on the conventional logic and its limitations. This is a sustained study of the subject and is certain to stimulate further research. Part I reworks (...) the fundamental ideas of logic to take account of multiple conclusions, and investigates the connections between multiple - and single - conclusion calculi. Part II draws on graph theory to discuss the form and validity of arguments independently of particular logical systems. Part III contrasts the multiple - and the single - conclusion treatment of one and the same subject, using many-valued logic as the example; and Part IV shows how the methods of 'natural deduction' can be matched by direct proofs using multiple conclusions. (shrink)

Three semantic relations are analyzed: the relation of implication of a question by a question and a set of declarative sentences, the relation of implication of a question by a question, and the relation of strong implication of a question by a question and a set of declarative sentences. The connections between these concepts and the concepts of relative soundness, partial answerhood and presupposition are examined. The principal results are theorems about, to speak generally, epistemic reducibility of well-posed questions to (...) sequences of implied yes-no questions. (shrink)

The concept of erotetic argument is introduced. Two relations between sets of declarative sentences and questions are analysed; and two classes of erotetic arguments are characterized.

Some notions of the logic of questions (presupposition of a question, validation, entailment) are used for defining certain kinds of completeness of elementary theories. Presuppositional completeness, closely related to -completeness ([3], [6]), is shown to be fulfilled by strong elementary theories like Peano arithmetic.