List of Publications of J.P. Jones:

1. J.P. Jones and Peter Csontos, Notes on Computer Programming, University of Washington Press, 1966, ii + 55 pp.
2. J.P. Jones, Effectively retractable theories and degrees of undecidability, Jour. of Symbolic Logic 34 (1969) 597-604.
3. J.P. Jones, Independent recursive axiomatizability in arithmetic, Proc. Amer. Math. Soc. 23 (1969), 107-113.
4. J.P. Jones and Stan Toporowski, Irrational numbers, Amer. Math. Monthly 80 (1973), 423-424.
5. J.P. Jones, Recursive undecidability - an exposition, Amer. Math. Monthly 81 (1974), 724-738. MR 50:9568.
6. J.P. Jones, Formula for the nth prime number, Canadian Math. Bulletin 18 (1975), 433-434.
7. J.P. Jones, Diophantine representation of the Fibonacci numbers, Fibonacci Quarterly 13 (1975), 84-88. MR 52:3035. Abstract
8. J.P. Jones, Diophantine representation of the Lucas numbers, Fibonacci Quarterly 14 (1976), 134-134. MR 53:2818. Abstract
9. J.P. Jones, Hideo Wada and Daihachiro Sato and Douglas Wiens Diophantine representation of the set of prime numbers, Amer. Math. Monthly 83 (1976), 449-464. MR 54:2615. Abstract
10. J.P. Jones, Three universal representations of recursively enumerable sets, Jour. of Symbolic Logic 43 (1978), 335-351. MR 58:16226.
11. J.P. Jones, Diophantine representation of Mersenne and Fermat primes, Acta Arithmetica 35 (1979) 209-221. MR 81a:10020.
12. J.P. Jones, Undecidable diophantine equations, Bulletin of the Amer. Math. Soc. 3 (1980), No. 2, 859-862. MR 81k:10094.
13. J.P. Jones, Classification of quantifier prefixes over diophantine equations, Zeitschrift fur Mathematische Logik und Grundlagen der Math. 27 (1981), 403-410. MR 83a:03037.
14. J.P. Jones and John C. Shepherdson and Verena H. Dyson, Some diophantine forms of Godel's Theorem, Archiv fur Math. Logik und Grundlagenforschung 22 (1982) 51-60.
15. J.P. Jones, Universal diophantine equation, Jour. of Symbolic Logic 47 (1982), 549-571. MR 84e:10070. Abstract
16. J.P. Jones, Some undecidable determined games, International Journal of Game Theory 11 (1982), no. 2, 63-70. MR 84b:90107. Abstract
17. J.P. Jones and Y.V. Matijasevic, A new representation for the symmetric binomial coefficient and its applications, Ann. Sci. Math. Quebec 6 (1982) 81-97. MR 84g:03060.
18. J.P. Jones and Y.V. Matijasevic, Exponential diophantine representation of recursively enumerable sets, Proceedings of the Herbrand Symposium, Marseilles, France 1981, 159-177, Studies in Logic and Foundations of Math., vol. 107, North-Holland, Amsterdam and N.Y., 1982.
19. J.P. Jones and Shepherdson, John C., Variants of Robinson's essentially undecidable theory R, Archiv fur Math. Logik und Grundlagenforschung 23 (1983), 61-64. MR 85d:03088.
20. J.P. Jones and Y.V. Matijasevic, Direct translation of register machines into exponential diophantine equations, First GTI Workshop in Foundations of Theoretical Computer Science, 1982, Lutz Priese ed., Fachbereich Mathematik-Informatik, Universitat Gesamthochschule, 1983, Paderborn, West Germany, 117-130.
21. J.P. Jones and Y.V. Matijasevic, Register machine proof of the theorem on exponential diophantine representation of enumerable sets, Jour. of Symbolic Logic 49 (1984), 818-829.
22. J.P. Jones, Hilbert Levitz and Alex. J. Wilkie, Classification of quantifier prefixes over exponential diophantine equations, Zeitschrift fur Mathematische Logik und Grundlagen der Math. 32 (1986), 399-406.
23. J.P. Jones, Elementary properties of the class of nondeterministic polynomial time computable functions, Proceedings of the Semester on Mathematical Problems in Computation Theory, 1985, Banach Centre Publications, Polish Academy of Sci. Warsaw, vol. 21 (1988) 277-283.
24. J.P. Jones, Diophantine representation of the set of Fibonacci numbers over natural numbers, Applications of Fibonacci Numbers vol. 3, Proceedings of the Third International Conference on Fibonacci Numbers and their Applications, Pisa, Italy, July 25 -29, 1988, G.E. Bergum et. al. (eds.), Kluwer Academic Publishers, Dordrecht, 197-201. Abstract
25. J.P. Jones, Basis for the Kalmár elementary functions, Number theory and applications, Banff, Alberta, 1988, 435-444, NATO Adv. Sci. Inst. Ser. C: Math. Phys. Sci., 265, Kluwer Acad. Publ., Dordrecht, 1989.
26. J.P. Jones and Y.V. Matijasevic, Basis for the polynomial time computable functions, Number theory, Banff, Alberta, 1988, 255-270, Walter de Gruyter, Berlin, 1990.
27. J.P. Jones and Y.V. Matijasevic, Proof of recursive unsolvability of Hilbert's tenth problem, Amer. Math. Monthly 98 (1991), 689-709.
28. J.P. Jones, Computational complexity of winning strategies in polynomial two player games (Russian), Theory of Computational Complexity vol. 5, D.Yu. Grigoriev ed., Zapiski Nauchnikh Seminar Leningrad Branch Steklov Math. Institute vol. 192 (1991) 69-73. Abstract
29. J.P. Jones, Computational complexity of computing winning strategies in polynomial games, Nanjing Daxue Xuebao Shuxue Bannian Kan 8 (1991), No. 1, 1-5. Abstract
30. J.P. Jones and P.G. Tsangaris, An old theorem on the GCD and its application to primes, Fibonacci Quarterly 30 (1992), 194-198.
31. J.P. Jones and Bui-Minh Phong, Quadratic residues and related problems, Ann. Univ. Sci. Budapest. Sect. Comput 13 (1992), 149-155.
32. J.P. Jones and Péter Kiss, Linear recursive sequences and power series, Publications Math. Debrecen 41 (1992), 295-306.
33. J.P. Jones and Péter Kiss, Some diophantine approximation results concerning linear recurrences, Math. Slovaca 42 (1992), 583-591
34. J.P. Jones and Péter Kiss, Exponential diophantine representation of binomial coefficients, factorials and Lucas sequences, Discuss. Math. 12 (1992), 53-65.
35. J.P. Jones and Péter Kiss, On points whose coordinates are terms of a linear recurrence, Fibonacci Quarterly 31 (1993), 239-245.
36. J.P. Jones and Péter Kiss, An asymptotic formula concerning Lehmer numbers, Publications in Math., Debrecen 42 (1993), 199-213.
37. J.P. Jones, Diophantine representation of non-Fibonacci numbers, Applications of Fibonacci Numbers Vol. 5, Proceedings of the Fifth International Conference on Fibonacci Numbers and their Applications, University of St. Andrews, Scotland, July 20 -24, 1992, Bergum, Philippou and Horadam, eds., Kluwer Academic Publishers Dordrecht, 1993 387-392.
38. J.P. Jones and Péter Kiss, Properties of the least common multiple function, Acta Acad Paed. Agriensis, New Series, Section Math. 21 (1993), 65-72.
39. J.P. Jones and Péter Kiss, Pure powers in linear recursive sequences, Acta Acad. Paed. Agriensis, New series, Sect. Math. 22 (1994), 1-7.
40. J.P. Jones and Aviezri S. Fraenkel, Complexities of winning strategies in diophantine games, Jour. of Complexity 11 (1995), 435-455. MR 97c:68066. Abstract
41. J.P. Jones and Péter Kiss, Some identities and congruences for a special family of second order recurrences, Acta Acad. Paed. Agriensis, New Series, Section Math. 23 (1996) 3-9
42. J.P. Jones and Péter Kiss, Some congruences concerning second order recurrences, Acta Acad. Paed. Agriensis, New Series, Section Math. 24 (1997), 29-33.
43. J.P. Jones, Hilbert Levitz, and Warren Nichols, On series of ordinals and combinatorics, Math Logic Quarterly 43 (1997), 121-133. MR 98a:04002.
44. J.P. Jones and Péter Kiss, Some new identities and congruences for Lucas sequences, Discussiones Math. 18 (1998), 39-47. MR 99g:11022.
45. J.P. Jones and Péter Kiss, Representation of integers as a term of a linear recurrence with maximal index, Acta Acad. Paed. Agriensis, New Series, Section Math. 25 (1999), 21-37. MR 2000i:11032.
46. J.P. Jones, Representation of solutions of Pell equations using Lucas sequences, Acta Acad. Paed. Agriensis, New Series, Section Math. 30 (2003), 75-86.

Return to page 1.