1. Über die Nicht-charakterisierbarkeit der Zahlenreihe mittels endlich oder abzählbar unendlich vieler Aussagen mit ausschliesslich Zahlenvariablen;Skolem;Fundamenta Mathematicae,1934
2. Working below a high recursively enumerable degree
3. Completeness theorems, incompleteness theorems and models of arithmetic
4. [23] Downey Rod , Hirschfeldt Denis R. , Lempp Steffen , and Solomon Reed , A ${\rm{\Delta }}_2^0 $ set with no infinite low subset in either it or its complement. Journal of Symbolic Logic , vol. 66 (2001), no. 3, pp. 1371–1381.
5. [8] Chong C. T. and Mourad K. J. , ${\rm{\Sigma }}_n $ definable sets without ${\rm{\Sigma }}_n $ induction. Transactions of the American Mathematical Society, vol. 334 (1992), no. 1, pp. 349–363.