Uniformly introreducible sets

DOI10.2307/2271359MaRDI QIDQ5549803zbMATH OpenOpenAlexFDO

Authors Carl G. jun. Jockusch

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

zbMATH Keywords

recursion theory, constructive mathematics

Cites work

• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Arithmetical Sets and Retracing Functions
• Recursively Enumerable Sets and Retracing Functions
• Retraceable Sets
• Splitting and Decomposition by Regressive Sets, II
• Splitting and decomposition by regressive sets. I
• The minimum of two regressive isols
• Three theorems on the degrees of recursively enumerable sets

Cited in

(13)

• Computing sets from all infinite subsets
• Needed reals and recursion in generic reals
• Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets
• Effectiveness for the dual Ramsey theorem
• On needed reals
• THE DETERMINED PROPERTY OF BAIRE IN REVERSE MATH
• Relativization of the Theory of Computational Complexity
• \({\Pi^1_2}\)-comprehension and the property of Ramsey
• Introenumerability, autoreducibility, and randomness
• Hyperarithmetically Encodable Sets
• Genericity for Mathias forcing over general Turing ideals
• Bounded Immunity and Btt-Reductions
• On btt-reducibilities. II

This page was built for publication: Uniformly introreducible sets

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