Two universal 3-quantifier representations of recursively enumerable sets

Details Two universal 3-quantifier representations of recursively enumerable sets Two universal 3-quantifier representations of recursively enumerable sets

2008-02-07

arxiv.org/abs/0802.1052v1

Teoriya Algorifmov i Matematicheskaya Logika (a collection of papers dedicated to A.A.Markov), Vychislitel'nyi Tsentr Akademii

Mathematics

Logic

This is English translation of a paper originally published in Russian; several misprints were corrected

Scientific paper

It is proved that all recursively enumerable sets of natural numbers can be
represented by arithmetic formulas (of two kinds) with only 3 quantifiers.

Affiliated with

Also associated with

No associations

Rating

Two universal 3-quantifier representations of recursively enumerable sets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Two universal 3-quantifier representations of recursively enumerable sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Two universal 3-quantifier representations of recursively enumerable sets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-507877