On existence of complete sets for bounded reducibilities
β Scribed by Valeriy Bulitko; Vadim Bulitko
- Publisher
- John Wiley and Sons
- Year
- 2003
- Tongue
- English
- Weight
- 165 KB
- Volume
- 49
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
Classical reducibilities have complete sets U that any recursively enumerable set can be reduced to U. This paper investigates existence of complete sets for reducibilities with limited oracle access. Three characteristics of classical complete sets are selected and a natural hierarchy of the bounds on oracle access is built. As the bounds become stricter, complete sets lose certain characteristics and eventually vanish. (Β© 2003 WILEYβVCH Verlag GmbH & Co. KGaA, Weinheim)
π SIMILAR VOLUMES
In this paper we investigate the following two questions: Q1: Do there exist optimal proof systems for a given language L? Q2: Do there exist complete problems for a given promise class C? For concrete languages L (such as TAUT or SAT) and concrete promise classes C (such as NP β© coNP, UP, BPP, dis
## Abstract This paper presents necessary and sufficient conditions for an __n__ βth order differential equation to have a nonβcontinuable solution with finite limits of its derivatives up to the order __l__ at the rightβhand end point of the interval of its definition, __l__ β€ __n__ β 2 (Β© 2010 WI
ON AXIOMS OF CONDITIONAL SET EXISTENCE1) by HAO WANU in Cambridge, Mass. (U.S.A.) ## 1. Outline of arguments I n what follows, the (restricted) predicate calculus with equality is assumed throughout. Let ( U ! u ) H u be short for (w) ( u ) ((Hw A H u ) 13 w = u ) , ( E ! y ) H y be short for (Ey)
## Abstract We consider continuous monotone linear functionals on a locally convex ordered topological vector space that are sandwiched between a given \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$(\mathbb R\cup \lbrace +\infty \rbrace )$\end{document}βvalued subline