Two universal 3-quantifier representations of recursively enumerable sets
arXiv:0802.1052
Abstract
It is proved that all recursively enumerable sets of natural numbers can be represented by arithmetic formulas (of two kinds) with only 3 quantifiers.
This is English translation of a paper originally published in Russian; several misprints were corrected