Reducibility and Completeness for Sets of Integers

Cited in

(69)

Turing oracle machines, online computing, and three displacements in computability theory
Intervals and sublattices of the r.e. weak truth table degrees. I: Density
Infima in the recursively enumerable weak truth table degrees
The \(n\)-rea enumeration degrees are dense
Complexity properties of recursively enumerable sets and sQ-completeness
Branching in the enumeration degrees of the _2⁰ sets
On \(sQ\)-completeness of recursively enumerable sets
Quasi-minimal enumeration degrees and minimal Turing degrees
Classes bounded by incomplete sets
Enumeration 1-genericity in the local enumeration degrees
Density of the cototal enumeration degrees
On restricted forms of enumeration reducibility
Fragments of the theory of the enumeration degrees
Incomparability in local structures of \(s\)-degrees and \(Q\)-degrees
Stochastic \(\lambda\)-calculi: an extended abstract
Using computability to measure complexity of algebraic structures and classes of structures
Characterizing the continuous degrees
There exists a maximal 3-c.e. enumeration degree
Splitting and nonsplitting in the \(\Sigma_2^0\) enumeration degrees
Avoiding uniformity in the \(\Delta_2^0\) enumeration degrees
C-quasi-minimal enumeration degrees below c'
Complements of finite sets of integers
Sieves and completeness properties
On the structures inside truth-table degrees
Initial segments of the \({\Sigma}_2^0\) enumeration degrees
Enumeration reducibility and computable structure theory
There Are No Maximal d.c.e. wtt-degrees
Is it harder to factor a polynomial or to find a root?
Noncappable enumeration degrees below 0_e^′
Computability in Symbolic Dynamics
Jumps of quasi-minimal enumeration degrees
T-Degrees, Jump Classes, and Strong Reducibilities
Deficiency Sets and Bounded Information Reducibilities
Recursive Linear Orders with Incomplete Successivities
A Theorem on Intermediate Reducibilities
Badness and jump inversion in the enumeration degrees
Recursively enumerable sets and degrees
Contiguity and distributivity in the enumerable Turing degrees
On existence of complete sets for bounded reducibilities
Interpreting true arithmetic in the local structure of the enumeration degrees
Some properties of an algebra of all sets of naturals e-reducible to a fixed set
Relationships between computability-theoretic properties of problems
A structural dichotomy in the enumeration degrees
A characterization of subshifts with computable language
Computing sets from all infinite subsets
Vladimir Andreevich Uspensky (27/11/1930–27/6/2018)
scientific article; zbMATH DE number 7092101 (Why is no real title available?)
Definability via Kalimullin pairs in the structure of the enumeration degrees
Splittings of effectively speedable sets and effectively levelable sets
Immunity properties and strong positive reducibilities
The enumeration degrees: local and global structural interactions
Cupping and definability in the local structure of the enumeration degrees
Enumerations of the Kolmogorov function
A characterization of the δ₂⁰ hyperhyperimmune sets
Which number theoretic problems can be solved in recursive progressions on Π₁¹-paths through O?
Bounding and nonbounding minimal pairs in the enumeration degrees
Defining totality in the enumeration degrees
Point Degree Spectra of Represented Spaces
Complexity properties of recursively enumerable sets and bsQ-completeness
Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets
Agreement reducibility
The relationship between local and global structure in the enumeration degrees
PA RELATIVE TO AN ENUMERATION ORACLE
The singleton degrees of the \({\Sigma}_2^0\) sets are not dense
A Lopez-Escobar theorem for continuous domains
Introenumerability, autoreducibility, and randomness
Constructive dimension and Turing degrees
Computing degrees of unsolvability
Strong enumeration reducibilities

This page was built for publication: Reducibility and Completeness for Sets of Integers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3843613)