Beklemishev, Lev D. [2010], Gödel incompleteness theorems and the limits of their applicability: I, *Russian Mathematical Surveys*, 65(5), 857–899, doi:10.1070/RM2010v065n05ABEH004703.

Berto, Francesco [2009], *There’s Something about Gödel: The Complete Guide to the Incompleteness Theorem*, Malden, MA: Wiley-Blackwell.

Boolos, George S., Burgess, John P., & Jeffrey, Richard C. [2007], *Computability and Logic*, Cambridge; New York: Cambridge University Press, 5th edn.

Chiswell, Ian & Hodges, Wilfrid [2007], *Mathematical Logic*, London; New York: Oxford University Press.

Craig, William [1953], On axiomatizability within a system, *The Journal of Symbolic Logic*, 18(1), 30–32, doi:10.2307/2266324.

Enderton, Herbert B. [2001], *A Mathematical Introduction to Logic*, San Diego: Academic Press, 2nd edn.

Epstein, Richard L. & Carnielli, Walter A. [2008], *Computability: Computable Functions, Logic, and the Foundations of Mathematics*, Pacific Grove: Advanced Reasoning Forum, 3rd edn.

Isaacson, Daniel [2011], Necessary and sufficient conditions for undecidability of the Gödel sentence and its truth, in: *Logic, Mathematics, Philosophy, Vintage Enthusiasms: Essays in honour of John L. Bell*, edited by D. DeVidi, M. Hallett, & P. Clark, Dordrecht; New York: Springer, 135–152, doi:10.1007/978-94-007-0214-1_7.

Kaye, Richard W. [2007], *The Mathematics of Logic: A guide to completeness theorems and their applications*, Cambridge; New York: Cambridge University Press.

Kleene, Stephen C. [1936], General recursive functions of natural numbers, *Mathematische Annalen*, 112(1), 727–742.

—— [1950], Symmetric form of Gödel’s theorem, *Indagationes Mathematicae*, 12, 244–246.

—— [1952], *Introduction to Metamathematics*, Amsterdam: North-Holland.

Lafitte, Grégory [2009], Busy beavers gone wild, in: *Proceedings of the International Workshop on the Complexity of Simple Programs*, edited by T. Neary, D. Woods, T. Seda, & N. Murphy, Cork, Ireland: Open Publishing Association, Electronic Proceedings in Theoretical Computer Science, vol. 1, 123–129, doi:10.4204/EPTCS.1.12..

Li, Ming & Vitányi, Paul M. B. [2008], *An Introduction to Kolmogorov Complexity and Its Applications*, New York: Springer, 3rd edn.

Oliveira, Igor Carboni & Carnielli, Walter [2008], The Ricean objection: An analogue of Rice’s theorem for first–order theories, *Logic Journal of the IGPL*, 16(6), 585–590, doi:10.1093/jigpal/jzn023.

—— [2009], Erratum to “The Ricean objection: An analogue of Rice’s theorem for first–order theories”, *Logic Journal of the IGPL*, 17(6), 803–804, doi:10.1093/jigpal/jzp030.

Rosser, Barkley [1936], Extensions of some theorems of Gödel and Church, *The Journal of Symbolic Logic*, 1(3), 87–91, doi:10.2307/2269028.

Tarski, Alfred, Mostowski, Andrzej, & Robinson, Raphael M. [1953], *Undecidable Theories*, Amsterdam: North-Holland, reprinted by Dover Publications 2010.

van Dalen, Dirk [2013], *Logic and Structure*, London; New York: Springer, 5th edn.

Wasserman, Wayne U. [2008], It is “Pulling a rabbit out of the hat”: typical diagonal lemma “proofs” beg the question, doi:10.2139/ssrn.1129038.