Uniformly introreducible sets
From MaRDI portal
Publication:5549803
DOI10.2307/2271359zbMath0165.01901OpenAlexW2060142264MaRDI QIDQ5549803
Publication date: 1968
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2271359
Related Items
On needed reals, Hyperarithmetically Encodable Sets, THE DETERMINED PROPERTY OF BAIRE IN REVERSE MATH, Genericity for Mathias forcing over general Turing ideals, Computing sets from all infinite subsets, Needed reals and recursion in generic reals, On btt-reducibilities. II, Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets, \({\Pi^1_2}\)-comprehension and the property of Ramsey, Effectiveness for the dual Ramsey theorem, Bounded Immunity and Btt-Reductions, Relativization of the Theory of Computational Complexity
Cites Work
- Unnamed Item
- Three theorems on the degrees of recursively enumerable sets
- Splitting and decomposition by regressive sets. I
- The minimum of two regressive isols
- Retraceable Sets
- Recursively Enumerable Sets and Retracing Functions
- Arithmetical Sets and Retracing Functions
- Splitting and Decomposition by Regressive Sets, II
