We show that any countable distributive lattice can be embedded in any interval of polynomial time degrees. Furthermore the embeddings can be chosen to preserve the least or the greatest element. This holds for both polynomial time bounded many-one and Turing reducibilities, as well as for all of the common intermediate reducibilities
AbstractWe prove a number of structural theorems about the honest polynomial m-degrees (denoted by H...
AbstractIt is shown that every locally countable upper semi-lattice of cardinality the continuum can...
AbstractThe goal of extending work on relative polynomial time computability from computations relat...
this paper, we show that they can be, by proving that for every nonzero a 2 R, every countable distr...
Abstract Let Pw and PM be the countable distributive lattices of Muchnik and Medvedev degrees of non...
Abstract. We give an abstract account of resource-bounded reducibilities as exemplified by the polyn...
AbstractAmbos-Spies (1984a) showed that the two basic nondistributive lattices can be embedded in Rp...
Abstract. We introduce polynomial time enumeration reducibility (≤pe) and we retrace Selman’s analys...
Archive for Mathematical Logic Let Pw and PM be the countable distributive lattices of Muchnik and M...
Rod Downey , Victoria University of Wellington New Zealand Andr'e Nies y The University of...
We present a necessary and sufficient condition for embedding principally decomposable finite lattic...
AbstractWe prove that the theory of Exptime degrees with respect to polynomial time Turing and many-...
AbstractWe study the honest versions of polynomial time bounded many-one and Turing reducibility. We...
AbstractLet b and c be r.e. Turing degrees such that b>c. We show that there is an r.e. degree a suc...
AbstractWe introduce the notion bounded relation which comprises most resource bounded reducibilitie...
AbstractWe prove a number of structural theorems about the honest polynomial m-degrees (denoted by H...
AbstractIt is shown that every locally countable upper semi-lattice of cardinality the continuum can...
AbstractThe goal of extending work on relative polynomial time computability from computations relat...
this paper, we show that they can be, by proving that for every nonzero a 2 R, every countable distr...
Abstract Let Pw and PM be the countable distributive lattices of Muchnik and Medvedev degrees of non...
Abstract. We give an abstract account of resource-bounded reducibilities as exemplified by the polyn...
AbstractAmbos-Spies (1984a) showed that the two basic nondistributive lattices can be embedded in Rp...
Abstract. We introduce polynomial time enumeration reducibility (≤pe) and we retrace Selman’s analys...
Archive for Mathematical Logic Let Pw and PM be the countable distributive lattices of Muchnik and M...
Rod Downey , Victoria University of Wellington New Zealand Andr'e Nies y The University of...
We present a necessary and sufficient condition for embedding principally decomposable finite lattic...
AbstractWe prove that the theory of Exptime degrees with respect to polynomial time Turing and many-...
AbstractWe study the honest versions of polynomial time bounded many-one and Turing reducibility. We...
AbstractLet b and c be r.e. Turing degrees such that b>c. We show that there is an r.e. degree a suc...
AbstractWe introduce the notion bounded relation which comprises most resource bounded reducibilitie...
AbstractWe prove a number of structural theorems about the honest polynomial m-degrees (denoted by H...
AbstractIt is shown that every locally countable upper semi-lattice of cardinality the continuum can...
AbstractThe goal of extending work on relative polynomial time computability from computations relat...
DOI
Add to ORKG