2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/154346It 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 correctedLogic03D25Two universal 3-quantifier representations of recursively enumerable setstext