most citedTwo universal 3-quantifier representations of recursively enumerable sets

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

collaborators
Showing math.LOShow all

1 paper · 1 filter

math.LO2008★ 4 cited

Two universal 3-quantifier representations of recursively enumerable sets

Yuri Matiyasevich, Julia Robinson

It is proved that all recursively enumerable sets of natural numbers can be represented by arithmetic formulas (of two kinds) with only 3 quantifiers.