1. G. Cantor, R. Dedekind, Briefwelrel, Hermann, Paris, 1937; traduction française in: J. Cavaillès, Philosophie mathématique, Hermann, Paris, 1962, pp. 177–249.
2. G. Cantor, Uber eine Eigenschaft des Inbegroffes aller reellen algebraischen Zahlen, J. Reine Angew. Math. 77 (1874) 258–262; = Gesamm. abh., pp. 15–118, Springer, Berlin, 1930; traduction française in Acta Math. 2 (1883) 305–310.
3. Definability, decidability and complexity;Cegielski;Ann. Math. Artif. Intell.,1996
4. On arithmetical first-order theories allowing encoding and decoding of lists;Cegielski;Theoret. Comput. Sci.,1999
5. A uniform method for proving lower bounds on the computational complexity of logical theories;Compton;Ann. Pure Appl. Logic,1990