Brown’s lemma in second-order arithmetic

DOI10.4064/fm221-9-2016zbMath1420.03025arXiv1512.04195OpenAlexW2963347580WikidataQ61308194 ScholiaQ61308194MaRDI QIDQ5268786

Emanuele Frittaion

Publication date: 20 June 2017

Published in: Fundamenta Mathematicae (Search for Journal in Brave)

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

zbMATH Keywords

reverse mathematicscombinatorial number theorypiecewise syndeticelementary function arithmetic

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Foundations of classical theories (including reverse mathematics) (03B30) Ramsey theory (05D10) Second- and higher-order arithmetic and fragments (03F35)

Related Items (2)

Carlson-Simpson's lemma and applications in reverse mathematics ⋮ “Weak yet strong” restrictions of Hindman’s Finite Sums Theorem

This page was built for publication: Brown’s lemma in second-order arithmetic