On the reducibility of questions
Authors:
- Andrzej Wiśniewski
Abstract
The concept a 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. © 1994 Kluwer Academic Publishers.
- Record ID
- UAM33b415b4637f40bd980e1ab968c00362
- Author
- Journal series
- Erkenntnis. An International Journal of Analytic Philosophy, ISSN 0165-0106
- Issue year
- 1994
- Vol
- 40
- Pages
- 265-284
- ASJC Classification
- ;
- DOI
- DOI:10.1007/BF01128596 opening in a new tab
- Language
- en English
- Score (nominal)
- 0
- Score source
- journalList
- Publication indicators
- = 6.000; : 1999 = 0.760
Share
- Uniform Resource Identifier
- https://researchportal.amu.edu.pl/info/article/UAM33b415b4637f40bd980e1ab968c00362/
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perishopening in a new tab system.
Back