Two universal 3-quantifier representations of recursively enumerable sets
Logic
2008-02-08 v1
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.
Keywords
Cite
@article{arxiv.0802.1052,
title = {Two universal 3-quantifier representations of recursively enumerable sets},
author = {Yuri Matiyasevich and Julia Robinson},
journal= {arXiv preprint arXiv:0802.1052},
year = {2008}
}
Comments
This is English translation of a paper originally published in Russian; several misprints were corrected