Computable Reductions and Reverse Mathematics

DOI10.1007/978-3-319-40189-8_19zbMath1476.03006OpenAlexW4255156525MaRDI QIDQ3188256

D. Reed Solomon

Publication date: 17 August 2016

Published in: Pursuit of the Universal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-40189-8_19

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (1)

Weihrauch Complexity in Computable Analysis

Cites Work

• The weakness of being cohesive, thin or free in reverse mathematics
• The uniform content of partial and linear orders
• On the strength of Ramsey's theorem for pairs
• A Δ₂⁰ set with no infinite low subset in either it or its complement
• On uniform relationships between combinatorial problems
• Ramsey’s theorem for singletons and strong computable reducibility
• STRONG REDUCTIONS BETWEEN COMBINATORIAL PRINCIPLES
• On notions of computability-theoretic reduction between Π21 principles
• The metamathematics of Stable Ramsey’s Theorem for Pairs
• Combinatorial principles weaker than Ramsey's Theorem for pairs
• On the role of the collection principle for Σ⁰₂-formulas in second-order reverse mathematics

This page was built for publication: Computable Reductions and Reverse Mathematics