Every recursively enumerable subset of natural-number n-tuples, for n≥1, has an integer-polynomial Diophantine representation with exactly one complete natural-number auxiliary tuple for each member and none for nonmembers.
Every recursively enumerable subset of natural-number n-tuples, for n≥1, has an integer-polynomial Diophantine representation with exactly one complete natural-number auxiliary tuple for each member and none for nonmembers.
Every recursively enumerable subset of natural-number n-tuples, for n≥1, has an integer-polynomial Diophantine representation with exactly one complete natural-number auxiliary tuple for each member and none for nonmembers.
If correct, resolves the single-fold conjecture and therefore the finite-fold conjecture for recursively enumerable sets.
Does every recursively enumerable set have a one-witness Diophantine representation?
Publication dates and editorial changes.
Allow optional Google Analytics to help improve AIProofWatch? Privacy details.
