A computable analysis of variable words theorems
From MaRDI portal
Publication:4644466
DOI10.1090/PROC/14269zbMath1484.03017arXiv1710.11219OpenAlexW2963976702WikidataQ129637114 ScholiaQ129637114MaRDI QIDQ4644466
Benoit Monin, Lu Liu, Ludovic Patey
Publication date: 7 January 2019
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.11219
Permutations, words, matrices (05A05) Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Effectiveness for infinite variable words and the dual Ramsey theorem
- A dual form of Ramsey's theorem
- Probabilistic Constructions of Computable Objects and a Computable Version of Lovász Local Lemma
- Open Questions in Reverse Mathematics
- The reverse mathematics of Hindman’s Theorem for sums of exactly two elements
This page was built for publication: A computable analysis of variable words theorems