Combinatorial principles equivalent to weak induction

DOI10.3233/COM-180244zbMath1485.03025arXiv1812.09943MaRDI QIDQ5131651

Denis R. Hirschfeldt, Keita Yokoyama, Jake Pardo, Caleb Davis, Arno Pauly, Jeffry L. Hirst

Publication date: 9 November 2020

Published in: Computability (Search for Journal in Brave)

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

zbMATH Keywords

inductionreverse mathematicsWeihrauch reduction

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Ramsey theory (05D10) Second- and higher-order arithmetic and fragments (03F35) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (2)

Reverse mathematics and colorings of hypergraphs ⋮ On the Weihrauch degree of the additive Ramsey theorem over the rationals

This page was built for publication: Combinatorial principles equivalent to weak induction