Reducibility of safe questions to sets of atomic yes-no questions

In J. Jadacki & J. Pasniczek (eds.), The Lvov-Warsaw School: The New Generation. Reidel. pp. 6--215 (2006)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,674

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Reducibility of questions to sets of yes-no questions'.A. Wisniewski - 1993 - Bulletin of the Section of Logic 22:119-126.
Wtt-degrees and t-degrees of R.e. Sets.Michael Stob - 1983 - Journal of Symbolic Logic 48 (4):921-930.
The Medvedev lattice of computably closed sets.Sebastiaan A. Terwijn - 2006 - Archive for Mathematical Logic 45 (2):179-190.
On Subcreative Sets and S-Reducibility.John T. Gill Iii & Paul H. Morris - 1974 - Journal of Symbolic Logic 39 (4):669 - 677.
On the reducibility of questions.Andrzej Wiśniewski - 1994 - Erkenntnis 40 (2):265-284.
Monotone reducibility and the family of infinite sets.Douglas Cenzer - 1984 - Journal of Symbolic Logic 49 (3):774-782.
Strong Enumeration Reducibilities.Roland Sh Omanadze & Andrea Sorbi - 2006 - Archive for Mathematical Logic 45 (7):869-912.
Sets without Subsets of Higher Many-One Degree.Patrizio Cintioli - 2005 - Notre Dame Journal of Formal Logic 46 (2):207-216.
An approach to why-questions.Antti Koura - 1988 - Synthese 74 (2):191 - 206.
Knowing‐'wh', Mention‐Some Readings, and Non‐Reducibility.B. R. George - 2013 - Thought: A Journal of Philosophy 2 (2):166-177.

Analytics

Added to PP
2014-02-01

Downloads
11 (#1,157,775)

6 months
1 (#1,501,709)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references