Effectively Retractable Theories and Degrees of Undecidability. - James P. Jones (J. Symb. Log., 1969)

Three Universal Representations of Recursively Enumerable Sets. - James P. Jones (J. Symb. Log., 1978)

Some diophantine forms of gödel's theorem. - Verena H. Dyson; James P. Jones; John C. Shepherdson (Arch. Math. Log., 1980)

Classification of Quantifier Prefixes Over Diophantine Equations. - James P. Jones (Math. Log. Q., 1981)

Universal Diophantine Equation. - James P. Jones (J. Symb. Log., 1982)

Variants of Robinson's essentially undecidable theoryR. - James P. Jones; John C. Shepherdson (Arch. Math. Log., 1983)

Register Machine Proof of the Theorem on Exponential Diophantine Representation of Enumerable Sets. - James P. Jones; Yuri V. Matijasevic (J. Symb. Log., 1984)

Classification of Quantifier Prefixes Over Exponential Diophantine Equations. - James P. Jones; Hilbert Levitz; A. J. Wilkie (Math. Log. Q., 1986)

Complexities of Winning Strategies in Diophantine Games. - James P. Jones; Aviezri S. Fraenkel (J. Complex., 1995)

On Series of Ordinals and Combinatorics. - James P. Jones; Hilbert Levitz; Warren D. Nichols (Math. Log. Q., 1997)