Classes of Recursively Enumerable Sets and Degrees of Unsolvability
From MaRDI portal
Publication:5571699
Cited in
(only showing first 100 items - show all)- Elementary differences among jump classes
- Comparison of linear reducibility with other reducibilities of tabular type
- Upper bounds for the arithmetical degrees
- Maximal theories
- Lattice of recursively enumerable subalgebras of a recursive Boolean algebra
- Three theorems on tt-degrees
- Countable thin ^0_1 classes
- Pointwise decomposable sets
- The extent and density of sequences within the minimal-program complexity hierarchies
- Two existence theorems for computable numerations
- r-maximal major subsets
- Supersets of recursively enumerable sets
- Definable properties of the computably enumerable sets
- Splitting theorems in recursion theory
- Computational depth and reducibility
- Coding in the partial order of enumerable sets
- Some orbits for \({\mathcal E}\)
- Orbits of computably enumerable sets: Low sets can avoid an upper cone
- On the strength of Ramsey's theorem
- The lattice of recursively enumerable substructures of an effective closure system
- Nonbounding and Slaman triples
- There is no fat orbit
- On the lattices of NP-subspaces of a polynomial time vector space over a finite field
- Computable analogs of cardinal characteristics: prediction and rearrangement
- Turing computability: structural theory
- Pigeons do not jump high
- Spectrum of the field of computable real numbers
- Small \(\Pi^{0}_{1}\) classes
- Hypersimple sets with retraceable complements
- Automorphisms of the lattice of _1⁰ classes; perfect thin classes and anc degrees
- \(\mathcal{D}\)-maximal sets
- Asymptotic density and the coarse computability bound
- Orbits of maximal vector spaces
- Nonhemimaximal degrees and the high/low hierarchy
- Weakly represented families in reverse mathematics
- Jump inversions inside effectively closed sets and applications to randomness
- Low sets without subsets of higher many-one degree
- Degree invariance in the \(\Pi ^{0}_{1}\) classes
- Inductive inference and reverse mathematics
- Recursive isomorphism types of recursive Boolean algebras
- Hierarchy of Computably Enumerable Degrees II
- Bounding non-GL2 and R.E.A.
- Uniform almost everywhere domination
- When van Lambalgen’s Theorem fails
- A limit on relative genericity in the recursively enumerable sets
- Dimensions of Points in Self-similar Fractals
- Automorphisms of supermaximal subspaces
- Two theorems on degrees of models of true arithmetic
- On the orbits of hyperhypersimple sets
- Maximal and Cohesive vector spaces
- A Decidable Fragment of the Elementary Theory of the Lattice of Recursively Enumerable Sets
- Deficiency Sets and Bounded Information Reducibilities
- Recursion theory on orderings. I. A model theoretic setting
- Recursion theory on orderings. II
- On r.e. and co-r.e. vector spaces with nonextendible bases
- Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets
- Minimal-program complexity of pseudo-recursive and pseudo-random sequences
- Determining Automorphisms of the Recursively Enumerable Sets
- On the Relations between Some Rate-of-Growth Conditions
- α-Degrees of maximal α-r.e. sets
- Recursively enumerable sets and degrees
- Computational complexity, speedable and levelable sets
- Double jumps of minimal degrees
- Working below a high recursively enumerable degree
- Codable sets and orbits of computably enumerable sets
- Jump equivalence of the Δ20 hyperimmune sets
- Definable Encodings in the Computably Enumerable Sets
- Computable Polish group actions
- THE COMPUTATIONAL CONTENT OF INTRINSIC DENSITY
- Computational depth and reducibility
- A hierarchy of computably enumerable degrees
- Definable relations in Turing degree structures
- On the Lattice of Recursively Enumerable Sets
- Automorphisms of the lattice of recursively enumerable sets
- ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS
- Degree theoretic definitions of the low2 recursively enumerable sets
- Degrees bounding principles and universal instances in reverse mathematics
- The nonlow computably enumerable degrees are not invariant in \(\mathcal{E}\)
- Indifferent sets for genericity
- ON SUPERSETS OF NON-LOW SETS
- Schnorr triviality and genericity
- Almost everywhere domination
- The Complexity of Orbits of Computably Enumerable Sets
- On very high degrees
- On a conjecture of Dobrinen and Simpson concerning almost everywhere domination
- Prime models of computably enumerable degree
- On the Degrees of Index Sets
- The degrees of hyperhyperimmune sets
- On the Degrees of Index Sets. II
- Degrees of recursively enumerable sets which have no maximal supersets
- Simplicity of recursively enumerable sets
- Initial segments of the degrees of unsolvability Part II: minimal degrees
- Recursively enumerable sets which are uniform for finite extensions
- Some theorems on R-maximal sets and major subsets of recursively enumerable sets
- Degrees of sets having no subsets of higher m- and t t-degree
- Robust learning with infinite additional information
- Numberings, c.e. oracles, and fixed points
- Classifying word problems of finitely generated algebras via computable reducibility
- A superhigh diamond in the c.e. tt-degrees
- Some recent research directions in the computably enumerable sets
This page was built for publication: Classes of Recursively Enumerable Sets and Degrees of Unsolvability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5571699)
