Two universal 3-quantifier representations of recursively enumerable sets
Reviewed by Pithpith:5HC6AX3Gopen to challenge →
classification
math.LO
keywords
enumerablerecursivelysetsarithmeticformulaskindsnaturalnumbers
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.