The reviewed record of science sign in
Pith

arxiv: 0802.1052 · v1 · pith:5HC6AX3G · submitted 2008-02-07 · math.LO

Two universal 3-quantifier representations of recursively enumerable sets

Yuri Matiyasevich , Julia Robinson This is my paper

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:5HC6AX3Grecord.jsonopen to challenge →

classification math.LO
keywords enumerablerecursivelysetsarithmeticformulaskindsnaturalnumbers
0
0 comments X
read the original 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 paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.