most citedAckermannian and Primitive-Recursive Bounds with Dickson's Lemma

107 citations · 107 across the 1 of their papers we have counts for

collaborators

1 paper

cs.LO2010★ 107 cited

Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma

Diego Figueira, Santiago Figueira, Sylvain Schmitz +1

Dickson's Lemma is a simple yet powerful tool widely used in termination proofs, especially when dealing with counters or related data structures. However, most computer scientists…