Graduate studies at Western
Erkenntnis 40 (2):265-284 (1994)
|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.|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Helen Gaylard & Allan Ramsay (2004). Relevant Answers to WH-Questions. Journal of Logic, Language and Information 13 (2):173-186.
Andrzej Wiśniewski (1994). Erotetic Implications. Journal of Philosophical Logic 23 (2):173 - 195.
Douglas Cenzer (1984). Monotone Reducibility and the Family of Infinite Sets. Journal of Symbolic Logic 49 (3):774-782.
Ernst Kleinert (2007). On the Reducibility of Relations: Variations on a Theme of Peirce. Transactions of the Charles S. Peirce Society 43 (3):509 - 520.
David Harrah (1961). A Logic of Questions and Answers. Philosophy of Science 28 (1):40-46.
Karl-Georg Niebergall (2000). On the Logic of Reducibility: Axioms and Examples. [REVIEW] Erkenntnis 53 (1-2):27-61.
Matti Sintonen (1984). On the Logic of Why-Questions. PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1984:168 - 176.
Andrzej Wiśniewski (1999). Erotetic Logic and Explanation by Abnormic Hypotheses. Synthese 120 (3):295-309.
Andrzej Wisniewski (1994). On the Reducibility of Questions. Erkenntnis 40 (2):265 - 284.
Added to index2009-01-28
Total downloads4 ( #189,291 of 739,396 )
Recent downloads (6 months)0
How can I increase my downloads?