consistency Wiktionary, the free dictionary
Moreover, Gödel’s second incompleteness theorem shows that the consistency of sufficiently strong recursively enumerable theories of arithmetic can be tested in a particular way. A theory is complete if, for every formula φ in its language, at least one of φ or ¬φ is a logical consequence of the theory. Hilbert’s program was strongly impacted […]