Computing sets from all infinite subsets

DOI10.1090/tran/8468zbMath1485.03158arXiv2011.03386OpenAlexW3177445598MaRDI QIDQ5158110

Noam Greenberg, Ludovic Patey, Matthew Harrison-Trainor, Dan Turetsky

Publication date: 21 October 2021

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2011.03386

zbMATH Keywords

introenumerable setsintroreducible sets

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Other Turing degree structures (03D28)

Cites Work

• Unnamed Item
• Unnamed Item
• Computability and complexity. Essays dedicated to Rodney G. Downey on the occasion of his 60th birthday
• Definability in the Turing degrees
• On the strength of Ramsey's theorem
• Pigeons do not jump high
• Asymptotic density and the coarse computability bound
• Generic computability, Turing degrees, and asymptotic density
• RT₂² does not imply WKL₀
• Controlling iterated jumps of solutions to combinatorial problems
• Retraceable Sets
• On a problem of Kleene’s
• The Strength of Some Combinatorial Principles Related to Ramsey's Theorem for Pairs
• Reducibility and Completeness for Sets of Integers
• Hyperarithmetically Encodable Sets
• Borel sets and Ramsey's theorem
• A MINIMAL PAIR IN THE GENERIC DEGREES
• Measuring the complexity of reductions between equivalence relations
• Cone avoiding closed sets
• Uniformly introreducible sets
• Sets with no subset of higher degree
• Recursive Pseudo-Well-Orderings