Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,300 papers from all fields of science
Search
Sign In
Create Free Account
Reduction (recursion theory)
Known as:
Reducibility relation
, Reduction
In computability theory, many reducibility relations (also called reductions, reducibilities, and notions of reducibility) are studied. They are…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
13 relations
Analytical hierarchy
Arithmetical hierarchy
Computational complexity theory
Halting problem
Expand
Broader (1)
Computability theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Truthmaking, Supervenience, and Reduction
M. Zamani
Grazer Philosophische Studien
2018
Corpus ID: 172078779
There are two main theories of ontological commitment: the quantifier view, and the truthmaker view. Since there are some truths…
Expand
2014
2014
An Isomorphism Theorem for Partial Numberings
D. Spreen
Logic, Computation, Hierarchies
2014
Corpus ID: 1377891
As has been shown by the author, standard numberings of the computable real numbers and similar effectively given topological…
Expand
2011
2011
Degrees of non-determinacy and game logics on cardinals under the axiom of determinacy
Zhenhao Li
2011
Corpus ID: 91917657
Blass showed that on each infinite cardinal, there is an algebra structure of games on it. Blass defined a reducibility relation…
Expand
2009
2009
Definability in the local theory of the ω-enumeration degrees
Hristo Ganchev
2009
Corpus ID: 8982858
We continue the study of the local theory of the structure of the ω-enumeration degrees, started by Soskov and Ganchev [7]. We…
Expand
2008
2008
Csc5160: Combinatorial Optimization and Approximation Algorithms Topic: Introduction to Np-complete Problems
C. Lau
,
J. Le
2008
Corpus ID: 11211128
This lecture gives a general introduction of P, NP and NP-complete problems. We will study the definition and some classic…
Expand
2005
2005
Strong reducibility of partial numberings
D. Spreen
Archive for Mathematical Logic
2005
Corpus ID: 18140639
Abstract.A strong reducibility relation between partial numberings is introduced which is such that the reduction function…
Expand
2004
2004
DOUBLE JUMP INVERSIONS AND STRONG MINIMAL COVERS IN THE TURING DEGREES
Yuval Gabay
2004
Corpus ID: 17466533
Decidability problems for (fragments of) the theory of the structure D of Turing degrees, form a wide and interesting class, much…
Expand
Highly Cited
1986
Highly Cited
1986
Randomness, Relativizations, and Polynomial Reducibilities
K. Ambos-Spies
Symposium on Computation Theory
1986
Corpus ID: 45965759
We show that, for any set A which cannot be computed in polynomial time, the class of sets p-many-one incomparable with A has…
Expand
1984
1984
The quotient semilattice of the recursively enumerable degrees modulo the cappable degrees
S. Schwarz
1984
Corpus ID: 85561007
In this paper, we investigate the quotient semilattice R/M of the r.e. degrees modulo the cappable degrees. We first prove the R…
Expand
1984
1984
On the log-space reducibility among array languages /preliminary version/
Marek Ejsmont
Symposium on Computation Theory
1984
Corpus ID: 10934771
In this paper we consider a 2-dimensional array acceptor, called Turing array machine /TAM/, which is a generalization of k-tape…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE