Reducibility of Safe Questions to Sets of Atomic Yes-No Questions

Poznan Studies in the Philosophy of the Sciences and the Humanities 89:215-235 (2006)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Reducibility of safe questions to sets of atomic yes-no questions.Andrzej WiĞniewski - 2006 - In J. Jadacki & J. Pasniczek (eds.), Poznan Studies in the Philosophy of the Sciences and the Humanities. Reidel. pp. 6--215.
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.
Reducibility of Questions to Sets of Questions: Some Feasibility Results.Piotr Lesniewski & Andrzej Wisniewski - 2001 - Logique Et Analyse 173:93-111.
On the reducibility of questions.Andrzej Wiśniewski - 1994 - Erkenntnis 40 (2):265-284.
On Nondeterminism, Enumeration Reducibility and Polynomial Bounds.Kate Copestake - 1997 - Mathematical Logic Quarterly 43 (3):287-310.
On Subcreative Sets and S-Reducibility.John T. Gill Iii & Paul H. Morris - 1974 - Journal of Symbolic Logic 39 (4):669 - 677.
The logic of questions as a theory of erotetic arguments.Andrzej Wiśniewski - 1996 - Synthese 109 (1):1 - 25.
Monotone reducibility and the family of infinite sets.Douglas Cenzer - 1984 - Journal of Symbolic Logic 49 (3):774-782.
Computably enumerable sets and quasi-reducibility.R. Downey, G. LaForte & A. Nies - 1998 - Annals of Pure and Applied Logic 95 (1-3):1-35.
A characterization of the Δ⁰₂ hyperhyperimmune sets.Roland Sh Omanadze & Andrea Sorbi - 2008 - Journal of Symbolic Logic 73 (4):1407-1415.
Strong Enumeration Reducibilities.Roland Sh Omanadze & Andrea Sorbi - 2006 - Archive for Mathematical Logic 45 (7):869-912.
Immunity properties and strong positive reducibilities.Irakli O. Chitaia, Roland Sh Omanadze & Andrea Sorbi - 2011 - Archive for Mathematical Logic 50 (3-4):341-352.
Erotetic implications.Andrzej Wiśniewski - 1994 - Journal of Philosophical Logic 23 (2):173 - 195.

Analytics

Added to PP
2017-02-16

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Author's Profile

Andrzej Wiśniewski
Adam Mickiewicz University

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references