Two universal 3-quantifier representations of recursively enumerable sets

Julia Robinson; Yuri Matiyasevich

REVIEW

Two universal 3-quantifier representations of recursively enumerable sets

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

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

classification math.LO

keywords enumerablerecursivelysetsarithmeticformulaskindsnaturalnumbers

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

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.

Two universal 3-quantifier representations of recursively enumerable sets

discussion (0)