Hilbert–Bernays-Löb provability conditions

In mathematical logic, the Hilbert–Bernays-Löb provability conditions, named after David Hilbert, Paul Bernays, and Martin Löb, are a set of requirements for formalized provability predicates in formal theories of arithmetic (Smith 2007:224).

These conditions are used in many proofs of Kurt Gödel's second incompleteness theorem. They are also closely related to axioms of provability logic.

This article is issued from Wikipedia. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.