The coding power of a product of partitions

DOI10.1007/s11856-023-2475-yarXiv2006.03228OpenAlexW3033978276MaRDI QIDQ6165184

Lu Liu

Publication date: 31 July 2023

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

General logic (03Bxx) Proof theory and constructive mathematics (03Fxx) Computability and recursion theory (03Dxx)

Cites Work

• Unnamed Item
• Cohesive sets and rainbows
• Binary subtrees with few labeled paths
• Infinite subsets of random sets of integers
• On the strength of Ramsey's theorem
• \({\Pi}_1^0\)-encodability and omniscient reductions
• Extracting randomness within a subset is hard
• On the strength of Ramsey's theorem for pairs
• RT₂² does not imply WKL₀
• Ramsey’s theorem for singletons and strong computable reducibility
• Ramsey's theorem and cone avoidance
• A fixed-point-free minimal degree
• Hyperarithmetically Encodable Sets
• Some results concerning the SRT 2 2 vs. COH problem
• The weakness of the pigeonhole principle under hyperarithmetical reductions
• Diagonally non-recursive functions and effective Hausdorff dimension
• FORCING WITH BUSHY TREES

This page was built for publication: The coding power of a product of partitions