Applications in Mathematical Logic
The set of all provable sentences in an effective axiomatic system is always a recursively enumerable set. If the system is suitably complex, like first-order arithmetic, then the set T of Gödel numbers of true sentences in the system will be a productive set, which means that whenever W is a recursively enumerable set of true sentences, there is at least one true sentence that is not in W. This can be used to give a rigorous proof of Gödel's first incompleteness theorem, because no recursively enumerable set is productive. The complement of the set T will not be recursively enumerable, and thus T is an example of a productive set whose complement is not creative.
Read more about this topic: Creative And Productive Sets
Famous quotes containing the words mathematical and/or logic:
“The circumstances of human society are too complicated to be submitted to the rigour of mathematical calculation.”
—Marquis De Custine (1790–1857)
“The American Constitution, one of the few modern political documents drawn up by men who were forced by the sternest circumstances to think out what they really had to face instead of chopping logic in a university classroom.”
—George Bernard Shaw (1856–1950)