77 citations
- Université Paris-Est CréteilFR14 papers
- Centre National de la Recherche ScientifiqueFR7 papers
- Laboratoire d'Informatique Algorithmique: Fondements et ApplicationsFR5 papers
- Paris-Est SupFR5 papers
- Institute of Mathematics and Computer ScienceMD3 papers
- Université Paris DiderotFR3 papers
- Åbo Akademi UniversityFI2 papers
- Institut de Mécanique et d'Ingénierie de BordeauxFR2 papers
- Institut national de recherche en sciences et technologies du numériqueFR2 papers
- Laboratoire d'Informatique de Paris-NordFR2 papers
- Laboratoire d'Informatique Gaspard-MongeFR2 papers
- Laboratoire Spécification et VérificationFR2 papers
Showing math.LOShow all
2 papers · 1 filter
math.LO2020★ 3 cited
Milliken's tree theorem and its applications: a computability-theoretic perspective
Paul-Elliot Anglès d'Auriac, Peter A. Cholak, Damir D. Dzhafarov +2
Milliken's tree theorem is a deep result in combinatorics that generalizes a vast number of other results in the subject, most notably Ramsey's theorem and its many variants and co…
math.LO2006
On the additive theory of prime numbers II
Patrick Cegielski, Denis Richard, Maxim Vsemirnov
The undecidability of the additive theory of primes (with identity) as well as the theory Th(N,+, n -> p\_n), where p\_n denotes the (n+1)-th prime, are open questions. As a possib…