Does Every Recursively Enumerable Set Admit a Finite-Fold Diophantine Representation?

Domenico Cantone, Alberto Casagrande, Francesco Fabris, Eugenio G. Omodeo. Does Every Recursively Enumerable Set Admit a Finite-Fold Diophantine Representation?. In Alberto Casagrande, Eugenio G. Omodeo, editors, Proceedings of the 34th Italian Conference on Computational Logic, Trieste, Italy, June 19-21, 2019. Volume 2396 of CEUR Workshop Proceedings, pages 104-122, CEUR-WS.org, 2019. [doi]

@inproceedings{CantoneCFO19,
  title = {Does Every Recursively Enumerable Set Admit a Finite-Fold Diophantine Representation?},
  author = {Domenico Cantone and Alberto Casagrande and Francesco Fabris and Eugenio G. Omodeo},
  year = {2019},
  url = {http://ceur-ws.org/Vol-2396/paper11.pdf},
  researchr = {https://researchr.org/publication/CantoneCFO19},
  cites = {0},
  citedby = {0},
  pages = {104-122},
  booktitle = {Proceedings of the 34th Italian Conference on Computational Logic, Trieste, Italy, June 19-21, 2019},
  editor = {Alberto Casagrande and Eugenio G. Omodeo},
  volume = {2396},
  series = {CEUR Workshop Proceedings},
  publisher = {CEUR-WS.org},
}