## Two universal 3-quantifier representations of recursively enumerable sets

##### Authors
Matiyasevich, Yuri
Robinson, Julia
##### Description
It is proved that all recursively enumerable sets of natural numbers can be represented by arithmetic formulas (of two kinds) with only 3 quantifiers.
Comment: This is English translation of a paper originally published in Russian; several misprints were corrected
##### Keywords
Mathematics - Logic, 03D25