Tag Archives: Peter J. Cameron

Mathematics and Logic

Large parts of this post are taken up with two subjects:

  1. The notion (due to Collingwood) of criteriological sciences, logic being one of them.

  2. Gödel’s theorems of completeness and incompleteness, as examples of results in the science of logic.

Like the most recent in the current spate of mathematics posts, the present one has arisen from material originally drafted for the first post in this series.

In that post, I defined mathematics as the science whose findings are proved by deduction. This definition does not say what mathematics is about. We can say however what logic is about: it is about mathematics quâ deduction, and more generally about reasoning as such. This makes logic a criteriological science, because logic seeks, examines, clarifies and limits the criteria whereby we can make deductions. As examples of this activity, Gödel’s theorems are, in a crude sense to be refined below, that

  • everything true in all possible mathematical worlds can be deduced;

  • some things true in the world of numbers can never be deduced;

  • the latter theorem is one of those things.

Continue reading

On Gödel’s Incompleteness Theorem

This is an appreciation of Gödel’s Incompleteness Theorem of 1931. I am provoked by a depreciation of the theorem.

I shall review the mathematics of the theorem, first in outline, later in more detail. The mathematics is difficult. I have trouble reproducing it at will and even just confirming what I have already written about it below (for I am adding these words a year after the original publication of this essay).

The difficulty of Gödel’s mathematics is part of the point of this essay. A person who thinks Gödel’s Theorem is unsurprising is probably a person who does not understand it.

In the “Gödel for Dummies” version of the Theorem, there are mathematical sentences that are both true and unprovable. This requires two points of clarification.

Continue reading