Lectures on the Philosophy of Mathematics

by Joel David Hamkins

Theorem 12. There are no computable procedures to determine with certainty yes-or-no whether a given arithmetic assertion is valid, whether it is provable, whether it is satisfiable, or whether two arithmetic assertions are logically equivalent.