Hilbert's program

<logic> An attempt to avoid both relativity and vicious circularity in the proof of the consistency of formal systems of arithmetic, by using only a small set of extremely intuitive operations to prove the consistency of the system containing that set. (A second phase of the program was to build all of mathematics on the system thus certified to be consistent.) Hopes of accomplishing Hilbert's program were dashed by Goedel's second incompleteness theorem.

See Goedel's theorems, relative consistency proof

[Glossary of First-Order Logic]

<2001-03-16>

Try this search on OneLook / Google


Nearby terms: higher-order predicate logic « high-level language « Hilbert David « Hilbert's program » Hippias » historical determinism » historicism