1. A sharp version of the bounded Matijasevich conjecture and the end-extension problem;Adamowicz;J. Symbolic Logic,1992
2. Diophantine complexity;Adleman,1976
3. The theorem of Matijasevich is provable in Peano's arithmetic by finitely many axioms;Carstens;Logique et Analyse,1977
4. Arithmetical problems and recursively enumerable predicates (abstract);Davis;J Symbolic Logic,1950
5. Arithmetical problems and recursively enumerable predicates;Davis;J Symbolic Logic,1953