[Ce96] P. Cegielski: Definability, decidability and complexity. Annals of Mathematics on Artificial Intelligence 16 (1996), 311-341. DOI 10.1007/BF02127802 | MR 1389852

[Gr91] S. Grigorieff: Decidability et complexite des theories logiques. Logique et Informatique: Une Introduction (B. Courcelle - M. Nivat, eds.), I.N.R.I.A., Rocquancourt - France, 1991, pp. 7-97. MR 1146961

[Ko96] I. Korec: List of structures strongest with respect to the first order definability. Preprint 33/1996 of Math. Institute SAV Bratislava, 32pp, latest revision: November 1997, 34pp. MR 1475510

[Ko96a] I. Korec: Definability of addition from multiplication and neighborhood relation and some related results. Proceedings of the Conference on Analytic and Elementary Number Theory, Vienna, July 18-20, 1996 (W. G. Nowak and J. Schoissengeier, eds.), Universitat fur Bodenkultur and Universitat Wien, 1996, pp. 137-148, also Preprint 23/1996 of Math. Institute SAV Bratislava.

[Ko97] I. Korec: Arithmetical operations strongest with respect to the first order definability. Preprint 12/1997 of Math. Institute SAV Bratislava, 12pp.

[Ro49] J. Robinson: Definability and decision problems in arithmetic. Journal of Symbolic Logic 14 (1949), 98-114. DOI 10.2307/2266510 | MR 0031446 | Zbl 0034.00801